./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 35987657 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-?-3598765 [2022-07-22 02:43:14,376 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:43:14,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:43:14,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:43:14,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:43:14,424 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:43:14,432 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:43:14,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:43:14,438 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:43:14,444 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:43:14,446 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:43:14,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:43:14,448 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:43:14,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:43:14,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:43:14,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:43:14,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:43:14,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:43:14,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:43:14,465 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:43:14,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:43:14,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:43:14,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:43:14,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:43:14,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:43:14,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:43:14,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:43:14,480 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:43:14,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:43:14,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:43:14,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:43:14,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:43:14,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:43:14,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:43:14,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:43:14,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:43:14,487 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:43:14,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:43:14,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:43:14,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:43:14,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:43:14,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:43:14,491 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:43:14,529 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:43:14,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:43:14,531 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:43:14,531 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:43:14,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:43:14,533 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:43:14,533 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:43:14,533 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:43:14,533 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:43:14,534 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:43:14,534 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:43:14,535 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:43:14,535 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:43:14,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:43:14,535 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:43:14,535 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:43:14,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:43:14,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:43:14,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:43:14,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:43:14,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:43:14,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:43:14,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:43:14,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:43:14,537 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:43:14,537 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:43:14,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:43:14,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:43:14,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:43:14,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:43:14,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:43:14,541 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:43:14,541 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-22 02:43:14,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:43:14,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:43:14,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:43:14,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:43:14,941 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:43:14,943 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-22 02:43:15,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45bd955e/e179ccac9c604bff9c5e35b72ff904c6/FLAG3efd9283d [2022-07-22 02:43:15,487 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:43:15,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2022-07-22 02:43:15,504 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45bd955e/e179ccac9c604bff9c5e35b72ff904c6/FLAG3efd9283d [2022-07-22 02:43:15,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45bd955e/e179ccac9c604bff9c5e35b72ff904c6 [2022-07-22 02:43:15,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:43:15,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:43:15,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:43:15,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:43:15,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:43:15,906 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:43:15" (1/1) ... [2022-07-22 02:43:15,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6271ee46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:15, skipping insertion in model container [2022-07-22 02:43:15,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:43:15" (1/1) ... [2022-07-22 02:43:15,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:43:15,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:43:16,080 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-22 02:43:16,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:43:16,170 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:43:16,178 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-22 02:43:16,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:43:16,222 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:43:16,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16 WrapperNode [2022-07-22 02:43:16,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:43:16,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:43:16,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:43:16,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:43:16,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,261 INFO L137 Inliner]: procedures = 20, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 363 [2022-07-22 02:43:16,262 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:43:16,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:43:16,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:43:16,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:43:16,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:43:16,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:43:16,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:43:16,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:43:16,328 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (1/1) ... [2022-07-22 02:43:16,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:16,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:16,377 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-22 02:43:16,383 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-22 02:43:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:43:16,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:43:16,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:43:16,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:43:16,479 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:43:16,480 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:43:16,932 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:43:16,940 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:43:16,947 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-22 02:43:16,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:43:16 BoogieIcfgContainer [2022-07-22 02:43:16,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:43:16,953 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:43:16,953 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:43:16,956 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:43:16,956 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:43:16,957 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:43:15" (1/3) ... [2022-07-22 02:43:16,958 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c116cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:43:16, skipping insertion in model container [2022-07-22 02:43:16,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:43:16,958 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:43:16" (2/3) ... [2022-07-22 02:43:16,959 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15c116cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:43:16, skipping insertion in model container [2022-07-22 02:43:16,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:43:16,959 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:43:16" (3/3) ... [2022-07-22 02:43:16,961 INFO L354 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2022-07-22 02:43:17,025 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:43:17,025 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:43:17,025 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:43:17,025 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:43:17,026 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:43:17,026 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:43:17,026 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:43:17,027 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:43:17,032 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-22 02:43:17,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2022-07-22 02:43:17,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:17,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:17,072 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-22 02:43:17,073 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-22 02:43:17,073 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:43:17,076 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-22 02:43:17,091 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 99 [2022-07-22 02:43:17,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:17,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:17,099 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-22 02:43:17,099 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-22 02:43:17,106 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-22 02:43:17,107 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-22 02:43:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2022-07-22 02:43:17,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341233062] [2022-07-22 02:43:17,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,342 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-22 02:43:17,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341233062] [2022-07-22 02:43:17,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341233062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665600959] [2022-07-22 02:43:17,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,352 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:17,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash -696614142, now seen corresponding path program 1 times [2022-07-22 02:43:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420877310] [2022-07-22 02:43:17,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,382 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-22 02:43:17,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420877310] [2022-07-22 02:43:17,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420877310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:43:17,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048834483] [2022-07-22 02:43:17,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,385 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:17,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 02:43:17,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 02:43:17,421 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-22 02:43:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:17,443 INFO L93 Difference]: Finished difference Result 132 states and 226 transitions. [2022-07-22 02:43:17,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 02:43:17,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 226 transitions. [2022-07-22 02:43:17,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 126 states and 220 transitions. [2022-07-22 02:43:17,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-22 02:43:17,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-22 02:43:17,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 220 transitions. [2022-07-22 02:43:17,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:17,472 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2022-07-22 02:43:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 220 transitions. [2022-07-22 02:43:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-22 02:43:17,506 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-22 02:43:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 220 transitions. [2022-07-22 02:43:17,508 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 220 transitions. [2022-07-22 02:43:17,509 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 220 transitions. [2022-07-22 02:43:17,509 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:43:17,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 220 transitions. [2022-07-22 02:43:17,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,513 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:17,513 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:17,516 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-22 02:43:17,516 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-22 02:43:17,516 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-22 02:43:17,521 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-22 02:43:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2022-07-22 02:43:17,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900982094] [2022-07-22 02:43:17,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,575 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-22 02:43:17,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900982094] [2022-07-22 02:43:17,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900982094] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867882791] [2022-07-22 02:43:17,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,580 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:17,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 1 times [2022-07-22 02:43:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526397678] [2022-07-22 02:43:17,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,632 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-22 02:43:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526397678] [2022-07-22 02:43:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526397678] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556450283] [2022-07-22 02:43:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,637 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:17,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:17,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:17,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:17,639 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-22 02:43:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:17,668 INFO L93 Difference]: Finished difference Result 126 states and 219 transitions. [2022-07-22 02:43:17,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:17,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 219 transitions. [2022-07-22 02:43:17,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 219 transitions. [2022-07-22 02:43:17,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-22 02:43:17,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-22 02:43:17,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 219 transitions. [2022-07-22 02:43:17,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:17,674 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2022-07-22 02:43:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 219 transitions. [2022-07-22 02:43:17,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-22 02:43:17,680 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-22 02:43:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 219 transitions. [2022-07-22 02:43:17,681 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 219 transitions. [2022-07-22 02:43:17,681 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 219 transitions. [2022-07-22 02:43:17,681 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:43:17,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 219 transitions. [2022-07-22 02:43:17,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:17,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:17,683 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-22 02:43:17,684 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-22 02:43:17,684 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-22 02:43:17,684 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-22 02:43:17,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2022-07-22 02:43:17,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507327275] [2022-07-22 02:43:17,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,713 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-22 02:43:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507327275] [2022-07-22 02:43:17,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507327275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273332836] [2022-07-22 02:43:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,715 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1432587772, now seen corresponding path program 2 times [2022-07-22 02:43:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394953985] [2022-07-22 02:43:17,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,739 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-22 02:43:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394953985] [2022-07-22 02:43:17,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394953985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613324602] [2022-07-22 02:43:17,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,741 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:17,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:17,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:17,742 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-22 02:43:17,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:17,755 INFO L93 Difference]: Finished difference Result 126 states and 218 transitions. [2022-07-22 02:43:17,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:17,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 218 transitions. [2022-07-22 02:43:17,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 218 transitions. [2022-07-22 02:43:17,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-22 02:43:17,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-22 02:43:17,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 218 transitions. [2022-07-22 02:43:17,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:17,760 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2022-07-22 02:43:17,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 218 transitions. [2022-07-22 02:43:17,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-22 02:43:17,765 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-22 02:43:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 218 transitions. [2022-07-22 02:43:17,766 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 218 transitions. [2022-07-22 02:43:17,766 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 218 transitions. [2022-07-22 02:43:17,766 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:43:17,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 218 transitions. [2022-07-22 02:43:17,767 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:17,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:17,769 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-22 02:43:17,769 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-22 02:43:17,769 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-22 02:43:17,769 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-22 02:43:17,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2022-07-22 02:43:17,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602584491] [2022-07-22 02:43:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,794 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-22 02:43:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602584491] [2022-07-22 02:43:17,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602584491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660308693] [2022-07-22 02:43:17,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,796 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:17,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,797 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 1 times [2022-07-22 02:43:17,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727988221] [2022-07-22 02:43:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,817 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-22 02:43:17,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727988221] [2022-07-22 02:43:17,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727988221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505586446] [2022-07-22 02:43:17,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,819 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:17,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:17,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:17,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:17,821 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-22 02:43:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:17,846 INFO L93 Difference]: Finished difference Result 126 states and 217 transitions. [2022-07-22 02:43:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:17,848 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 217 transitions. [2022-07-22 02:43:17,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 126 states and 217 transitions. [2022-07-22 02:43:17,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2022-07-22 02:43:17,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2022-07-22 02:43:17,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 217 transitions. [2022-07-22 02:43:17,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:17,856 INFO L369 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2022-07-22 02:43:17,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 217 transitions. [2022-07-22 02:43:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-22 02:43:17,866 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-22 02:43:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 217 transitions. [2022-07-22 02:43:17,867 INFO L392 hiAutomatonCegarLoop]: Abstraction has 126 states and 217 transitions. [2022-07-22 02:43:17,868 INFO L374 stractBuchiCegarLoop]: Abstraction has 126 states and 217 transitions. [2022-07-22 02:43:17,868 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:43:17,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 217 transitions. [2022-07-22 02:43:17,869 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2022-07-22 02:43:17,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:17,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:17,871 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-22 02:43:17,873 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-22 02:43:17,873 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-22 02:43:17,873 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-22 02:43:17,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,874 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2022-07-22 02:43:17,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040383593] [2022-07-22 02:43:17,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:17,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:17,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:17,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 883328051, now seen corresponding path program 2 times [2022-07-22 02:43:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:17,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068519079] [2022-07-22 02:43:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:17,973 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-22 02:43:17,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:17,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068519079] [2022-07-22 02:43:17,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068519079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:17,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:17,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:17,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435927267] [2022-07-22 02:43:17,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:17,974 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:17,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:17,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:17,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:17,975 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-22 02:43:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:18,013 INFO L93 Difference]: Finished difference Result 160 states and 279 transitions. [2022-07-22 02:43:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:18,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 279 transitions. [2022-07-22 02:43:18,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2022-07-22 02:43:18,020 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 279 transitions. [2022-07-22 02:43:18,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2022-07-22 02:43:18,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2022-07-22 02:43:18,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 279 transitions. [2022-07-22 02:43:18,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:18,024 INFO L369 hiAutomatonCegarLoop]: Abstraction has 160 states and 279 transitions. [2022-07-22 02:43:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 279 transitions. [2022-07-22 02:43:18,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-07-22 02:43:18,033 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-22 02:43:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 279 transitions. [2022-07-22 02:43:18,034 INFO L392 hiAutomatonCegarLoop]: Abstraction has 160 states and 279 transitions. [2022-07-22 02:43:18,034 INFO L374 stractBuchiCegarLoop]: Abstraction has 160 states and 279 transitions. [2022-07-22 02:43:18,034 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 02:43:18,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 279 transitions. [2022-07-22 02:43:18,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2022-07-22 02:43:18,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:18,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:18,038 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-22 02:43:18,040 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-22 02:43:18,041 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-22 02:43:18,042 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-22 02:43:18,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1535466835, now seen corresponding path program 1 times [2022-07-22 02:43:18,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:18,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012315218] [2022-07-22 02:43:18,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:18,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:18,081 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-22 02:43:18,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:18,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012315218] [2022-07-22 02:43:18,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012315218] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:18,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:18,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:43:18,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796398601] [2022-07-22 02:43:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:18,083 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:18,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:18,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1432528190, now seen corresponding path program 1 times [2022-07-22 02:43:18,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:18,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208060141] [2022-07-22 02:43:18,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:18,123 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-22 02:43:18,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:18,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208060141] [2022-07-22 02:43:18,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208060141] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:18,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:18,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 02:43:18,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353967846] [2022-07-22 02:43:18,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:18,124 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:18,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:18,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:18,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:18,132 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-22 02:43:18,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:18,250 INFO L93 Difference]: Finished difference Result 226 states and 380 transitions. [2022-07-22 02:43:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:43:18,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 380 transitions. [2022-07-22 02:43:18,254 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2022-07-22 02:43:18,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 226 states and 380 transitions. [2022-07-22 02:43:18,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 226 [2022-07-22 02:43:18,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2022-07-22 02:43:18,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 380 transitions. [2022-07-22 02:43:18,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:43:18,258 INFO L369 hiAutomatonCegarLoop]: Abstraction has 226 states and 380 transitions. [2022-07-22 02:43:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 380 transitions. [2022-07-22 02:43:18,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 215. [2022-07-22 02:43:18,274 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-22 02:43:18,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 365 transitions. [2022-07-22 02:43:18,275 INFO L392 hiAutomatonCegarLoop]: Abstraction has 215 states and 365 transitions. [2022-07-22 02:43:18,275 INFO L374 stractBuchiCegarLoop]: Abstraction has 215 states and 365 transitions. [2022-07-22 02:43:18,275 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 02:43:18,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 365 transitions. [2022-07-22 02:43:18,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 177 [2022-07-22 02:43:18,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:18,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:18,280 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-22 02:43:18,280 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-22 02:43:18,281 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-22 02:43:18,281 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-22 02:43:18,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2022-07-22 02:43:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:18,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997123260] [2022-07-22 02:43:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:18,323 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-22 02:43:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997123260] [2022-07-22 02:43:18,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997123260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:18,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:18,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:43:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474481461] [2022-07-22 02:43:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:18,325 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:18,325 INFO L85 PathProgramCache]: Analyzing trace with hash -137740303, now seen corresponding path program 1 times [2022-07-22 02:43:18,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:18,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119089529] [2022-07-22 02:43:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:18,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:18,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:18,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:18,631 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:18,632 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:18,632 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:18,632 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:18,632 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:43:18,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:18,633 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:18,633 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:18,633 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2022-07-22 02:43:18,633 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:18,633 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:18,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-22 02:43:18,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-22 02:43:18,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-22 02:43:18,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-22 02:43:18,662 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-22 02:43:18,665 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-22 02:43:18,667 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-22 02:43:18,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-22 02:43:18,674 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-22 02:43:18,676 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-22 02:43:18,678 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-22 02:43:18,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-22 02:43:18,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-22 02:43:18,684 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-22 02:43:18,688 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-22 02:43:18,691 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-22 02:43:18,695 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-22 02:43:18,697 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-22 02:43:18,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-22 02:43:18,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-22 02:43:18,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-22 02:43:18,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-22 02:43:18,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-22 02:43:18,711 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-22 02:43:18,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-22 02:43:18,717 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-22 02:43:18,931 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:18,932 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:43:18,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:18,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:18,944 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-22 02:43:18,947 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-22 02:43:18,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:18,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:18,971 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:18,971 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-22 02:43:18,988 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-22 02:43:18,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:18,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:18,990 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-22 02:43:18,995 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-22 02:43:18,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:18,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:19,009 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:19,009 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-22 02:43:19,027 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-22 02:43:19,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:19,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:19,064 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-22 02:43:19,065 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-22 02:43:19,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:19,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:19,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-22 02:43:19,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:19,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:19,095 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-22 02:43:19,096 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-22 02:43:19,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:43:19,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:19,155 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:43:19,208 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-22 02:43:19,208 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:19,208 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:19,208 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:19,208 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:19,208 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:43:19,209 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:19,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:19,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:19,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration7_Loop [2022-07-22 02:43:19,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:19,209 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:19,210 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-22 02:43:19,219 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-22 02:43:19,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-22 02:43:19,226 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-22 02:43:19,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-22 02:43:19,233 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-22 02:43:19,237 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-22 02:43:19,240 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-22 02:43:19,242 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-22 02:43:19,244 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-22 02:43:19,246 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-22 02:43:19,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-22 02:43:19,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-22 02:43:19,255 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-22 02:43:19,258 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-22 02:43:19,261 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-22 02:43:19,263 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-22 02:43:19,268 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-22 02:43:19,271 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-22 02:43:19,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:19,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:19,280 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-22 02:43:19,283 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-22 02:43:19,285 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-22 02:43:19,293 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-22 02:43:19,295 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-22 02:43:19,497 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:19,505 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:43:19,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:19,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:19,508 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-22 02:43:19,509 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-22 02:43:19,511 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-22 02:43:19,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:19,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:19,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:19,519 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:19,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:19,521 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:19,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:19,536 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:19,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:19,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:19,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:19,565 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-22 02:43:19,571 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-22 02:43:19,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:19,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:19,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:19,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:19,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:19,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:19,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:19,581 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-22 02:43:19,591 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:43:19,595 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:43:19,595 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:43:19,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:19,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:19,598 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-22 02:43:19,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:43:19,603 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:43:19,603 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:43:19,604 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-07-22 02:43:19,623 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-22 02:43:19,633 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-22 02:43:19,636 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:43:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:43:19,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:19,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:43:19,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:19,815 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-22 02:43:19,819 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-22 02:43:19,820 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-22 02:43:19,880 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-22 02:43:19,918 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-22 02:43:19,922 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-22 02:43:19,923 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-22 02:43:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2022-07-22 02:43:19,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-22 02:43:19,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:19,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-22 02:43:19,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:19,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-22 02:43:19,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:19,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 758 states and 1283 transitions. [2022-07-22 02:43:19,938 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 531 [2022-07-22 02:43:19,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 758 states to 758 states and 1283 transitions. [2022-07-22 02:43:19,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2022-07-22 02:43:19,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2022-07-22 02:43:19,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 758 states and 1283 transitions. [2022-07-22 02:43:19,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:19,947 INFO L369 hiAutomatonCegarLoop]: Abstraction has 758 states and 1283 transitions. [2022-07-22 02:43:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states and 1283 transitions. [2022-07-22 02:43:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 575. [2022-07-22 02:43:19,961 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-22 02:43:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 975 transitions. [2022-07-22 02:43:19,964 INFO L392 hiAutomatonCegarLoop]: Abstraction has 575 states and 975 transitions. [2022-07-22 02:43:19,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:19,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:19,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:19,965 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-22 02:43:20,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:20,052 INFO L93 Difference]: Finished difference Result 1195 states and 1962 transitions. [2022-07-22 02:43:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 02:43:20,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1195 states and 1962 transitions. [2022-07-22 02:43:20,064 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 732 [2022-07-22 02:43:20,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1195 states to 1195 states and 1962 transitions. [2022-07-22 02:43:20,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 818 [2022-07-22 02:43:20,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 818 [2022-07-22 02:43:20,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1195 states and 1962 transitions. [2022-07-22 02:43:20,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:20,075 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1195 states and 1962 transitions. [2022-07-22 02:43:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states and 1962 transitions. [2022-07-22 02:43:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1174. [2022-07-22 02:43:20,094 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-22 02:43:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1938 transitions. [2022-07-22 02:43:20,101 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1174 states and 1938 transitions. [2022-07-22 02:43:20,101 INFO L374 stractBuchiCegarLoop]: Abstraction has 1174 states and 1938 transitions. [2022-07-22 02:43:20,101 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 02:43:20,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1174 states and 1938 transitions. [2022-07-22 02:43:20,108 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 730 [2022-07-22 02:43:20,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:20,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:20,109 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-22 02:43:20,109 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-22 02:43:20,109 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-22 02:43:20,109 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-22 02:43:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:20,110 INFO L85 PathProgramCache]: Analyzing trace with hash 842409169, now seen corresponding path program 1 times [2022-07-22 02:43:20,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:20,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632379730] [2022-07-22 02:43:20,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:20,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:20,163 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-22 02:43:20,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:20,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632379730] [2022-07-22 02:43:20,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632379730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:20,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:20,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:43:20,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210758504] [2022-07-22 02:43:20,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:20,165 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:20,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1724241163, now seen corresponding path program 1 times [2022-07-22 02:43:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:20,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504849568] [2022-07-22 02:43:20,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:20,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:20,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:20,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:20,421 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:20,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:20,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:20,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:20,422 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:43:20,422 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,422 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:20,422 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:20,422 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2022-07-22 02:43:20,422 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:20,422 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:20,427 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-22 02:43:20,430 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-22 02:43:20,433 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-22 02:43:20,435 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-22 02:43:20,439 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-22 02:43:20,441 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-22 02:43:20,446 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-22 02:43:20,448 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-22 02:43:20,450 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-22 02:43:20,453 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-22 02:43:20,457 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-22 02:43:20,460 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-22 02:43:20,465 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-22 02:43:20,469 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-22 02:43:20,471 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-22 02:43:20,476 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-22 02:43:20,479 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-22 02:43:20,482 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-22 02:43:20,486 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-22 02:43:20,489 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-22 02:43:20,491 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-22 02:43:20,493 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-22 02:43:20,495 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-22 02:43:20,497 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-22 02:43:20,499 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-22 02:43:20,503 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-22 02:43:20,708 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:20,709 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:43:20,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,711 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-22 02:43:20,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,734 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-22 02:43:20,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,740 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-22 02:43:20,758 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-22 02:43:20,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,761 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-22 02:43:20,763 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-22 02:43:20,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,764 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,771 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,771 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-22 02:43:20,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-22 02:43:20,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,798 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-22 02:43:20,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,807 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-22 02:43:20,813 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,814 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-22 02:43:20,833 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-22 02:43:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,835 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-22 02:43:20,835 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-22 02:43:20,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,848 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,848 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-22 02:43:20,866 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-22 02:43:20,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,868 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-22 02:43:20,869 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-22 02:43:20,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,907 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:20,908 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-22 02:43:20,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-22 02:43:20,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,924 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-22 02:43:20,925 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-22 02:43:20,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:20,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,949 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-22 02:43:20,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:20,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:20,951 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-22 02:43:20,954 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-22 02:43:20,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:43:20,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:20,983 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:43:20,999 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-22 02:43:21,002 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:21,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:21,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:21,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:21,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:43:21,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:21,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:21,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration8_Loop [2022-07-22 02:43:21,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:21,003 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:21,004 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-22 02:43:21,009 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-22 02:43:21,011 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-22 02:43:21,013 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-22 02:43:21,015 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-22 02:43:21,017 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-22 02:43:21,020 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-22 02:43:21,022 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-22 02:43:21,025 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-22 02:43:21,027 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-22 02:43:21,028 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-22 02:43:21,032 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-22 02:43:21,034 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-22 02:43:21,037 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-22 02:43:21,041 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-22 02:43:21,043 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-22 02:43:21,045 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-22 02:43:21,049 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-22 02:43:21,051 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-22 02:43:21,053 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-22 02:43:21,055 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-22 02:43:21,057 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-22 02:43:21,058 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-22 02:43:21,060 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-22 02:43:21,063 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-22 02:43:21,067 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-22 02:43:21,255 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:21,255 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:43:21,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,260 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-22 02:43:21,268 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-22 02:43:21,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,275 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:21,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,276 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:21,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,279 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-22 02:43:21,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:21,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,306 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-22 02:43:21,307 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-22 02:43:21,310 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-22 02:43:21,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:21,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:21,316 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,369 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-22 02:43:21,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,370 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-22 02:43:21,371 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-22 02:43:21,373 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-22 02:43:21,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:21,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:21,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,409 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-22 02:43:21,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,410 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-22 02:43:21,411 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-22 02:43:21,412 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-22 02:43:21,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:21,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:21,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:21,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,436 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-22 02:43:21,437 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-22 02:43:21,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:43:21,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,445 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:21,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,446 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:21,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:21,474 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-22 02:43:21,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,476 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-22 02:43:21,481 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-22 02:43:21,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-22 02:43:21,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:21,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:21,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:21,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:21,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:21,490 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:21,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:21,509 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:43:21,516 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:43:21,516 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:43:21,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:21,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:21,520 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-22 02:43:21,528 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:43:21,528 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:43:21,528 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:43:21,528 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] [2022-07-22 02:43:21,552 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-22 02:43:21,559 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-22 02:43:21,560 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:43:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:21,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:43:21,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:21,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:43:21,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:21,720 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-22 02:43:21,766 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-22 02:43:21,767 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-22 02:43:21,767 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-22 02:43:21,815 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-22 02:43:21,816 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-22 02:43:21,816 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-22 02:43:21,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2022-07-22 02:43:21,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 24 letters. Loop has 28 letters. [2022-07-22 02:43:21,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:21,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 52 letters. Loop has 28 letters. [2022-07-22 02:43:21,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:21,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 371 transitions. Stem has 24 letters. Loop has 56 letters. [2022-07-22 02:43:21,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:21,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1955 states and 3238 transitions. [2022-07-22 02:43:21,832 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1128 [2022-07-22 02:43:21,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1955 states to 1955 states and 3238 transitions. [2022-07-22 02:43:21,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1206 [2022-07-22 02:43:21,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1215 [2022-07-22 02:43:21,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1955 states and 3238 transitions. [2022-07-22 02:43:21,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:21,847 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1955 states and 3238 transitions. [2022-07-22 02:43:21,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1955 states and 3238 transitions. [2022-07-22 02:43:21,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1955 to 1008. [2022-07-22 02:43:21,867 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-22 02:43:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1668 transitions. [2022-07-22 02:43:21,872 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1008 states and 1668 transitions. [2022-07-22 02:43:21,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:21,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:21,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:21,873 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-22 02:43:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:21,932 INFO L93 Difference]: Finished difference Result 1032 states and 1681 transitions. [2022-07-22 02:43:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:43:21,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1032 states and 1681 transitions. [2022-07-22 02:43:21,939 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 579 [2022-07-22 02:43:21,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1032 states to 1032 states and 1681 transitions. [2022-07-22 02:43:21,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2022-07-22 02:43:21,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2022-07-22 02:43:21,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1032 states and 1681 transitions. [2022-07-22 02:43:21,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:21,946 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1032 states and 1681 transitions. [2022-07-22 02:43:21,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states and 1681 transitions. [2022-07-22 02:43:21,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 942. [2022-07-22 02:43:21,959 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-22 02:43:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1541 transitions. [2022-07-22 02:43:21,962 INFO L392 hiAutomatonCegarLoop]: Abstraction has 942 states and 1541 transitions. [2022-07-22 02:43:21,962 INFO L374 stractBuchiCegarLoop]: Abstraction has 942 states and 1541 transitions. [2022-07-22 02:43:21,962 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 02:43:21,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 942 states and 1541 transitions. [2022-07-22 02:43:21,966 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 579 [2022-07-22 02:43:21,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:21,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:21,967 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-22 02:43:21,967 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-22 02:43:21,967 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-22 02:43:21,967 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-22 02:43:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash -666236546, now seen corresponding path program 1 times [2022-07-22 02:43:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:21,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124883784] [2022-07-22 02:43:21,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:21,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:21,993 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-22 02:43:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:21,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124883784] [2022-07-22 02:43:21,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124883784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:21,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:21,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 02:43:21,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347830479] [2022-07-22 02:43:21,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:21,994 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:21,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:21,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1464581643, now seen corresponding path program 1 times [2022-07-22 02:43:21,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:21,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098989489] [2022-07-22 02:43:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:21,999 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:22,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:22,193 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:22,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:22,194 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:22,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:22,194 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:43:22,194 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,194 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:22,194 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:22,194 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration9_Loop [2022-07-22 02:43:22,194 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:22,194 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:22,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,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-22 02:43:22,202 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-22 02:43:22,204 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-22 02:43:22,206 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-22 02:43:22,208 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-22 02:43:22,210 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-22 02:43:22,219 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-22 02:43:22,221 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-22 02:43:22,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-22 02:43:22,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,231 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-22 02:43:22,232 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-22 02:43:22,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-22 02:43:22,236 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-22 02:43:22,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-22 02:43:22,240 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-22 02:43:22,244 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-22 02:43:22,245 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-22 02:43:22,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-22 02:43:22,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-22 02:43:22,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-22 02:43:22,255 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-22 02:43:22,264 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-22 02:43:22,269 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-22 02:43:22,453 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:22,453 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:43:22,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,456 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-22 02:43:22,458 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-22 02:43:22,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:22,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,470 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:22,470 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-22 02:43:22,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:22,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,487 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-22 02:43:22,488 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-22 02:43:22,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:22,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,510 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:22,510 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-22 02:43:22,530 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-22 02:43:22,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,532 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-22 02:43:22,536 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-22 02:43:22,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:22,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,543 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:22,543 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-22 02:43:22,558 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-22 02:43:22,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,560 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-22 02:43:22,565 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-22 02:43:22,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:22,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,576 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:22,577 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-22 02:43:22,594 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-22 02:43:22,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,595 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-22 02:43:22,596 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-22 02:43:22,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:22,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,609 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:22,609 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-22 02:43:22,624 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-22 02:43:22,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,626 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-22 02:43:22,627 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-22 02:43:22,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:22,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,639 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:43:22,640 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-22 02:43:22,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-22 02:43:22,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,657 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-22 02:43:22,659 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-22 02:43:22,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:43:22,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 02:43:22,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,690 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-22 02:43:22,691 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-22 02:43:22,696 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:43:22,696 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:43:22,728 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:43:22,731 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-22 02:43:22,732 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:43:22,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:43:22,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:43:22,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:43:22,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:43:22,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:43:22,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:43:22,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration9_Loop [2022-07-22 02:43:22,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:43:22,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:43:22,733 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-22 02:43:22,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-22 02:43:22,738 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-22 02:43:22,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-22 02:43:22,740 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-22 02:43:22,742 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-22 02:43:22,744 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-22 02:43:22,753 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-22 02:43:22,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,761 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-22 02:43:22,762 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-22 02:43:22,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,782 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-22 02:43:22,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 02:43:22,791 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-22 02:43:22,793 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-22 02:43:22,796 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-22 02:43:22,800 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-22 02:43:22,804 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-22 02:43:22,807 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-22 02:43:22,811 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-22 02:43:22,996 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:43:22,996 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:43:22,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:22,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:22,998 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-22 02:43:23,003 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-22 02:43:23,004 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-22 02:43:23,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,009 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:23,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:23,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,027 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-22 02:43:23,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,028 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-22 02:43:23,029 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-22 02:43:23,031 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-22 02:43:23,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,037 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:23,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,037 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:23,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 02:43:23,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,062 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-22 02:43:23,063 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-22 02:43:23,064 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-22 02:43:23,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,070 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:23,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,071 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:23,071 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,087 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-22 02:43:23,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,089 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-22 02:43:23,090 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-22 02:43:23,091 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-22 02:43:23,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,097 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:23,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,098 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:23,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-22 02:43:23,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,117 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-22 02:43:23,118 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-22 02:43:23,119 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-22 02:43:23,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,126 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:23,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,126 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:23,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-22 02:43:23,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,145 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-22 02:43:23,146 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-22 02:43:23,147 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-22 02:43:23,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,153 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:23,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,154 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:23,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,171 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-22 02:43:23,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,173 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-22 02:43:23,173 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-22 02:43:23,175 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-22 02:43:23,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,182 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,182 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:23,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,183 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:23,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,201 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-22 02:43:23,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,203 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-22 02:43:23,204 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-22 02:43:23,205 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-22 02:43:23,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,211 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 02:43:23,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,212 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-22 02:43:23,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 02:43:23,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,236 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-22 02:43:23,236 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-22 02:43:23,238 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-22 02:43:23,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:23,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:23,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,261 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-22 02:43:23,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,262 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-22 02:43:23,265 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-22 02:43:23,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:43:23,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:23,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:23,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:43:23,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 02:43:23,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,290 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-22 02:43:23,290 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-22 02:43:23,292 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-22 02:43:23,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:43:23,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:43:23,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:43:23,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:43:23,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:43:23,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:43:23,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:43:23,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:43:23,318 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:43:23,318 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:43:23,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:43:23,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:43:23,322 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-22 02:43:23,324 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-22 02:43:23,325 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:43:23,325 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:43:23,325 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:43:23,325 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -2*~e_e~0 + 3 Supporting invariants [] [2022-07-22 02:43:23,349 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-22 02:43:23,351 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:43:23,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:23,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:43:23,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:23,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:43:23,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:43:23,482 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-22 02:43:23,482 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-22 02:43:23,482 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-22 02:43:23,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 02:43:23,537 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-22 02:43:23,538 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-22 02:43:23,539 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-22 02:43:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-07-22 02:43:23,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 28 letters. [2022-07-22 02:43:23,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:23,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 53 letters. Loop has 28 letters. [2022-07-22 02:43:23,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:23,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 204 transitions. Stem has 25 letters. Loop has 56 letters. [2022-07-22 02:43:23,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:43:23,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2635 states and 4302 transitions. [2022-07-22 02:43:23,565 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1122 [2022-07-22 02:43:23,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2635 states to 2635 states and 4302 transitions. [2022-07-22 02:43:23,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1202 [2022-07-22 02:43:23,582 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1223 [2022-07-22 02:43:23,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2635 states and 4302 transitions. [2022-07-22 02:43:23,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:23,583 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2635 states and 4302 transitions. [2022-07-22 02:43:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states and 4302 transitions. [2022-07-22 02:43:23,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 2614. [2022-07-22 02:43:23,625 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-22 02:43:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 4267 transitions. [2022-07-22 02:43:23,635 INFO L392 hiAutomatonCegarLoop]: Abstraction has 2614 states and 4267 transitions. [2022-07-22 02:43:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 02:43:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 02:43:23,636 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-22 02:43:23,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:23,707 INFO L93 Difference]: Finished difference Result 3358 states and 5390 transitions. [2022-07-22 02:43:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 02:43:23,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3358 states and 5390 transitions. [2022-07-22 02:43:23,728 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1296 [2022-07-22 02:43:23,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3358 states to 3358 states and 5390 transitions. [2022-07-22 02:43:23,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1360 [2022-07-22 02:43:23,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1360 [2022-07-22 02:43:23,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3358 states and 5390 transitions. [2022-07-22 02:43:23,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:23,781 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2022-07-22 02:43:23,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states and 5390 transitions. [2022-07-22 02:43:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3358. [2022-07-22 02:43:23,836 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-22 02:43:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 5390 transitions. [2022-07-22 02:43:23,849 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2022-07-22 02:43:23,849 INFO L374 stractBuchiCegarLoop]: Abstraction has 3358 states and 5390 transitions. [2022-07-22 02:43:23,849 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 02:43:23,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3358 states and 5390 transitions. [2022-07-22 02:43:23,864 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1296 [2022-07-22 02:43:23,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:23,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:23,865 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-22 02:43:23,865 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:23,866 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-22 02:43:23,866 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-22 02:43:23,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:23,866 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2022-07-22 02:43:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:23,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164995406] [2022-07-22 02:43:23,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:23,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:23,873 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:23,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:23,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 129447733, now seen corresponding path program 1 times [2022-07-22 02:43:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:23,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180303695] [2022-07-22 02:43:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:23,893 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-22 02:43:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:23,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180303695] [2022-07-22 02:43:23,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180303695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:23,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:23,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22657233] [2022-07-22 02:43:23,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:23,896 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:43:23,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:23,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:23,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:23,897 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-22 02:43:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:23,967 INFO L93 Difference]: Finished difference Result 5264 states and 8290 transitions. [2022-07-22 02:43:23,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:23,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5264 states and 8290 transitions. [2022-07-22 02:43:24,000 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2044 [2022-07-22 02:43:24,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5264 states to 5264 states and 8290 transitions. [2022-07-22 02:43:24,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2110 [2022-07-22 02:43:24,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2110 [2022-07-22 02:43:24,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5264 states and 8290 transitions. [2022-07-22 02:43:24,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:24,040 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2022-07-22 02:43:24,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5264 states and 8290 transitions. [2022-07-22 02:43:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5264 to 5264. [2022-07-22 02:43:24,130 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-22 02:43:24,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5264 states to 5264 states and 8290 transitions. [2022-07-22 02:43:24,145 INFO L392 hiAutomatonCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2022-07-22 02:43:24,145 INFO L374 stractBuchiCegarLoop]: Abstraction has 5264 states and 8290 transitions. [2022-07-22 02:43:24,145 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 02:43:24,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5264 states and 8290 transitions. [2022-07-22 02:43:24,183 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2044 [2022-07-22 02:43:24,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:24,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:24,184 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-22 02:43:24,184 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:24,184 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-22 02:43:24,184 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-22 02:43:24,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2022-07-22 02:43:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:24,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806705486] [2022-07-22 02:43:24,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:24,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,193 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1292266880, now seen corresponding path program 1 times [2022-07-22 02:43:24,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:24,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333807240] [2022-07-22 02:43:24,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:24,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:24,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash 373312376, now seen corresponding path program 1 times [2022-07-22 02:43:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:24,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189282654] [2022-07-22 02:43:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:24,228 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-22 02:43:24,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:24,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189282654] [2022-07-22 02:43:24,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189282654] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:24,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:24,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:24,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344229026] [2022-07-22 02:43:24,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:24,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:24,256 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-22 02:43:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:24,298 INFO L93 Difference]: Finished difference Result 8154 states and 12722 transitions. [2022-07-22 02:43:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:24,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8154 states and 12722 transitions. [2022-07-22 02:43:24,336 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 3194 [2022-07-22 02:43:24,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8154 states to 8154 states and 12722 transitions. [2022-07-22 02:43:24,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3262 [2022-07-22 02:43:24,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3262 [2022-07-22 02:43:24,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8154 states and 12722 transitions. [2022-07-22 02:43:24,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:24,423 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2022-07-22 02:43:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8154 states and 12722 transitions. [2022-07-22 02:43:24,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8154 to 8154. [2022-07-22 02:43:24,570 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-22 02:43:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8154 states to 8154 states and 12722 transitions. [2022-07-22 02:43:24,593 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2022-07-22 02:43:24,593 INFO L374 stractBuchiCegarLoop]: Abstraction has 8154 states and 12722 transitions. [2022-07-22 02:43:24,593 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 02:43:24,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8154 states and 12722 transitions. [2022-07-22 02:43:24,704 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 3194 [2022-07-22 02:43:24,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:24,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:24,720 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-22 02:43:24,720 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:24,720 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-22 02:43:24,720 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-22 02:43:24,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:24,721 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2022-07-22 02:43:24,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:24,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441872785] [2022-07-22 02:43:24,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:24,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:24,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1353841090, now seen corresponding path program 1 times [2022-07-22 02:43:24,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:24,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795703373] [2022-07-22 02:43:24,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:24,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,751 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:24,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1363944758, now seen corresponding path program 1 times [2022-07-22 02:43:24,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:24,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963258591] [2022-07-22 02:43:24,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:24,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:24,771 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-22 02:43:24,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:24,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963258591] [2022-07-22 02:43:24,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963258591] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:24,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:24,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:24,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037225569] [2022-07-22 02:43:24,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:24,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:24,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:24,811 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-22 02:43:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:24,875 INFO L93 Difference]: Finished difference Result 12961 states and 20031 transitions. [2022-07-22 02:43:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:24,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12961 states and 20031 transitions. [2022-07-22 02:43:25,040 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-22 02:43:25,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12961 states to 12961 states and 20031 transitions. [2022-07-22 02:43:25,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5220 [2022-07-22 02:43:25,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5220 [2022-07-22 02:43:25,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12961 states and 20031 transitions. [2022-07-22 02:43:25,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:25,107 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2022-07-22 02:43:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12961 states and 20031 transitions. [2022-07-22 02:43:25,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12961 to 12961. [2022-07-22 02:43:25,284 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-22 02:43:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 20031 transitions. [2022-07-22 02:43:25,314 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2022-07-22 02:43:25,314 INFO L374 stractBuchiCegarLoop]: Abstraction has 12961 states and 20031 transitions. [2022-07-22 02:43:25,314 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 02:43:25,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12961 states and 20031 transitions. [2022-07-22 02:43:25,359 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-22 02:43:25,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:25,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:25,360 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-22 02:43:25,360 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:25,360 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-22 02:43:25,360 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-22 02:43:25,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2022-07-22 02:43:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:25,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018579848] [2022-07-22 02:43:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:25,374 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-22 02:43:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:25,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018579848] [2022-07-22 02:43:25,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018579848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:25,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:25,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:25,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719005569] [2022-07-22 02:43:25,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:25,377 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:43:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:25,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1353841090, now seen corresponding path program 2 times [2022-07-22 02:43:25,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:25,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341219232] [2022-07-22 02:43:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:25,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:25,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:25,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:25,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:25,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:25,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:25,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:25,486 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-22 02:43:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:25,535 INFO L93 Difference]: Finished difference Result 12909 states and 19944 transitions. [2022-07-22 02:43:25,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:25,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12909 states and 19944 transitions. [2022-07-22 02:43:25,610 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-22 02:43:25,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12909 states to 12909 states and 19944 transitions. [2022-07-22 02:43:25,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5170 [2022-07-22 02:43:25,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5170 [2022-07-22 02:43:25,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12909 states and 19944 transitions. [2022-07-22 02:43:25,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:25,672 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2022-07-22 02:43:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12909 states and 19944 transitions. [2022-07-22 02:43:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12909 to 12909. [2022-07-22 02:43:25,956 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-22 02:43:25,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12909 states to 12909 states and 19944 transitions. [2022-07-22 02:43:25,991 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2022-07-22 02:43:25,991 INFO L374 stractBuchiCegarLoop]: Abstraction has 12909 states and 19944 transitions. [2022-07-22 02:43:25,991 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 02:43:25,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12909 states and 19944 transitions. [2022-07-22 02:43:26,028 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 5098 [2022-07-22 02:43:26,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:26,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:26,029 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-22 02:43:26,029 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:26,029 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-22 02:43:26,029 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-22 02:43:26,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:26,030 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2022-07-22 02:43:26,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:26,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605347053] [2022-07-22 02:43:26,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:26,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:26,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:26,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:26,056 INFO L85 PathProgramCache]: Analyzing trace with hash -982249908, now seen corresponding path program 1 times [2022-07-22 02:43:26,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:26,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964992101] [2022-07-22 02:43:26,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:26,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:26,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:26,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:26,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 665734724, now seen corresponding path program 1 times [2022-07-22 02:43:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:26,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636121932] [2022-07-22 02:43:26,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:43:26,089 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-22 02:43:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:43:26,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636121932] [2022-07-22 02:43:26,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636121932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:43:26,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:43:26,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:43:26,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477630588] [2022-07-22 02:43:26,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:43:26,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:43:26,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:43:26,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:43:26,141 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-22 02:43:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:43:26,274 INFO L93 Difference]: Finished difference Result 20133 states and 30924 transitions. [2022-07-22 02:43:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:43:26,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20133 states and 30924 transitions. [2022-07-22 02:43:26,374 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 8032 [2022-07-22 02:43:26,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20133 states to 20133 states and 30924 transitions. [2022-07-22 02:43:26,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8104 [2022-07-22 02:43:26,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8104 [2022-07-22 02:43:26,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20133 states and 30924 transitions. [2022-07-22 02:43:26,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 02:43:26,461 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20133 states and 30924 transitions. [2022-07-22 02:43:26,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20133 states and 30924 transitions. [2022-07-22 02:43:26,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20133 to 20013. [2022-07-22 02:43:26,775 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-22 02:43:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 30804 transitions. [2022-07-22 02:43:26,936 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20013 states and 30804 transitions. [2022-07-22 02:43:26,936 INFO L374 stractBuchiCegarLoop]: Abstraction has 20013 states and 30804 transitions. [2022-07-22 02:43:26,936 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 02:43:26,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20013 states and 30804 transitions. [2022-07-22 02:43:26,999 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 7984 [2022-07-22 02:43:27,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:43:27,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:43:27,000 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-22 02:43:27,000 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:43:27,001 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-22 02:43:27,001 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-22 02:43:27,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 5 times [2022-07-22 02:43:27,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:27,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470076658] [2022-07-22 02:43:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:27,008 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:27,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:27,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:27,015 INFO L85 PathProgramCache]: Analyzing trace with hash -385011466, now seen corresponding path program 1 times [2022-07-22 02:43:27,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206531200] [2022-07-22 02:43:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:27,018 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:27,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:27,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:43:27,021 INFO L85 PathProgramCache]: Analyzing trace with hash -837095426, now seen corresponding path program 1 times [2022-07-22 02:43:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:43:27,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070205655] [2022-07-22 02:43:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:43:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:43:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:27,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:43:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:43:27,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:43:27,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 02:43:27 BoogieIcfgContainer [2022-07-22 02:43:27,944 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 02:43:27,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 02:43:27,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 02:43:27,945 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 02:43:27,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:43:16" (3/4) ... [2022-07-22 02:43:27,947 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-22 02:43:27,981 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 02:43:27,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 02:43:27,982 INFO L158 Benchmark]: Toolchain (without parser) took 12081.19ms. Allocated memory was 58.7MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 37.0MB in the beginning and 919.9MB in the end (delta: -882.9MB). Peak memory consumption was 235.3MB. Max. memory is 16.1GB. [2022-07-22 02:43:27,982 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:43:27,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.14ms. Allocated memory is still 58.7MB. Free memory was 36.8MB in the beginning and 38.6MB in the end (delta: -1.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 02:43:27,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.77ms. Allocated memory is still 58.7MB. Free memory was 38.6MB in the beginning and 36.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:43:27,983 INFO L158 Benchmark]: Boogie Preprocessor took 63.24ms. Allocated memory is still 58.7MB. Free memory was 36.3MB in the beginning and 34.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:43:27,983 INFO L158 Benchmark]: RCFGBuilder took 624.84ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 34.2MB in the beginning and 43.9MB in the end (delta: -9.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-22 02:43:27,984 INFO L158 Benchmark]: BuchiAutomizer took 10991.12ms. Allocated memory was 73.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.7MB in the beginning and 922.0MB in the end (delta: -878.3MB). Peak memory consumption was 304.8MB. Max. memory is 16.1GB. [2022-07-22 02:43:27,984 INFO L158 Benchmark]: Witness Printer took 37.31ms. Allocated memory is still 1.2GB. Free memory was 922.0MB in the beginning and 919.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:43:27,985 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.23ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 47.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.14ms. Allocated memory is still 58.7MB. Free memory was 36.8MB in the beginning and 38.6MB in the end (delta: -1.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.77ms. Allocated memory is still 58.7MB. Free memory was 38.6MB in the beginning and 36.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.24ms. Allocated memory is still 58.7MB. Free memory was 36.3MB in the beginning and 34.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 624.84ms. Allocated memory was 58.7MB in the beginning and 73.4MB in the end (delta: 14.7MB). Free memory was 34.2MB in the beginning and 43.9MB in the end (delta: -9.7MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * BuchiAutomizer took 10991.12ms. Allocated memory was 73.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.7MB in the beginning and 922.0MB in the end (delta: -878.3MB). Peak memory consumption was 304.8MB. Max. memory is 16.1GB. * Witness Printer took 37.31ms. Allocated memory is still 1.2GB. Free memory was 922.0MB in the beginning and 919.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 10.9s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 6.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 11. Automata minimization 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1393 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.9s 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.4s 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: 30ms 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@1b3d6678=0, e_p_in=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@fc563ec=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@43fa0df6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6c6e46f0=0, t_b=0, p_in=0, wb_pc=0, data=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5fafa29=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-22 02:43:28,039 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)