./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:12:26,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:12:26,698 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:12:26,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:12:26,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:12:26,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:12:26,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:12:26,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:12:26,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:12:26,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:12:26,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:12:26,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:12:26,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:12:26,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:12:26,726 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:12:26,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:12:26,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:12:26,727 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:12:26,727 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:12:26,727 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:12:26,727 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:12:26,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:12:26,728 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:12:26,728 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:12:26,728 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:12:26,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:12:26,729 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:12:26,729 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:12:26,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:12:26,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:12:26,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:12:26,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:12:26,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:12:26,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:12:26,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:12:26,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:12:26,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:12:26,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:12:26,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:12:26,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:12:26,732 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:12:26,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:12:26,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:12:26,733 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 02:12:26,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:12:26,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:12:26,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:12:26,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:12:26,951 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:12:26,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 02:12:28,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:12:28,290 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:12:28,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 02:12:28,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afd00bd2/a09e4be1daee4aba8a2c6d26c6de58eb/FLAG41c3194c4 [2024-06-28 02:12:28,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7afd00bd2/a09e4be1daee4aba8a2c6d26c6de58eb [2024-06-28 02:12:28,317 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:12:28,317 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:12:28,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-28 02:12:28,468 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:12:28,470 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:12:28,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:12:28,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:12:28,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:12:28,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:12:28" (1/2) ... [2024-06-28 02:12:28,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264bbf24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:12:28, skipping insertion in model container [2024-06-28 02:12:28,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:12:28" (1/2) ... [2024-06-28 02:12:28,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3cd5d5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:12:28, skipping insertion in model container [2024-06-28 02:12:28,480 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:28" (2/2) ... [2024-06-28 02:12:28,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@264bbf24 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:28, skipping insertion in model container [2024-06-28 02:12:28,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:28" (2/2) ... [2024-06-28 02:12:28,481 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:12:28,528 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:12:28,529 INFO L97 edCorrectnessWitness]: Location invariant before [L807-L807] (((((((((((((! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-28 02:12:28,529 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] (((((((((((((! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (x == 0 || x == 1)) && (x$mem_tmp == 0 || x$mem_tmp == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 1)) && (x$w_buff1 == 0 || x$w_buff1 == 1)) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0) [2024-06-28 02:12:28,529 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:12:28,530 INFO L106 edCorrectnessWitness]: ghost_update [L804-L804] multithreaded = 1; [2024-06-28 02:12:28,566 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:12:28,711 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2024-06-28 02:12:28,863 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:12:28,871 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:12:28,899 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:12:28,964 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:12:29,006 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:12:29,020 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29 WrapperNode [2024-06-28 02:12:29,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:12:29,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:12:29,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:12:29,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:12:29,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,079 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2024-06-28 02:12:29,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:12:29,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:12:29,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:12:29,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:12:29,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,113 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 02:12:29,115 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,115 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:12:29,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:12:29,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:12:29,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:12:29,142 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (1/1) ... [2024-06-28 02:12:29,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:12:29,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:12:29,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 02:12:29,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 02:12:29,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:12:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:12:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:12:29,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:12:29,215 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:12:29,215 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:12:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:12:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:12:29,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:12:29,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:12:29,217 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:12:29,313 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:12:29,315 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:12:29,581 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:12:29,589 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:12:29,733 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:12:29,738 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:12:29,739 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:12:29 BoogieIcfgContainer [2024-06-28 02:12:29,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:12:29,741 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:12:29,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:12:29,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:12:29,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:12:28" (1/4) ... [2024-06-28 02:12:29,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0af194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:12:29, skipping insertion in model container [2024-06-28 02:12:29,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:12:28" (2/4) ... [2024-06-28 02:12:29,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0af194 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:12:29, skipping insertion in model container [2024-06-28 02:12:29,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:12:29" (3/4) ... [2024-06-28 02:12:29,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0af194 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:12:29, skipping insertion in model container [2024-06-28 02:12:29,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:12:29" (4/4) ... [2024-06-28 02:12:29,748 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-28 02:12:29,760 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:12:29,760 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 02:12:29,760 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:12:29,793 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:12:29,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-06-28 02:12:29,848 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-28 02:12:29,849 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:12:29,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-06-28 02:12:29,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-06-28 02:12:29,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-06-28 02:12:29,859 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:12:29,864 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4dc1f068, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:12:29,864 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 02:12:29,866 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:12:29,867 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:12:29,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:12:29,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:29,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:12:29,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:29,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash 302171920, now seen corresponding path program 1 times [2024-06-28 02:12:29,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:29,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342220558] [2024-06-28 02:12:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:29,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:30,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:30,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342220558] [2024-06-28 02:12:30,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342220558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:30,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:30,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:12:30,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650005740] [2024-06-28 02:12:30,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:30,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:12:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:12:30,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:12:30,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-06-28 02:12:30,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:30,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:30,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-06-28 02:12:30,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:30,772 INFO L124 PetriNetUnfolderBase]: 384/675 cut-off events. [2024-06-28 02:12:30,773 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-28 02:12:30,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 675 events. 384/675 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3381 event pairs, 160 based on Foata normal form. 36/668 useless extension candidates. Maximal degree in co-relation 1328. Up to 639 conditions per place. [2024-06-28 02:12:30,782 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 29 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-28 02:12:30,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 163 flow [2024-06-28 02:12:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:12:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:12:30,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-28 02:12:30,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2024-06-28 02:12:30,793 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 76 transitions. [2024-06-28 02:12:30,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 163 flow [2024-06-28 02:12:30,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:30,797 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 98 flow [2024-06-28 02:12:30,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=41, PETRI_TRANSITIONS=36} [2024-06-28 02:12:30,802 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-28 02:12:30,802 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 98 flow [2024-06-28 02:12:30,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:30,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:30,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:30,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:12:30,803 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:30,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:30,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522001, now seen corresponding path program 1 times [2024-06-28 02:12:30,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:30,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577526667] [2024-06-28 02:12:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:31,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:31,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577526667] [2024-06-28 02:12:31,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577526667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:31,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:31,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:12:31,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242560211] [2024-06-28 02:12:31,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:31,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:12:31,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:31,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:12:31,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:12:31,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-06-28 02:12:31,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 36 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:31,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:31,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-06-28 02:12:31,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:31,262 INFO L124 PetriNetUnfolderBase]: 376/663 cut-off events. [2024-06-28 02:12:31,262 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-06-28 02:12:31,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 663 events. 376/663 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3217 event pairs, 82 based on Foata normal form. 4/632 useless extension candidates. Maximal degree in co-relation 1474. Up to 593 conditions per place. [2024-06-28 02:12:31,265 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 38 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-28 02:12:31,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 236 flow [2024-06-28 02:12:31,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:12:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:12:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-06-28 02:12:31,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-28 02:12:31,267 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 98 flow. Second operand 4 states and 99 transitions. [2024-06-28 02:12:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 236 flow [2024-06-28 02:12:31,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:12:31,269 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 132 flow [2024-06-28 02:12:31,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-06-28 02:12:31,269 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-06-28 02:12:31,270 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 132 flow [2024-06-28 02:12:31,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:31,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:31,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:31,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:12:31,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:31,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash -247451359, now seen corresponding path program 1 times [2024-06-28 02:12:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:31,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379216888] [2024-06-28 02:12:31,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:31,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379216888] [2024-06-28 02:12:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379216888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:12:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054249168] [2024-06-28 02:12:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:31,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:12:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:31,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:12:31,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:12:31,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 36 [2024-06-28 02:12:31,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:31,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:31,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 36 [2024-06-28 02:12:31,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:31,372 INFO L124 PetriNetUnfolderBase]: 130/311 cut-off events. [2024-06-28 02:12:31,372 INFO L125 PetriNetUnfolderBase]: For 113/120 co-relation queries the response was YES. [2024-06-28 02:12:31,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 311 events. 130/311 cut-off events. For 113/120 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1608 event pairs, 31 based on Foata normal form. 7/308 useless extension candidates. Maximal degree in co-relation 647. Up to 182 conditions per place. [2024-06-28 02:12:31,374 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 19 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2024-06-28 02:12:31,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow [2024-06-28 02:12:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:12:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:12:31,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-28 02:12:31,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-06-28 02:12:31,375 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 132 flow. Second operand 3 states and 80 transitions. [2024-06-28 02:12:31,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow [2024-06-28 02:12:31,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:31,377 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 112 flow [2024-06-28 02:12:31,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-06-28 02:12:31,378 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-06-28 02:12:31,378 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 112 flow [2024-06-28 02:12:31,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:31,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:31,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:31,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:12:31,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:31,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1577556782, now seen corresponding path program 1 times [2024-06-28 02:12:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163016664] [2024-06-28 02:12:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:31,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:31,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163016664] [2024-06-28 02:12:31,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163016664] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:31,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:31,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:12:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575591545] [2024-06-28 02:12:31,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:31,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:12:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:31,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:12:31,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:12:31,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:31,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:31,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:31,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:31,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:31,987 INFO L124 PetriNetUnfolderBase]: 373/768 cut-off events. [2024-06-28 02:12:31,988 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2024-06-28 02:12:31,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 768 events. 373/768 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4090 event pairs, 207 based on Foata normal form. 1/738 useless extension candidates. Maximal degree in co-relation 1661. Up to 613 conditions per place. [2024-06-28 02:12:31,992 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 35 selfloop transitions, 7 changer transitions 2/53 dead transitions. [2024-06-28 02:12:31,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 246 flow [2024-06-28 02:12:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:12:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:12:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-28 02:12:31,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-28 02:12:31,994 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 112 flow. Second operand 5 states and 96 transitions. [2024-06-28 02:12:31,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 246 flow [2024-06-28 02:12:31,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:31,995 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 153 flow [2024-06-28 02:12:31,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2024-06-28 02:12:31,996 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-06-28 02:12:31,997 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 153 flow [2024-06-28 02:12:31,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:31,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:31,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:31,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:12:31,998 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:31,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:31,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1266792403, now seen corresponding path program 1 times [2024-06-28 02:12:31,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:31,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564328244] [2024-06-28 02:12:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:31,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:32,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564328244] [2024-06-28 02:12:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564328244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:32,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:32,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:12:32,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257706647] [2024-06-28 02:12:32,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:32,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:12:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:32,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:12:32,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:12:32,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-06-28 02:12:32,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:32,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:32,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-06-28 02:12:32,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:32,780 INFO L124 PetriNetUnfolderBase]: 269/568 cut-off events. [2024-06-28 02:12:32,781 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2024-06-28 02:12:32,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 568 events. 269/568 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2909 event pairs, 43 based on Foata normal form. 4/544 useless extension candidates. Maximal degree in co-relation 1351. Up to 393 conditions per place. [2024-06-28 02:12:32,784 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 45 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-28 02:12:32,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 325 flow [2024-06-28 02:12:32,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:12:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:12:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-28 02:12:32,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064814814814815 [2024-06-28 02:12:32,786 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 153 flow. Second operand 6 states and 131 transitions. [2024-06-28 02:12:32,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 325 flow [2024-06-28 02:12:32,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 316 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:32,789 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 174 flow [2024-06-28 02:12:32,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2024-06-28 02:12:32,789 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-06-28 02:12:32,790 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 174 flow [2024-06-28 02:12:32,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:32,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:32,790 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:32,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:12:32,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:32,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:32,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1659618608, now seen corresponding path program 1 times [2024-06-28 02:12:32,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:32,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363499803] [2024-06-28 02:12:32,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:33,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:33,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363499803] [2024-06-28 02:12:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363499803] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:33,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:12:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896489553] [2024-06-28 02:12:33,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:33,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:12:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:33,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:12:33,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:12:33,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:33,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:33,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:33,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:33,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:33,398 INFO L124 PetriNetUnfolderBase]: 375/779 cut-off events. [2024-06-28 02:12:33,399 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES. [2024-06-28 02:12:33,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1955 conditions, 779 events. 375/779 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4288 event pairs, 103 based on Foata normal form. 3/748 useless extension candidates. Maximal degree in co-relation 1935. Up to 505 conditions per place. [2024-06-28 02:12:33,402 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 46 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2024-06-28 02:12:33,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 388 flow [2024-06-28 02:12:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:12:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:12:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-28 02:12:33,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-28 02:12:33,404 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 174 flow. Second operand 6 states and 118 transitions. [2024-06-28 02:12:33,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 388 flow [2024-06-28 02:12:33,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 366 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 02:12:33,406 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 252 flow [2024-06-28 02:12:33,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-06-28 02:12:33,407 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-06-28 02:12:33,407 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 252 flow [2024-06-28 02:12:33,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:33,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:33,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:33,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:12:33,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:33,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1423219663, now seen corresponding path program 1 times [2024-06-28 02:12:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:33,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439540347] [2024-06-28 02:12:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:33,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439540347] [2024-06-28 02:12:33,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439540347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:33,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:12:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188158670] [2024-06-28 02:12:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:12:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:12:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:12:33,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:33,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:33,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:33,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:33,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:34,023 INFO L124 PetriNetUnfolderBase]: 406/826 cut-off events. [2024-06-28 02:12:34,023 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2024-06-28 02:12:34,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 826 events. 406/826 cut-off events. For 1226/1226 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4615 event pairs, 125 based on Foata normal form. 2/800 useless extension candidates. Maximal degree in co-relation 2439. Up to 634 conditions per place. [2024-06-28 02:12:34,028 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 53 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2024-06-28 02:12:34,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 483 flow [2024-06-28 02:12:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-28 02:12:34,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-28 02:12:34,030 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 252 flow. Second operand 7 states and 132 transitions. [2024-06-28 02:12:34,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 483 flow [2024-06-28 02:12:34,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 475 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-28 02:12:34,033 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 336 flow [2024-06-28 02:12:34,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=336, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2024-06-28 02:12:34,034 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-06-28 02:12:34,034 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 336 flow [2024-06-28 02:12:34,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:34,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:34,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:34,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:12:34,035 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:34,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 818068075, now seen corresponding path program 2 times [2024-06-28 02:12:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951472460] [2024-06-28 02:12:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:34,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:34,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:34,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:34,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951472460] [2024-06-28 02:12:34,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951472460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:34,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:34,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:12:34,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307521273] [2024-06-28 02:12:34,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:34,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:12:34,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:34,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:12:34,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:12:34,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:34,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 336 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:34,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:34,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:34,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:34,649 INFO L124 PetriNetUnfolderBase]: 428/872 cut-off events. [2024-06-28 02:12:34,649 INFO L125 PetriNetUnfolderBase]: For 1813/1813 co-relation queries the response was YES. [2024-06-28 02:12:34,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 872 events. 428/872 cut-off events. For 1813/1813 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4945 event pairs, 118 based on Foata normal form. 2/844 useless extension candidates. Maximal degree in co-relation 2763. Up to 648 conditions per place. [2024-06-28 02:12:34,654 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 52 selfloop transitions, 15 changer transitions 0/76 dead transitions. [2024-06-28 02:12:34,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 541 flow [2024-06-28 02:12:34,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:12:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:12:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-28 02:12:34,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-28 02:12:34,655 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 336 flow. Second operand 6 states and 114 transitions. [2024-06-28 02:12:34,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 541 flow [2024-06-28 02:12:34,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 508 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:34,659 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 364 flow [2024-06-28 02:12:34,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-06-28 02:12:34,659 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-06-28 02:12:34,660 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 364 flow [2024-06-28 02:12:34,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:34,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:34,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:34,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:12:34,660 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:34,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash -213339737, now seen corresponding path program 3 times [2024-06-28 02:12:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:34,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487905971] [2024-06-28 02:12:34,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:34,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:35,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:35,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487905971] [2024-06-28 02:12:35,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487905971] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:35,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:12:35,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900325653] [2024-06-28 02:12:35,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:35,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:12:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:12:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:12:35,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:35,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:35,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:35,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:35,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:35,275 INFO L124 PetriNetUnfolderBase]: 418/876 cut-off events. [2024-06-28 02:12:35,275 INFO L125 PetriNetUnfolderBase]: For 2104/2104 co-relation queries the response was YES. [2024-06-28 02:12:35,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 876 events. 418/876 cut-off events. For 2104/2104 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4932 event pairs, 113 based on Foata normal form. 4/843 useless extension candidates. Maximal degree in co-relation 2788. Up to 516 conditions per place. [2024-06-28 02:12:35,280 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 49 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2024-06-28 02:12:35,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 558 flow [2024-06-28 02:12:35,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:12:35,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:12:35,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-28 02:12:35,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-28 02:12:35,284 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 364 flow. Second operand 6 states and 117 transitions. [2024-06-28 02:12:35,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 558 flow [2024-06-28 02:12:35,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 522 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:35,289 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 373 flow [2024-06-28 02:12:35,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-06-28 02:12:35,290 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2024-06-28 02:12:35,290 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 373 flow [2024-06-28 02:12:35,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:35,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:35,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:35,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:12:35,291 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:35,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:35,291 INFO L85 PathProgramCache]: Analyzing trace with hash -213329817, now seen corresponding path program 1 times [2024-06-28 02:12:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:35,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286610104] [2024-06-28 02:12:35,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286610104] [2024-06-28 02:12:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286610104] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:35,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:12:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355759368] [2024-06-28 02:12:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:35,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:12:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:35,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:12:35,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:12:35,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:35,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 373 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:35,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:35,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:35,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:36,121 INFO L124 PetriNetUnfolderBase]: 441/911 cut-off events. [2024-06-28 02:12:36,122 INFO L125 PetriNetUnfolderBase]: For 2007/2007 co-relation queries the response was YES. [2024-06-28 02:12:36,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2939 conditions, 911 events. 441/911 cut-off events. For 2007/2007 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5134 event pairs, 105 based on Foata normal form. 3/877 useless extension candidates. Maximal degree in co-relation 2910. Up to 519 conditions per place. [2024-06-28 02:12:36,127 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 52 selfloop transitions, 25 changer transitions 0/86 dead transitions. [2024-06-28 02:12:36,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 621 flow [2024-06-28 02:12:36,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-28 02:12:36,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5436507936507936 [2024-06-28 02:12:36,128 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 373 flow. Second operand 7 states and 137 transitions. [2024-06-28 02:12:36,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 621 flow [2024-06-28 02:12:36,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 86 transitions, 570 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:36,133 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 407 flow [2024-06-28 02:12:36,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=407, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-06-28 02:12:36,134 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-06-28 02:12:36,134 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 407 flow [2024-06-28 02:12:36,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:36,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:36,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:36,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:12:36,135 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:36,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:36,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1976711705, now seen corresponding path program 1 times [2024-06-28 02:12:36,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:36,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582167405] [2024-06-28 02:12:36,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582167405] [2024-06-28 02:12:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582167405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090724088] [2024-06-28 02:12:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:36,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:36,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:36,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:36,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:36,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 407 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:36,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:36,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:36,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:37,134 INFO L124 PetriNetUnfolderBase]: 526/1054 cut-off events. [2024-06-28 02:12:37,134 INFO L125 PetriNetUnfolderBase]: For 2630/2630 co-relation queries the response was YES. [2024-06-28 02:12:37,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3568 conditions, 1054 events. 526/1054 cut-off events. For 2630/2630 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6114 event pairs, 119 based on Foata normal form. 14/1035 useless extension candidates. Maximal degree in co-relation 3538. Up to 488 conditions per place. [2024-06-28 02:12:37,139 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 62 selfloop transitions, 27 changer transitions 0/98 dead transitions. [2024-06-28 02:12:37,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 98 transitions, 715 flow [2024-06-28 02:12:37,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-28 02:12:37,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-28 02:12:37,143 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 407 flow. Second operand 8 states and 160 transitions. [2024-06-28 02:12:37,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 98 transitions, 715 flow [2024-06-28 02:12:37,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 98 transitions, 658 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:37,148 INFO L231 Difference]: Finished difference. Result has 71 places, 65 transitions, 431 flow [2024-06-28 02:12:37,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=431, PETRI_PLACES=71, PETRI_TRANSITIONS=65} [2024-06-28 02:12:37,149 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2024-06-28 02:12:37,149 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 65 transitions, 431 flow [2024-06-28 02:12:37,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:37,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:37,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:37,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:12:37,149 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:37,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -616365514, now seen corresponding path program 1 times [2024-06-28 02:12:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:37,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635696940] [2024-06-28 02:12:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:37,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:37,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635696940] [2024-06-28 02:12:37,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635696940] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:37,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:37,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:12:37,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762940357] [2024-06-28 02:12:37,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:37,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:12:37,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:12:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:12:37,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:37,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 65 transitions, 431 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:37,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:37,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:37,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:37,926 INFO L124 PetriNetUnfolderBase]: 527/1073 cut-off events. [2024-06-28 02:12:37,927 INFO L125 PetriNetUnfolderBase]: For 2684/2684 co-relation queries the response was YES. [2024-06-28 02:12:37,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3699 conditions, 1073 events. 527/1073 cut-off events. For 2684/2684 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6382 event pairs, 157 based on Foata normal form. 1/1041 useless extension candidates. Maximal degree in co-relation 3668. Up to 842 conditions per place. [2024-06-28 02:12:37,932 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 67 selfloop transitions, 16 changer transitions 0/92 dead transitions. [2024-06-28 02:12:37,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 92 transitions, 693 flow [2024-06-28 02:12:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 02:12:37,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-28 02:12:37,973 INFO L175 Difference]: Start difference. First operand has 71 places, 65 transitions, 431 flow. Second operand 7 states and 133 transitions. [2024-06-28 02:12:37,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 92 transitions, 693 flow [2024-06-28 02:12:37,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 92 transitions, 636 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:37,979 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 456 flow [2024-06-28 02:12:37,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=456, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-06-28 02:12:37,981 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-06-28 02:12:37,981 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 456 flow [2024-06-28 02:12:37,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:37,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:37,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:37,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:12:37,982 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:37,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:37,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1966948880, now seen corresponding path program 1 times [2024-06-28 02:12:37,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:37,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885157972] [2024-06-28 02:12:37,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:37,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885157972] [2024-06-28 02:12:38,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885157972] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:38,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:38,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:12:38,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499074782] [2024-06-28 02:12:38,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:38,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:12:38,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:38,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:12:38,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:12:38,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:38,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 456 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:38,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:38,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:38,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:38,855 INFO L124 PetriNetUnfolderBase]: 538/1080 cut-off events. [2024-06-28 02:12:38,855 INFO L125 PetriNetUnfolderBase]: For 2884/2884 co-relation queries the response was YES. [2024-06-28 02:12:38,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3754 conditions, 1080 events. 538/1080 cut-off events. For 2884/2884 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6298 event pairs, 107 based on Foata normal form. 1/1051 useless extension candidates. Maximal degree in co-relation 3721. Up to 728 conditions per place. [2024-06-28 02:12:38,860 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 77 selfloop transitions, 22 changer transitions 0/108 dead transitions. [2024-06-28 02:12:38,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 108 transitions, 862 flow [2024-06-28 02:12:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-28 02:12:38,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-28 02:12:38,862 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 456 flow. Second operand 7 states and 135 transitions. [2024-06-28 02:12:38,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 108 transitions, 862 flow [2024-06-28 02:12:38,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 108 transitions, 824 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:38,868 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 567 flow [2024-06-28 02:12:38,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2024-06-28 02:12:38,869 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-06-28 02:12:38,869 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 567 flow [2024-06-28 02:12:38,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:38,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:38,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:38,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:12:38,870 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:38,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1148183848, now seen corresponding path program 2 times [2024-06-28 02:12:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:38,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532243673] [2024-06-28 02:12:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:38,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:39,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:39,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532243673] [2024-06-28 02:12:39,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532243673] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:39,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:39,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:12:39,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616237135] [2024-06-28 02:12:39,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:39,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:12:39,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:39,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:12:39,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:12:39,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:39,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 567 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:39,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:39,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:39,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:39,786 INFO L124 PetriNetUnfolderBase]: 550/1134 cut-off events. [2024-06-28 02:12:39,786 INFO L125 PetriNetUnfolderBase]: For 3556/3556 co-relation queries the response was YES. [2024-06-28 02:12:39,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4166 conditions, 1134 events. 550/1134 cut-off events. For 3556/3556 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6841 event pairs, 144 based on Foata normal form. 2/1095 useless extension candidates. Maximal degree in co-relation 4130. Up to 727 conditions per place. [2024-06-28 02:12:39,795 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 73 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2024-06-28 02:12:39,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 107 transitions, 891 flow [2024-06-28 02:12:39,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:39,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-28 02:12:39,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 02:12:39,796 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 567 flow. Second operand 7 states and 136 transitions. [2024-06-28 02:12:39,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 107 transitions, 891 flow [2024-06-28 02:12:39,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 849 flow, removed 16 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:39,804 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 629 flow [2024-06-28 02:12:39,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=629, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2024-06-28 02:12:39,805 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2024-06-28 02:12:39,806 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 629 flow [2024-06-28 02:12:39,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:39,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:39,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:39,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:12:39,806 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:39,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1155981480, now seen corresponding path program 1 times [2024-06-28 02:12:39,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:39,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112137143] [2024-06-28 02:12:39,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:39,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:40,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:40,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112137143] [2024-06-28 02:12:40,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112137143] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:40,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:40,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:12:40,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365531033] [2024-06-28 02:12:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:40,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:12:40,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:40,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:12:40,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:12:40,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:40,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 629 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:40,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:40,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:40,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:40,635 INFO L124 PetriNetUnfolderBase]: 551/1097 cut-off events. [2024-06-28 02:12:40,635 INFO L125 PetriNetUnfolderBase]: For 3886/3886 co-relation queries the response was YES. [2024-06-28 02:12:40,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4264 conditions, 1097 events. 551/1097 cut-off events. For 3886/3886 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6549 event pairs, 128 based on Foata normal form. 1/1060 useless extension candidates. Maximal degree in co-relation 4226. Up to 713 conditions per place. [2024-06-28 02:12:40,641 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 67 selfloop transitions, 28 changer transitions 0/104 dead transitions. [2024-06-28 02:12:40,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 104 transitions, 909 flow [2024-06-28 02:12:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:12:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:12:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-28 02:12:40,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-28 02:12:40,644 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 629 flow. Second operand 6 states and 118 transitions. [2024-06-28 02:12:40,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 104 transitions, 909 flow [2024-06-28 02:12:40,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 104 transitions, 851 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:40,655 INFO L231 Difference]: Finished difference. Result has 84 places, 86 transitions, 662 flow [2024-06-28 02:12:40,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=662, PETRI_PLACES=84, PETRI_TRANSITIONS=86} [2024-06-28 02:12:40,656 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 44 predicate places. [2024-06-28 02:12:40,656 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 86 transitions, 662 flow [2024-06-28 02:12:40,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:40,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:40,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:40,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:12:40,657 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:40,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash 835755246, now seen corresponding path program 1 times [2024-06-28 02:12:40,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898801199] [2024-06-28 02:12:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898801199] [2024-06-28 02:12:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898801199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932027688] [2024-06-28 02:12:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:41,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:41,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:41,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 86 transitions, 662 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:41,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:41,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:41,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:41,598 INFO L124 PetriNetUnfolderBase]: 651/1300 cut-off events. [2024-06-28 02:12:41,599 INFO L125 PetriNetUnfolderBase]: For 5995/5995 co-relation queries the response was YES. [2024-06-28 02:12:41,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5040 conditions, 1300 events. 651/1300 cut-off events. For 5995/5995 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8087 event pairs, 156 based on Foata normal form. 14/1279 useless extension candidates. Maximal degree in co-relation 5001. Up to 723 conditions per place. [2024-06-28 02:12:41,606 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 85 selfloop transitions, 27 changer transitions 0/121 dead transitions. [2024-06-28 02:12:41,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 121 transitions, 1044 flow [2024-06-28 02:12:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:41,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2024-06-28 02:12:41,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2024-06-28 02:12:41,608 INFO L175 Difference]: Start difference. First operand has 84 places, 86 transitions, 662 flow. Second operand 8 states and 159 transitions. [2024-06-28 02:12:41,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 121 transitions, 1044 flow [2024-06-28 02:12:41,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 121 transitions, 993 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:41,617 INFO L231 Difference]: Finished difference. Result has 88 places, 88 transitions, 693 flow [2024-06-28 02:12:41,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=693, PETRI_PLACES=88, PETRI_TRANSITIONS=88} [2024-06-28 02:12:41,618 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2024-06-28 02:12:41,618 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 88 transitions, 693 flow [2024-06-28 02:12:41,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:41,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:41,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:41,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:12:41,619 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:41,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash 846230766, now seen corresponding path program 2 times [2024-06-28 02:12:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262393870] [2024-06-28 02:12:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:41,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:42,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:42,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:42,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262393870] [2024-06-28 02:12:42,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262393870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:42,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:42,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:42,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802414372] [2024-06-28 02:12:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:42,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:42,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:42,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:42,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:42,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 88 transitions, 693 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:42,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:42,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:42,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:42,599 INFO L124 PetriNetUnfolderBase]: 755/1501 cut-off events. [2024-06-28 02:12:42,599 INFO L125 PetriNetUnfolderBase]: For 6688/6688 co-relation queries the response was YES. [2024-06-28 02:12:42,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5937 conditions, 1501 events. 755/1501 cut-off events. For 6688/6688 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 9589 event pairs, 184 based on Foata normal form. 2/1468 useless extension candidates. Maximal degree in co-relation 5897. Up to 580 conditions per place. [2024-06-28 02:12:42,614 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 85 selfloop transitions, 33 changer transitions 0/127 dead transitions. [2024-06-28 02:12:42,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 1134 flow [2024-06-28 02:12:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:42,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 160 transitions. [2024-06-28 02:12:42,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-28 02:12:42,616 INFO L175 Difference]: Start difference. First operand has 88 places, 88 transitions, 693 flow. Second operand 8 states and 160 transitions. [2024-06-28 02:12:42,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 1134 flow [2024-06-28 02:12:42,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 1080 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:42,629 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 759 flow [2024-06-28 02:12:42,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=759, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-06-28 02:12:42,630 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2024-06-28 02:12:42,630 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 759 flow [2024-06-28 02:12:42,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:42,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:42,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:42,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 02:12:42,630 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:42,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:42,631 INFO L85 PathProgramCache]: Analyzing trace with hash 845874576, now seen corresponding path program 3 times [2024-06-28 02:12:42,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:42,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934988458] [2024-06-28 02:12:42,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:42,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934988458] [2024-06-28 02:12:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934988458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:43,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:43,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916920003] [2024-06-28 02:12:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:43,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:43,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:43,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:43,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:43,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 759 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:43,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:43,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:43,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:43,684 INFO L124 PetriNetUnfolderBase]: 752/1528 cut-off events. [2024-06-28 02:12:43,684 INFO L125 PetriNetUnfolderBase]: For 7095/7095 co-relation queries the response was YES. [2024-06-28 02:12:43,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6082 conditions, 1528 events. 752/1528 cut-off events. For 7095/7095 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9851 event pairs, 201 based on Foata normal form. 2/1485 useless extension candidates. Maximal degree in co-relation 6040. Up to 844 conditions per place. [2024-06-28 02:12:43,692 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 86 selfloop transitions, 35 changer transitions 0/130 dead transitions. [2024-06-28 02:12:43,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 130 transitions, 1161 flow [2024-06-28 02:12:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-28 02:12:43,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5524691358024691 [2024-06-28 02:12:43,694 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 759 flow. Second operand 9 states and 179 transitions. [2024-06-28 02:12:43,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 130 transitions, 1161 flow [2024-06-28 02:12:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 130 transitions, 1131 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:12:43,709 INFO L231 Difference]: Finished difference. Result has 97 places, 92 transitions, 809 flow [2024-06-28 02:12:43,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=729, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=809, PETRI_PLACES=97, PETRI_TRANSITIONS=92} [2024-06-28 02:12:43,710 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-06-28 02:12:43,710 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 92 transitions, 809 flow [2024-06-28 02:12:43,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:43,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:43,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:43,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 02:12:43,711 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:43,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:43,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1966620970, now seen corresponding path program 1 times [2024-06-28 02:12:43,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:43,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188203412] [2024-06-28 02:12:43,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:43,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:43,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:43,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188203412] [2024-06-28 02:12:43,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188203412] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:43,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:43,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:12:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933939499] [2024-06-28 02:12:43,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:12:43,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:12:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:12:43,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-28 02:12:43,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 92 transitions, 809 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:43,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:43,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-28 02:12:43,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:44,160 INFO L124 PetriNetUnfolderBase]: 1269/2636 cut-off events. [2024-06-28 02:12:44,161 INFO L125 PetriNetUnfolderBase]: For 10934/10992 co-relation queries the response was YES. [2024-06-28 02:12:44,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10147 conditions, 2636 events. 1269/2636 cut-off events. For 10934/10992 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 20052 event pairs, 279 based on Foata normal form. 36/2545 useless extension candidates. Maximal degree in co-relation 10104. Up to 804 conditions per place. [2024-06-28 02:12:44,174 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 81 selfloop transitions, 32 changer transitions 101/243 dead transitions. [2024-06-28 02:12:44,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 243 transitions, 2542 flow [2024-06-28 02:12:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 203 transitions. [2024-06-28 02:12:44,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6265432098765432 [2024-06-28 02:12:44,177 INFO L175 Difference]: Start difference. First operand has 97 places, 92 transitions, 809 flow. Second operand 9 states and 203 transitions. [2024-06-28 02:12:44,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 243 transitions, 2542 flow [2024-06-28 02:12:44,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 243 transitions, 2353 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-28 02:12:44,200 INFO L231 Difference]: Finished difference. Result has 103 places, 108 transitions, 983 flow [2024-06-28 02:12:44,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=983, PETRI_PLACES=103, PETRI_TRANSITIONS=108} [2024-06-28 02:12:44,201 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2024-06-28 02:12:44,201 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 108 transitions, 983 flow [2024-06-28 02:12:44,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:44,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:44,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:44,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 02:12:44,202 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:44,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash -113792987, now seen corresponding path program 1 times [2024-06-28 02:12:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:44,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216263797] [2024-06-28 02:12:44,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:44,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:44,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:44,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:44,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216263797] [2024-06-28 02:12:44,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216263797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:44,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:44,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056594026] [2024-06-28 02:12:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:44,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:44,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:44,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:44,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:44,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 108 transitions, 983 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:44,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:44,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:44,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:45,248 INFO L124 PetriNetUnfolderBase]: 1071/2218 cut-off events. [2024-06-28 02:12:45,248 INFO L125 PetriNetUnfolderBase]: For 13148/13193 co-relation queries the response was YES. [2024-06-28 02:12:45,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9717 conditions, 2218 events. 1071/2218 cut-off events. For 13148/13193 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15816 event pairs, 370 based on Foata normal form. 41/2243 useless extension candidates. Maximal degree in co-relation 9668. Up to 1779 conditions per place. [2024-06-28 02:12:45,260 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 108 selfloop transitions, 18 changer transitions 2/139 dead transitions. [2024-06-28 02:12:45,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 139 transitions, 1359 flow [2024-06-28 02:12:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-28 02:12:45,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-28 02:12:45,262 INFO L175 Difference]: Start difference. First operand has 103 places, 108 transitions, 983 flow. Second operand 8 states and 150 transitions. [2024-06-28 02:12:45,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 139 transitions, 1359 flow [2024-06-28 02:12:45,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 139 transitions, 1349 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:45,289 INFO L231 Difference]: Finished difference. Result has 108 places, 110 transitions, 1055 flow [2024-06-28 02:12:45,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=977, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1055, PETRI_PLACES=108, PETRI_TRANSITIONS=110} [2024-06-28 02:12:45,290 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2024-06-28 02:12:45,290 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 110 transitions, 1055 flow [2024-06-28 02:12:45,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:45,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:45,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 02:12:45,290 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:45,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -110906267, now seen corresponding path program 2 times [2024-06-28 02:12:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:45,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255161967] [2024-06-28 02:12:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:45,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:45,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255161967] [2024-06-28 02:12:45,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255161967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:45,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:45,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:45,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839132964] [2024-06-28 02:12:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:45,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:45,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:45,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:45,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:45,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:45,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 110 transitions, 1055 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:45,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:45,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:45,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:46,365 INFO L124 PetriNetUnfolderBase]: 1016/2116 cut-off events. [2024-06-28 02:12:46,365 INFO L125 PetriNetUnfolderBase]: For 13657/13701 co-relation queries the response was YES. [2024-06-28 02:12:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9361 conditions, 2116 events. 1016/2116 cut-off events. For 13657/13701 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 14940 event pairs, 367 based on Foata normal form. 40/2141 useless extension candidates. Maximal degree in co-relation 9309. Up to 1693 conditions per place. [2024-06-28 02:12:46,377 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 110 selfloop transitions, 19 changer transitions 0/140 dead transitions. [2024-06-28 02:12:46,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 140 transitions, 1437 flow [2024-06-28 02:12:46,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-28 02:12:46,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243055555555556 [2024-06-28 02:12:46,379 INFO L175 Difference]: Start difference. First operand has 108 places, 110 transitions, 1055 flow. Second operand 8 states and 151 transitions. [2024-06-28 02:12:46,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 140 transitions, 1437 flow [2024-06-28 02:12:46,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 140 transitions, 1387 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:46,409 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 1080 flow [2024-06-28 02:12:46,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1080, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2024-06-28 02:12:46,409 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 70 predicate places. [2024-06-28 02:12:46,410 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 1080 flow [2024-06-28 02:12:46,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:46,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:46,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:46,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 02:12:46,410 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:46,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:46,411 INFO L85 PathProgramCache]: Analyzing trace with hash -110900315, now seen corresponding path program 1 times [2024-06-28 02:12:46,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:46,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633495181] [2024-06-28 02:12:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:46,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:46,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:46,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633495181] [2024-06-28 02:12:46,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633495181] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:46,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:46,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:46,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31214822] [2024-06-28 02:12:46,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:46,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:46,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:46,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:46,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:47,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:47,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 1080 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:47,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:47,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:47,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:47,417 INFO L124 PetriNetUnfolderBase]: 1024/2164 cut-off events. [2024-06-28 02:12:47,417 INFO L125 PetriNetUnfolderBase]: For 13924/13974 co-relation queries the response was YES. [2024-06-28 02:12:47,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 2164 events. 1024/2164 cut-off events. For 13924/13974 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15362 event pairs, 271 based on Foata normal form. 49/2190 useless extension candidates. Maximal degree in co-relation 9462. Up to 1562 conditions per place. [2024-06-28 02:12:47,429 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 89 selfloop transitions, 53 changer transitions 1/153 dead transitions. [2024-06-28 02:12:47,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 153 transitions, 1687 flow [2024-06-28 02:12:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-28 02:12:47,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-06-28 02:12:47,430 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 1080 flow. Second operand 8 states and 154 transitions. [2024-06-28 02:12:47,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 153 transitions, 1687 flow [2024-06-28 02:12:47,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 153 transitions, 1634 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:47,459 INFO L231 Difference]: Finished difference. Result has 115 places, 129 transitions, 1448 flow [2024-06-28 02:12:47,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1448, PETRI_PLACES=115, PETRI_TRANSITIONS=129} [2024-06-28 02:12:47,460 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2024-06-28 02:12:47,460 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 129 transitions, 1448 flow [2024-06-28 02:12:47,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:47,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:47,461 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 02:12:47,461 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:47,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:47,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1396006461, now seen corresponding path program 3 times [2024-06-28 02:12:47,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:47,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865807698] [2024-06-28 02:12:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:47,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:47,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:47,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865807698] [2024-06-28 02:12:47,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865807698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:47,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:47,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:47,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914512920] [2024-06-28 02:12:47,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:47,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:47,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:47,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:47,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:48,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:48,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 129 transitions, 1448 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:48,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:48,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:48,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:48,428 INFO L124 PetriNetUnfolderBase]: 1025/2116 cut-off events. [2024-06-28 02:12:48,428 INFO L125 PetriNetUnfolderBase]: For 16253/16259 co-relation queries the response was YES. [2024-06-28 02:12:48,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10043 conditions, 2116 events. 1025/2116 cut-off events. For 16253/16259 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 14832 event pairs, 346 based on Foata normal form. 4/2108 useless extension candidates. Maximal degree in co-relation 9986. Up to 1689 conditions per place. [2024-06-28 02:12:48,440 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 125 selfloop transitions, 24 changer transitions 0/159 dead transitions. [2024-06-28 02:12:48,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 159 transitions, 1902 flow [2024-06-28 02:12:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:48,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-28 02:12:48,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-06-28 02:12:48,442 INFO L175 Difference]: Start difference. First operand has 115 places, 129 transitions, 1448 flow. Second operand 8 states and 149 transitions. [2024-06-28 02:12:48,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 159 transitions, 1902 flow [2024-06-28 02:12:48,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 159 transitions, 1812 flow, removed 39 selfloop flow, removed 2 redundant places. [2024-06-28 02:12:48,481 INFO L231 Difference]: Finished difference. Result has 121 places, 132 transitions, 1481 flow [2024-06-28 02:12:48,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1360, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1481, PETRI_PLACES=121, PETRI_TRANSITIONS=132} [2024-06-28 02:12:48,482 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2024-06-28 02:12:48,482 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 132 transitions, 1481 flow [2024-06-28 02:12:48,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:48,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:48,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:48,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 02:12:48,483 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:48,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1161898729, now seen corresponding path program 2 times [2024-06-28 02:12:48,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:48,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054535044] [2024-06-28 02:12:48,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:49,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:49,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054535044] [2024-06-28 02:12:49,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054535044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:49,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:49,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:49,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909017647] [2024-06-28 02:12:49,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:49,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:49,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:49,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:49,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:49,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 132 transitions, 1481 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:49,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:49,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:49,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:49,704 INFO L124 PetriNetUnfolderBase]: 1034/2116 cut-off events. [2024-06-28 02:12:49,704 INFO L125 PetriNetUnfolderBase]: For 16573/16589 co-relation queries the response was YES. [2024-06-28 02:12:49,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10137 conditions, 2116 events. 1034/2116 cut-off events. For 16573/16589 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 14798 event pairs, 288 based on Foata normal form. 13/2113 useless extension candidates. Maximal degree in co-relation 10077. Up to 1538 conditions per place. [2024-06-28 02:12:49,717 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 116 selfloop transitions, 44 changer transitions 0/170 dead transitions. [2024-06-28 02:12:49,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 170 transitions, 2018 flow [2024-06-28 02:12:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-28 02:12:49,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339506172839507 [2024-06-28 02:12:49,718 INFO L175 Difference]: Start difference. First operand has 121 places, 132 transitions, 1481 flow. Second operand 9 states and 173 transitions. [2024-06-28 02:12:49,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 170 transitions, 2018 flow [2024-06-28 02:12:49,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 170 transitions, 1938 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:49,758 INFO L231 Difference]: Finished difference. Result has 126 places, 138 transitions, 1591 flow [2024-06-28 02:12:49,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1591, PETRI_PLACES=126, PETRI_TRANSITIONS=138} [2024-06-28 02:12:49,759 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 86 predicate places. [2024-06-28 02:12:49,759 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 138 transitions, 1591 flow [2024-06-28 02:12:49,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:49,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:49,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:49,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 02:12:49,760 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:49,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 138600401, now seen corresponding path program 3 times [2024-06-28 02:12:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144994330] [2024-06-28 02:12:49,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:50,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:50,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144994330] [2024-06-28 02:12:50,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144994330] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:50,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:50,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:50,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035862841] [2024-06-28 02:12:50,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:50,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:50,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:50,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:50,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:50,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:50,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 138 transitions, 1591 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:50,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:50,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:50,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:51,042 INFO L124 PetriNetUnfolderBase]: 1045/2151 cut-off events. [2024-06-28 02:12:51,043 INFO L125 PetriNetUnfolderBase]: For 18326/18338 co-relation queries the response was YES. [2024-06-28 02:12:51,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10537 conditions, 2151 events. 1045/2151 cut-off events. For 18326/18338 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 15194 event pairs, 294 based on Foata normal form. 9/2144 useless extension candidates. Maximal degree in co-relation 10475. Up to 1579 conditions per place. [2024-06-28 02:12:51,054 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 129 selfloop transitions, 33 changer transitions 0/172 dead transitions. [2024-06-28 02:12:51,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 172 transitions, 2093 flow [2024-06-28 02:12:51,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:51,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-28 02:12:51,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2024-06-28 02:12:51,055 INFO L175 Difference]: Start difference. First operand has 126 places, 138 transitions, 1591 flow. Second operand 9 states and 172 transitions. [2024-06-28 02:12:51,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 172 transitions, 2093 flow [2024-06-28 02:12:51,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 172 transitions, 1989 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:51,103 INFO L231 Difference]: Finished difference. Result has 130 places, 141 transitions, 1620 flow [2024-06-28 02:12:51,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1620, PETRI_PLACES=130, PETRI_TRANSITIONS=141} [2024-06-28 02:12:51,103 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 90 predicate places. [2024-06-28 02:12:51,103 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 141 transitions, 1620 flow [2024-06-28 02:12:51,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:51,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:51,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:51,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 02:12:51,104 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:51,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:51,104 INFO L85 PathProgramCache]: Analyzing trace with hash -88181723, now seen corresponding path program 4 times [2024-06-28 02:12:51,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:51,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519025607] [2024-06-28 02:12:51,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:51,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:51,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:51,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519025607] [2024-06-28 02:12:51,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519025607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:51,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:51,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988502434] [2024-06-28 02:12:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:51,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:51,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:51,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:51,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:51,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:51,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 141 transitions, 1620 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:51,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:51,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:51,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:52,154 INFO L124 PetriNetUnfolderBase]: 1051/2080 cut-off events. [2024-06-28 02:12:52,154 INFO L125 PetriNetUnfolderBase]: For 20052/20074 co-relation queries the response was YES. [2024-06-28 02:12:52,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10640 conditions, 2080 events. 1051/2080 cut-off events. For 20052/20074 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 14221 event pairs, 234 based on Foata normal form. 21/2083 useless extension candidates. Maximal degree in co-relation 10576. Up to 1380 conditions per place. [2024-06-28 02:12:52,166 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 110 selfloop transitions, 57 changer transitions 0/177 dead transitions. [2024-06-28 02:12:52,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 177 transitions, 2221 flow [2024-06-28 02:12:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-28 02:12:52,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2024-06-28 02:12:52,168 INFO L175 Difference]: Start difference. First operand has 130 places, 141 transitions, 1620 flow. Second operand 8 states and 155 transitions. [2024-06-28 02:12:52,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 177 transitions, 2221 flow [2024-06-28 02:12:52,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 177 transitions, 2122 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:52,218 INFO L231 Difference]: Finished difference. Result has 133 places, 147 transitions, 1773 flow [2024-06-28 02:12:52,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1773, PETRI_PLACES=133, PETRI_TRANSITIONS=147} [2024-06-28 02:12:52,218 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2024-06-28 02:12:52,219 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 147 transitions, 1773 flow [2024-06-28 02:12:52,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:52,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:52,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:52,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 02:12:52,219 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:52,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:52,220 INFO L85 PathProgramCache]: Analyzing trace with hash -616877603, now seen corresponding path program 1 times [2024-06-28 02:12:52,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:52,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437301570] [2024-06-28 02:12:52,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:52,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:52,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:52,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437301570] [2024-06-28 02:12:52,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437301570] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:52,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:52,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:52,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545025320] [2024-06-28 02:12:52,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:52,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:52,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:52,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:52,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:52,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:52,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 147 transitions, 1773 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:52,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:52,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:52,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:53,250 INFO L124 PetriNetUnfolderBase]: 1065/2157 cut-off events. [2024-06-28 02:12:53,251 INFO L125 PetriNetUnfolderBase]: For 21986/21992 co-relation queries the response was YES. [2024-06-28 02:12:53,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11198 conditions, 2157 events. 1065/2157 cut-off events. For 21986/21992 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15176 event pairs, 346 based on Foata normal form. 4/2143 useless extension candidates. Maximal degree in co-relation 11132. Up to 1718 conditions per place. [2024-06-28 02:12:53,265 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 141 selfloop transitions, 16 changer transitions 3/170 dead transitions. [2024-06-28 02:12:53,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 170 transitions, 2181 flow [2024-06-28 02:12:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:53,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-28 02:12:53,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-28 02:12:53,267 INFO L175 Difference]: Start difference. First operand has 133 places, 147 transitions, 1773 flow. Second operand 7 states and 130 transitions. [2024-06-28 02:12:53,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 170 transitions, 2181 flow [2024-06-28 02:12:53,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 170 transitions, 2109 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-28 02:12:53,329 INFO L231 Difference]: Finished difference. Result has 137 places, 148 transitions, 1752 flow [2024-06-28 02:12:53,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1703, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1752, PETRI_PLACES=137, PETRI_TRANSITIONS=148} [2024-06-28 02:12:53,330 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 97 predicate places. [2024-06-28 02:12:53,330 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 148 transitions, 1752 flow [2024-06-28 02:12:53,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:53,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:53,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:53,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 02:12:53,331 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:53,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:53,331 INFO L85 PathProgramCache]: Analyzing trace with hash -527211653, now seen corresponding path program 2 times [2024-06-28 02:12:53,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:53,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704910393] [2024-06-28 02:12:53,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:53,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:53,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704910393] [2024-06-28 02:12:53,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704910393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:53,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881983569] [2024-06-28 02:12:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:53,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:53,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:53,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:53,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:53,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 148 transitions, 1752 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:53,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:53,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:53,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:54,355 INFO L124 PetriNetUnfolderBase]: 1087/2211 cut-off events. [2024-06-28 02:12:54,356 INFO L125 PetriNetUnfolderBase]: For 21076/21090 co-relation queries the response was YES. [2024-06-28 02:12:54,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11313 conditions, 2211 events. 1087/2211 cut-off events. For 21076/21090 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15578 event pairs, 303 based on Foata normal form. 12/2204 useless extension candidates. Maximal degree in co-relation 11245. Up to 1583 conditions per place. [2024-06-28 02:12:54,368 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 119 selfloop transitions, 41 changer transitions 1/171 dead transitions. [2024-06-28 02:12:54,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 171 transitions, 2172 flow [2024-06-28 02:12:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-28 02:12:54,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-28 02:12:54,369 INFO L175 Difference]: Start difference. First operand has 137 places, 148 transitions, 1752 flow. Second operand 7 states and 136 transitions. [2024-06-28 02:12:54,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 171 transitions, 2172 flow [2024-06-28 02:12:54,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 171 transitions, 2135 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:54,426 INFO L231 Difference]: Finished difference. Result has 139 places, 148 transitions, 1810 flow [2024-06-28 02:12:54,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1715, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1810, PETRI_PLACES=139, PETRI_TRANSITIONS=148} [2024-06-28 02:12:54,427 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-06-28 02:12:54,427 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 148 transitions, 1810 flow [2024-06-28 02:12:54,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:54,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:54,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:54,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 02:12:54,428 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:54,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:54,428 INFO L85 PathProgramCache]: Analyzing trace with hash 330295955, now seen corresponding path program 3 times [2024-06-28 02:12:54,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:54,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233278191] [2024-06-28 02:12:54,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:54,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:55,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:55,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233278191] [2024-06-28 02:12:55,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233278191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:55,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:55,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:55,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530392188] [2024-06-28 02:12:55,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:55,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:55,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:55,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:55,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:55,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:55,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 148 transitions, 1810 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:55,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:55,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:55,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:55,573 INFO L124 PetriNetUnfolderBase]: 1084/2202 cut-off events. [2024-06-28 02:12:55,573 INFO L125 PetriNetUnfolderBase]: For 22436/22447 co-relation queries the response was YES. [2024-06-28 02:12:55,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11452 conditions, 2202 events. 1084/2202 cut-off events. For 22436/22447 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15496 event pairs, 276 based on Foata normal form. 11/2194 useless extension candidates. Maximal degree in co-relation 11383. Up to 1410 conditions per place. [2024-06-28 02:12:55,589 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 129 selfloop transitions, 31 changer transitions 3/173 dead transitions. [2024-06-28 02:12:55,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 173 transitions, 2252 flow [2024-06-28 02:12:55,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:12:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:12:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-28 02:12:55,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-28 02:12:55,591 INFO L175 Difference]: Start difference. First operand has 139 places, 148 transitions, 1810 flow. Second operand 7 states and 135 transitions. [2024-06-28 02:12:55,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 173 transitions, 2252 flow [2024-06-28 02:12:55,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 173 transitions, 2164 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:55,659 INFO L231 Difference]: Finished difference. Result has 141 places, 150 transitions, 1821 flow [2024-06-28 02:12:55,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1821, PETRI_PLACES=141, PETRI_TRANSITIONS=150} [2024-06-28 02:12:55,660 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2024-06-28 02:12:55,660 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 150 transitions, 1821 flow [2024-06-28 02:12:55,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:55,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:55,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:55,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 02:12:55,661 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:55,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash 330480529, now seen corresponding path program 1 times [2024-06-28 02:12:55,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:55,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772895171] [2024-06-28 02:12:55,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772895171] [2024-06-28 02:12:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772895171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:56,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:56,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3021945] [2024-06-28 02:12:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:56,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:56,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:56,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:56,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:56,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 150 transitions, 1821 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:56,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:56,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:56,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:56,930 INFO L124 PetriNetUnfolderBase]: 1122/2317 cut-off events. [2024-06-28 02:12:56,931 INFO L125 PetriNetUnfolderBase]: For 23543/23563 co-relation queries the response was YES. [2024-06-28 02:12:56,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11678 conditions, 2317 events. 1122/2317 cut-off events. For 23543/23563 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16630 event pairs, 269 based on Foata normal form. 26/2324 useless extension candidates. Maximal degree in co-relation 11608. Up to 1579 conditions per place. [2024-06-28 02:12:56,945 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 111 selfloop transitions, 61 changer transitions 0/182 dead transitions. [2024-06-28 02:12:56,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 2334 flow [2024-06-28 02:12:56,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 175 transitions. [2024-06-28 02:12:56,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401234567901234 [2024-06-28 02:12:56,949 INFO L175 Difference]: Start difference. First operand has 141 places, 150 transitions, 1821 flow. Second operand 9 states and 175 transitions. [2024-06-28 02:12:56,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 2334 flow [2024-06-28 02:12:57,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 182 transitions, 2281 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-28 02:12:57,019 INFO L231 Difference]: Finished difference. Result has 147 places, 151 transitions, 1921 flow [2024-06-28 02:12:57,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1921, PETRI_PLACES=147, PETRI_TRANSITIONS=151} [2024-06-28 02:12:57,028 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 107 predicate places. [2024-06-28 02:12:57,028 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 151 transitions, 1921 flow [2024-06-28 02:12:57,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:57,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:57,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:57,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 02:12:57,029 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:57,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:57,029 INFO L85 PathProgramCache]: Analyzing trace with hash 961392427, now seen corresponding path program 2 times [2024-06-28 02:12:57,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:57,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631338492] [2024-06-28 02:12:57,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:57,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:57,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631338492] [2024-06-28 02:12:57,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631338492] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:57,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:57,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:57,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403894917] [2024-06-28 02:12:57,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:57,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:57,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:57,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:57,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:57,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:57,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 151 transitions, 1921 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:57,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:57,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:57,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:58,517 INFO L124 PetriNetUnfolderBase]: 1218/2467 cut-off events. [2024-06-28 02:12:58,518 INFO L125 PetriNetUnfolderBase]: For 26816/26836 co-relation queries the response was YES. [2024-06-28 02:12:58,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12656 conditions, 2467 events. 1218/2467 cut-off events. For 26816/26836 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 17857 event pairs, 342 based on Foata normal form. 22/2469 useless extension candidates. Maximal degree in co-relation 12584. Up to 1333 conditions per place. [2024-06-28 02:12:58,535 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 138 selfloop transitions, 42 changer transitions 1/191 dead transitions. [2024-06-28 02:12:58,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 191 transitions, 2537 flow [2024-06-28 02:12:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:58,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-28 02:12:58,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-28 02:12:58,537 INFO L175 Difference]: Start difference. First operand has 147 places, 151 transitions, 1921 flow. Second operand 9 states and 180 transitions. [2024-06-28 02:12:58,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 191 transitions, 2537 flow [2024-06-28 02:12:58,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 191 transitions, 2411 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:58,617 INFO L231 Difference]: Finished difference. Result has 149 places, 150 transitions, 1863 flow [2024-06-28 02:12:58,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1863, PETRI_PLACES=149, PETRI_TRANSITIONS=150} [2024-06-28 02:12:58,617 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 109 predicate places. [2024-06-28 02:12:58,617 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 150 transitions, 1863 flow [2024-06-28 02:12:58,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:58,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:58,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:58,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 02:12:58,618 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:58,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash 961095757, now seen corresponding path program 3 times [2024-06-28 02:12:58,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:58,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406590528] [2024-06-28 02:12:58,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:58,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:59,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:59,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406590528] [2024-06-28 02:12:59,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406590528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:59,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:59,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:59,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674786511] [2024-06-28 02:12:59,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:59,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:59,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:59,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:59,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:59,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:12:59,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 150 transitions, 1863 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:59,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:59,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:12:59,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:59,913 INFO L124 PetriNetUnfolderBase]: 1241/2468 cut-off events. [2024-06-28 02:12:59,913 INFO L125 PetriNetUnfolderBase]: For 26628/26653 co-relation queries the response was YES. [2024-06-28 02:12:59,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12691 conditions, 2468 events. 1241/2468 cut-off events. For 26628/26653 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 17679 event pairs, 285 based on Foata normal form. 31/2475 useless extension candidates. Maximal degree in co-relation 12618. Up to 1683 conditions per place. [2024-06-28 02:12:59,930 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 109 selfloop transitions, 74 changer transitions 0/193 dead transitions. [2024-06-28 02:12:59,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 193 transitions, 2510 flow [2024-06-28 02:12:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:59,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-28 02:12:59,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-28 02:12:59,932 INFO L175 Difference]: Start difference. First operand has 149 places, 150 transitions, 1863 flow. Second operand 9 states and 177 transitions. [2024-06-28 02:12:59,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 193 transitions, 2510 flow [2024-06-28 02:13:00,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 193 transitions, 2425 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 02:13:00,015 INFO L231 Difference]: Finished difference. Result has 152 places, 157 transitions, 2086 flow [2024-06-28 02:13:00,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2086, PETRI_PLACES=152, PETRI_TRANSITIONS=157} [2024-06-28 02:13:00,016 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 112 predicate places. [2024-06-28 02:13:00,016 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 157 transitions, 2086 flow [2024-06-28 02:13:00,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:00,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:00,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:00,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 02:13:00,017 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:00,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash -83085077, now seen corresponding path program 1 times [2024-06-28 02:13:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:00,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089280741] [2024-06-28 02:13:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:00,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:00,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:00,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:00,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089280741] [2024-06-28 02:13:00,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089280741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:00,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:00,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:13:00,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602385758] [2024-06-28 02:13:00,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:00,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:13:00,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:00,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:13:00,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:13:00,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-06-28 02:13:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 157 transitions, 2086 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-06-28 02:13:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:00,316 INFO L124 PetriNetUnfolderBase]: 817/1953 cut-off events. [2024-06-28 02:13:00,316 INFO L125 PetriNetUnfolderBase]: For 15911/15965 co-relation queries the response was YES. [2024-06-28 02:13:00,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8600 conditions, 1953 events. 817/1953 cut-off events. For 15911/15965 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14918 event pairs, 154 based on Foata normal form. 157/2072 useless extension candidates. Maximal degree in co-relation 8539. Up to 820 conditions per place. [2024-06-28 02:13:00,329 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 60 selfloop transitions, 23 changer transitions 3/119 dead transitions. [2024-06-28 02:13:00,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 119 transitions, 1507 flow [2024-06-28 02:13:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:13:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:13:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-06-28 02:13:00,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-06-28 02:13:00,330 INFO L175 Difference]: Start difference. First operand has 152 places, 157 transitions, 2086 flow. Second operand 4 states and 100 transitions. [2024-06-28 02:13:00,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 119 transitions, 1507 flow [2024-06-28 02:13:00,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 119 transitions, 1158 flow, removed 16 selfloop flow, removed 33 redundant places. [2024-06-28 02:13:00,372 INFO L231 Difference]: Finished difference. Result has 123 places, 99 transitions, 935 flow [2024-06-28 02:13:00,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=935, PETRI_PLACES=123, PETRI_TRANSITIONS=99} [2024-06-28 02:13:00,373 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2024-06-28 02:13:00,373 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 99 transitions, 935 flow [2024-06-28 02:13:00,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:00,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:00,373 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:00,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 02:13:00,374 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:00,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:00,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1567989647, now seen corresponding path program 4 times [2024-06-28 02:13:00,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:00,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071651637] [2024-06-28 02:13:00,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:00,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:01,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:01,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071651637] [2024-06-28 02:13:01,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071651637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:01,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:01,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:13:01,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390830817] [2024-06-28 02:13:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:01,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:13:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:13:01,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:13:01,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:13:01,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 99 transitions, 935 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:01,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:01,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:13:01,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:01,561 INFO L124 PetriNetUnfolderBase]: 918/2111 cut-off events. [2024-06-28 02:13:01,561 INFO L125 PetriNetUnfolderBase]: For 18867/18867 co-relation queries the response was YES. [2024-06-28 02:13:01,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8640 conditions, 2111 events. 918/2111 cut-off events. For 18867/18867 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15546 event pairs, 410 based on Foata normal form. 6/2072 useless extension candidates. Maximal degree in co-relation 8594. Up to 1108 conditions per place. [2024-06-28 02:13:01,572 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 87 selfloop transitions, 30 changer transitions 5/133 dead transitions. [2024-06-28 02:13:01,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 133 transitions, 1376 flow [2024-06-28 02:13:01,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:13:01,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:13:01,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-28 02:13:01,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2024-06-28 02:13:01,574 INFO L175 Difference]: Start difference. First operand has 123 places, 99 transitions, 935 flow. Second operand 9 states and 169 transitions. [2024-06-28 02:13:01,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 133 transitions, 1376 flow [2024-06-28 02:13:01,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 133 transitions, 1322 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-28 02:13:01,615 INFO L231 Difference]: Finished difference. Result has 127 places, 94 transitions, 893 flow [2024-06-28 02:13:01,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=893, PETRI_PLACES=127, PETRI_TRANSITIONS=94} [2024-06-28 02:13:01,616 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 87 predicate places. [2024-06-28 02:13:01,616 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 94 transitions, 893 flow [2024-06-28 02:13:01,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:01,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:01,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:01,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 02:13:01,617 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:01,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1136684783, now seen corresponding path program 5 times [2024-06-28 02:13:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396663376] [2024-06-28 02:13:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:02,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:02,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396663376] [2024-06-28 02:13:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396663376] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:02,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:13:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261387481] [2024-06-28 02:13:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:02,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:13:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:02,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:13:02,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:13:02,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:13:02,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 94 transitions, 893 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:02,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:02,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:13:02,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:02,852 INFO L124 PetriNetUnfolderBase]: 875/2080 cut-off events. [2024-06-28 02:13:02,853 INFO L125 PetriNetUnfolderBase]: For 17223/17223 co-relation queries the response was YES. [2024-06-28 02:13:02,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8239 conditions, 2080 events. 875/2080 cut-off events. For 17223/17223 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15528 event pairs, 424 based on Foata normal form. 6/2042 useless extension candidates. Maximal degree in co-relation 8194. Up to 1075 conditions per place. [2024-06-28 02:13:02,864 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 79 selfloop transitions, 35 changer transitions 0/125 dead transitions. [2024-06-28 02:13:02,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 125 transitions, 1315 flow [2024-06-28 02:13:02,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 02:13:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 02:13:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-06-28 02:13:02,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-28 02:13:02,865 INFO L175 Difference]: Start difference. First operand has 127 places, 94 transitions, 893 flow. Second operand 10 states and 185 transitions. [2024-06-28 02:13:02,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 125 transitions, 1315 flow [2024-06-28 02:13:02,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 1240 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-28 02:13:02,900 INFO L231 Difference]: Finished difference. Result has 128 places, 94 transitions, 892 flow [2024-06-28 02:13:02,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=892, PETRI_PLACES=128, PETRI_TRANSITIONS=94} [2024-06-28 02:13:02,901 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2024-06-28 02:13:02,901 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 94 transitions, 892 flow [2024-06-28 02:13:02,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:02,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:02,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:02,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 02:13:02,901 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:02,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:02,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1646575, now seen corresponding path program 6 times [2024-06-28 02:13:02,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:02,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115862522] [2024-06-28 02:13:02,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:02,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:03,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:03,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115862522] [2024-06-28 02:13:03,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115862522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:03,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:03,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:13:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893374979] [2024-06-28 02:13:03,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:03,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:13:03,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:03,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:13:03,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:13:03,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:13:03,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 94 transitions, 892 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:03,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:03,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:13:03,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:04,025 INFO L124 PetriNetUnfolderBase]: 866/2068 cut-off events. [2024-06-28 02:13:04,025 INFO L125 PetriNetUnfolderBase]: For 17561/17561 co-relation queries the response was YES. [2024-06-28 02:13:04,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8144 conditions, 2068 events. 866/2068 cut-off events. For 17561/17561 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15561 event pairs, 437 based on Foata normal form. 8/2027 useless extension candidates. Maximal degree in co-relation 8099. Up to 1406 conditions per place. [2024-06-28 02:13:04,035 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 79 selfloop transitions, 26 changer transitions 0/116 dead transitions. [2024-06-28 02:13:04,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 116 transitions, 1198 flow [2024-06-28 02:13:04,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:13:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:13:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-28 02:13:04,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-06-28 02:13:04,037 INFO L175 Difference]: Start difference. First operand has 128 places, 94 transitions, 892 flow. Second operand 9 states and 161 transitions. [2024-06-28 02:13:04,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 116 transitions, 1198 flow [2024-06-28 02:13:04,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 116 transitions, 1130 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-28 02:13:04,073 INFO L231 Difference]: Finished difference. Result has 129 places, 94 transitions, 880 flow [2024-06-28 02:13:04,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=880, PETRI_PLACES=129, PETRI_TRANSITIONS=94} [2024-06-28 02:13:04,074 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-06-28 02:13:04,074 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 94 transitions, 880 flow [2024-06-28 02:13:04,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:04,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:04,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:04,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 02:13:04,075 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:04,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1136388113, now seen corresponding path program 7 times [2024-06-28 02:13:04,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:04,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414755129] [2024-06-28 02:13:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:04,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414755129] [2024-06-28 02:13:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414755129] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:04,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:13:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063321481] [2024-06-28 02:13:04,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:04,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:13:04,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:04,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:13:04,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:13:04,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:13:04,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 94 transitions, 880 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:04,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:04,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:13:04,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:05,237 INFO L124 PetriNetUnfolderBase]: 856/2050 cut-off events. [2024-06-28 02:13:05,237 INFO L125 PetriNetUnfolderBase]: For 14905/14905 co-relation queries the response was YES. [2024-06-28 02:13:05,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7817 conditions, 2050 events. 856/2050 cut-off events. For 14905/14905 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15445 event pairs, 429 based on Foata normal form. 8/2009 useless extension candidates. Maximal degree in co-relation 7771. Up to 1358 conditions per place. [2024-06-28 02:13:05,248 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 73 selfloop transitions, 32 changer transitions 0/116 dead transitions. [2024-06-28 02:13:05,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 116 transitions, 1186 flow [2024-06-28 02:13:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:13:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:13:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-28 02:13:05,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-06-28 02:13:05,250 INFO L175 Difference]: Start difference. First operand has 129 places, 94 transitions, 880 flow. Second operand 9 states and 160 transitions. [2024-06-28 02:13:05,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 116 transitions, 1186 flow [2024-06-28 02:13:05,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 116 transitions, 1134 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 02:13:05,281 INFO L231 Difference]: Finished difference. Result has 131 places, 94 transitions, 896 flow [2024-06-28 02:13:05,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=896, PETRI_PLACES=131, PETRI_TRANSITIONS=94} [2024-06-28 02:13:05,282 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 91 predicate places. [2024-06-28 02:13:05,282 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 94 transitions, 896 flow [2024-06-28 02:13:05,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:05,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:05,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:05,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 02:13:05,283 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:05,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:05,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1943335100, now seen corresponding path program 1 times [2024-06-28 02:13:05,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:05,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694083985] [2024-06-28 02:13:05,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:05,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:06,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:06,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694083985] [2024-06-28 02:13:06,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694083985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:06,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:06,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:13:06,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960839939] [2024-06-28 02:13:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:06,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:13:06,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:06,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:13:06,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:13:06,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:13:06,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 94 transitions, 896 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:06,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:06,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:13:06,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:06,563 INFO L124 PetriNetUnfolderBase]: 894/2114 cut-off events. [2024-06-28 02:13:06,563 INFO L125 PetriNetUnfolderBase]: For 14633/14633 co-relation queries the response was YES. [2024-06-28 02:13:06,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8114 conditions, 2114 events. 894/2114 cut-off events. For 14633/14633 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15933 event pairs, 384 based on Foata normal form. 6/2079 useless extension candidates. Maximal degree in co-relation 8067. Up to 1491 conditions per place. [2024-06-28 02:13:06,576 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 92 selfloop transitions, 12 changer transitions 8/123 dead transitions. [2024-06-28 02:13:06,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 123 transitions, 1226 flow [2024-06-28 02:13:06,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:13:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:13:06,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-28 02:13:06,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-28 02:13:06,577 INFO L175 Difference]: Start difference. First operand has 131 places, 94 transitions, 896 flow. Second operand 8 states and 147 transitions. [2024-06-28 02:13:06,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 123 transitions, 1226 flow [2024-06-28 02:13:06,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 123 transitions, 1164 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-28 02:13:06,609 INFO L231 Difference]: Finished difference. Result has 132 places, 94 transitions, 861 flow [2024-06-28 02:13:06,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=861, PETRI_PLACES=132, PETRI_TRANSITIONS=94} [2024-06-28 02:13:06,609 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-06-28 02:13:06,609 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 94 transitions, 861 flow [2024-06-28 02:13:06,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:06,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:06,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:06,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 02:13:06,610 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:06,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:06,610 INFO L85 PathProgramCache]: Analyzing trace with hash 836309350, now seen corresponding path program 2 times [2024-06-28 02:13:06,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:06,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306713814] [2024-06-28 02:13:06,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:06,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:07,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:07,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306713814] [2024-06-28 02:13:07,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306713814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:07,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:07,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:13:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847505139] [2024-06-28 02:13:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:07,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:13:07,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:13:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:13:07,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:13:07,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 94 transitions, 861 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:07,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:07,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:13:07,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:07,706 INFO L124 PetriNetUnfolderBase]: 924/2202 cut-off events. [2024-06-28 02:13:07,706 INFO L125 PetriNetUnfolderBase]: For 15077/15077 co-relation queries the response was YES. [2024-06-28 02:13:07,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8332 conditions, 2202 events. 924/2202 cut-off events. For 15077/15077 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16904 event pairs, 465 based on Foata normal form. 6/2158 useless extension candidates. Maximal degree in co-relation 8284. Up to 1602 conditions per place. [2024-06-28 02:13:07,717 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 72 selfloop transitions, 18 changer transitions 15/116 dead transitions. [2024-06-28 02:13:07,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 116 transitions, 1157 flow [2024-06-28 02:13:07,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:13:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:13:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 145 transitions. [2024-06-28 02:13:07,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034722222222222 [2024-06-28 02:13:07,719 INFO L175 Difference]: Start difference. First operand has 132 places, 94 transitions, 861 flow. Second operand 8 states and 145 transitions. [2024-06-28 02:13:07,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 116 transitions, 1157 flow [2024-06-28 02:13:07,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 116 transitions, 1134 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-28 02:13:07,754 INFO L231 Difference]: Finished difference. Result has 135 places, 92 transitions, 855 flow [2024-06-28 02:13:07,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=855, PETRI_PLACES=135, PETRI_TRANSITIONS=92} [2024-06-28 02:13:07,755 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 95 predicate places. [2024-06-28 02:13:07,755 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 92 transitions, 855 flow [2024-06-28 02:13:07,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:07,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:07,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:07,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 02:13:07,756 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:07,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 830802820, now seen corresponding path program 3 times [2024-06-28 02:13:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851626253] [2024-06-28 02:13:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:07,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:08,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:08,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851626253] [2024-06-28 02:13:08,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851626253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:08,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:08,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:13:08,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534536507] [2024-06-28 02:13:08,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:08,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:13:08,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:08,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:13:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:13:08,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-28 02:13:08,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 92 transitions, 855 flow. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:08,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:08,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-28 02:13:08,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:08,773 INFO L124 PetriNetUnfolderBase]: 876/2110 cut-off events. [2024-06-28 02:13:08,774 INFO L125 PetriNetUnfolderBase]: For 12408/12408 co-relation queries the response was YES. [2024-06-28 02:13:08,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7850 conditions, 2110 events. 876/2110 cut-off events. For 12408/12408 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16110 event pairs, 411 based on Foata normal form. 6/2072 useless extension candidates. Maximal degree in co-relation 7800. Up to 1312 conditions per place. [2024-06-28 02:13:08,785 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 76 selfloop transitions, 23 changer transitions 8/118 dead transitions. [2024-06-28 02:13:08,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 118 transitions, 1101 flow [2024-06-28 02:13:08,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:13:08,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:13:08,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-28 02:13:08,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-28 02:13:08,787 INFO L175 Difference]: Start difference. First operand has 135 places, 92 transitions, 855 flow. Second operand 8 states and 148 transitions. [2024-06-28 02:13:08,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 118 transitions, 1101 flow [2024-06-28 02:13:08,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 118 transitions, 946 flow, removed 14 selfloop flow, removed 30 redundant places. [2024-06-28 02:13:08,815 INFO L231 Difference]: Finished difference. Result has 109 places, 91 transitions, 686 flow [2024-06-28 02:13:08,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=686, PETRI_PLACES=109, PETRI_TRANSITIONS=91} [2024-06-28 02:13:08,816 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 69 predicate places. [2024-06-28 02:13:08,816 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 91 transitions, 686 flow [2024-06-28 02:13:08,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:08,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:08,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:08,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 02:13:08,817 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:08,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash 444772525, now seen corresponding path program 1 times [2024-06-28 02:13:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:08,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462691215] [2024-06-28 02:13:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:08,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:08,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462691215] [2024-06-28 02:13:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462691215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:08,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:13:08,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961018097] [2024-06-28 02:13:08,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:08,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:13:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:08,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:13:08,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:13:08,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-06-28 02:13:08,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 91 transitions, 686 flow. Second operand has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:08,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:08,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-06-28 02:13:08,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:09,052 INFO L124 PetriNetUnfolderBase]: 539/1392 cut-off events. [2024-06-28 02:13:09,052 INFO L125 PetriNetUnfolderBase]: For 2143/2155 co-relation queries the response was YES. [2024-06-28 02:13:09,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4426 conditions, 1392 events. 539/1392 cut-off events. For 2143/2155 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9898 event pairs, 106 based on Foata normal form. 101/1463 useless extension candidates. Maximal degree in co-relation 4400. Up to 382 conditions per place. [2024-06-28 02:13:09,057 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 38 selfloop transitions, 21 changer transitions 14/94 dead transitions. [2024-06-28 02:13:09,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 94 transitions, 795 flow [2024-06-28 02:13:09,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:13:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:13:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-28 02:13:09,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-06-28 02:13:09,058 INFO L175 Difference]: Start difference. First operand has 109 places, 91 transitions, 686 flow. Second operand 5 states and 115 transitions. [2024-06-28 02:13:09,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 94 transitions, 795 flow [2024-06-28 02:13:09,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 94 transitions, 663 flow, removed 3 selfloop flow, removed 18 redundant places. [2024-06-28 02:13:09,065 INFO L231 Difference]: Finished difference. Result has 96 places, 74 transitions, 507 flow [2024-06-28 02:13:09,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=507, PETRI_PLACES=96, PETRI_TRANSITIONS=74} [2024-06-28 02:13:09,066 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2024-06-28 02:13:09,066 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 74 transitions, 507 flow [2024-06-28 02:13:09,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:09,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:09,067 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-28 02:13:09,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 02:13:09,067 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:09,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1592579626, now seen corresponding path program 1 times [2024-06-28 02:13:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:09,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47741380] [2024-06-28 02:13:09,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:13:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:13:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:13:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47741380] [2024-06-28 02:13:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47741380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:13:09,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:13:09,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:13:09,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829137077] [2024-06-28 02:13:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:13:09,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:13:09,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:13:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:13:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:13:09,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-28 02:13:09,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 74 transitions, 507 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:09,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:13:09,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-28 02:13:09,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:13:09,261 INFO L124 PetriNetUnfolderBase]: 352/953 cut-off events. [2024-06-28 02:13:09,261 INFO L125 PetriNetUnfolderBase]: For 1147/1147 co-relation queries the response was YES. [2024-06-28 02:13:09,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 953 events. 352/953 cut-off events. For 1147/1147 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6193 event pairs, 196 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 2859. Up to 416 conditions per place. [2024-06-28 02:13:09,264 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 26 selfloop transitions, 4 changer transitions 37/88 dead transitions. [2024-06-28 02:13:09,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 88 transitions, 664 flow [2024-06-28 02:13:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:13:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:13:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-28 02:13:09,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2024-06-28 02:13:09,265 INFO L175 Difference]: Start difference. First operand has 96 places, 74 transitions, 507 flow. Second operand 6 states and 121 transitions. [2024-06-28 02:13:09,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 88 transitions, 664 flow [2024-06-28 02:13:09,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 88 transitions, 557 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-28 02:13:09,269 INFO L231 Difference]: Finished difference. Result has 90 places, 49 transitions, 273 flow [2024-06-28 02:13:09,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=90, PETRI_TRANSITIONS=49} [2024-06-28 02:13:09,270 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2024-06-28 02:13:09,270 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 49 transitions, 273 flow [2024-06-28 02:13:09,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:13:09,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:13:09,270 INFO L208 CegarLoopForPetriNet]: trace 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] [2024-06-28 02:13:09,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 02:13:09,277 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:13:09,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:13:09,277 INFO L85 PathProgramCache]: Analyzing trace with hash 498609468, now seen corresponding path program 2 times [2024-06-28 02:13:09,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:13:09,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080290311] [2024-06-28 02:13:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:13:09,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:13:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:13:09,288 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 02:13:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:13:09,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 02:13:09,338 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 02:13:09,339 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-28 02:13:09,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-28 02:13:09,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-28 02:13:09,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-28 02:13:09,345 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-28 02:13:09,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-28 02:13:09,346 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-28 02:13:09,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 02:13:09,346 INFO L445 BasicCegarLoop]: Path program histogram: [7, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:13:09,351 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 02:13:09,352 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 02:13:09,403 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 02:13:09,403 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 02:13:09,404 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 02:13:09 BasicIcfg [2024-06-28 02:13:09,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 02:13:09,404 INFO L158 Benchmark]: Toolchain (without parser) took 40934.10ms. Allocated memory was 169.9MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 138.6MB in the beginning and 467.6MB in the end (delta: -329.0MB). Peak memory consumption was 516.1MB. Max. memory is 16.1GB. [2024-06-28 02:13:09,405 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:13:09,405 INFO L158 Benchmark]: Witness Parser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:13:09,405 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.43ms. Allocated memory is still 169.9MB. Free memory was 138.6MB in the beginning and 106.5MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-28 02:13:09,405 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.74ms. Allocated memory is still 169.9MB. Free memory was 106.5MB in the beginning and 104.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 02:13:09,405 INFO L158 Benchmark]: Boogie Preprocessor took 59.95ms. Allocated memory is still 169.9MB. Free memory was 104.0MB in the beginning and 100.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:13:09,405 INFO L158 Benchmark]: RCFGBuilder took 599.52ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 132.5MB in the end (delta: -31.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-06-28 02:13:09,406 INFO L158 Benchmark]: TraceAbstraction took 39662.90ms. Allocated memory was 169.9MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 131.7MB in the beginning and 467.6MB in the end (delta: -335.9MB). Peak memory consumption was 508.9MB. Max. memory is 16.1GB. [2024-06-28 02:13:09,407 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 169.9MB. Free memory is still 130.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.43ms. Allocated memory is still 169.9MB. Free memory was 138.6MB in the beginning and 106.5MB in the end (delta: 32.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.74ms. Allocated memory is still 169.9MB. Free memory was 106.5MB in the beginning and 104.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.95ms. Allocated memory is still 169.9MB. Free memory was 104.0MB in the beginning and 100.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 599.52ms. Allocated memory is still 169.9MB. Free memory was 100.8MB in the beginning and 132.5MB in the end (delta: -31.7MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 39662.90ms. Allocated memory was 169.9MB in the beginning and 1.0GB in the end (delta: 845.2MB). Free memory was 131.7MB in the beginning and 467.6MB in the end (delta: -335.9MB). Peak memory consumption was 508.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L716] 0 _Bool x$flush_delayed; [L717] 0 int x$mem_tmp; [L718] 0 _Bool x$r_buff0_thd0; [L719] 0 _Bool x$r_buff0_thd1; [L720] 0 _Bool x$r_buff0_thd2; [L721] 0 _Bool x$r_buff1_thd0; [L722] 0 _Bool x$r_buff1_thd1; [L723] 0 _Bool x$r_buff1_thd2; [L724] 0 _Bool x$read_delayed; [L725] 0 int *x$read_delayed_var; [L726] 0 int x$w_buff0; [L727] 0 _Bool x$w_buff0_used; [L728] 0 int x$w_buff1; [L729] 0 _Bool x$w_buff1_used; [L731] 0 int y = 0; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L803] 0 pthread_t t2561; [L804] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L804] FCALL, FORK 0 pthread_create(&t2561, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L805] 0 pthread_t t2562; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L806] 0 //@ assert ((((((((((((((!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))); [L806] FCALL, FORK 0 pthread_create(&t2562, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-1, t2562=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 x$w_buff1 = x$w_buff0 [L768] 2 x$w_buff0 = 1 [L769] 2 x$w_buff1_used = x$w_buff0_used [L770] 2 x$w_buff0_used = (_Bool)1 [L771] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L771] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L772] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L773] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L774] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L775] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L778] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L737] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L807] 0 //@ assert ((((((((((((((!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((x == 0) || (x == 1))) && ((x$mem_tmp == 0) || (x$mem_tmp == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 1))) && ((x$w_buff1 == 0) || (x$w_buff1 == 1))) && (((y == 0) || (y == 1)) || (y == 2))))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-1, t2562=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 x$flush_delayed = weak$$choice2 [L745] 1 x$mem_tmp = x [L746] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L747] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L748] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L749] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L750] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L752] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EAX = x [L754] 1 x = x$flush_delayed ? x$mem_tmp : x [L755] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L781] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L782] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L783] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L784] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L785] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-1, t2562=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L810] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L810] RET 0 assume_abort_if_not(main$tmp_guard0) [L812] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L813] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L814] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L815] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L816] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-1, t2562=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L819] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2561=-1, t2562=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 807]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 54 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 39.5s, OverallIterations: 43, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2394 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2045 mSDsluCounter, 1360 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1178 mSDsCounter, 433 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11426 IncrementalHoareTripleChecker+Invalid, 11859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 433 mSolverCounterUnsat, 182 mSDtfsCounter, 11426 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2086occurred in iteration=32, InterpolantAutomatonStates: 304, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 656 NumberOfCodeBlocks, 656 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 588 ConstructedInterpolants, 0 QuantifiedInterpolants, 20570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 42 InterpolantComputations, 42 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-28 02:13:09,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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