./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/protection/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/protection/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-27 19:09:02,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 19:09:02,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 19:09:02,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 19:09:02,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 19:09:02,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 19:09:02,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 19:09:02,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 19:09:02,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 19:09:02,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 19:09:02,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 19:09:02,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 19:09:02,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 19:09:02,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 19:09:02,999 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 19:09:03,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 19:09:03,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 19:09:03,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 19:09:03,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 19:09:03,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 19:09:03,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 19:09:03,001 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 19:09:03,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 19:09:03,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 19:09:03,002 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 19:09:03,002 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 19:09:03,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 19:09:03,003 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 19:09:03,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 19:09:03,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 19:09:03,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 19:09:03,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 19:09:03,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:09:03,005 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 19:09:03,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 19:09:03,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 19:09:03,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 19:09:03,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 19:09:03,006 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 19:09:03,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 19:09:03,006 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 19:09:03,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 19:09:03,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 19:09:03,007 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-27 19:09:03,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 19:09:03,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 19:09:03,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 19:09:03,330 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 19:09:03,331 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 19:09:03,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 19:09:03,462 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 19:09:03,463 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 19:09:03,464 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-27 19:09:04,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 19:09:04,820 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 19:09:04,821 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-27 19:09:04,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b11b69b29/67916a385c834c5f87c136b7d3d75c06/FLAG40b86bf60 [2024-06-27 19:09:04,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b11b69b29/67916a385c834c5f87c136b7d3d75c06 [2024-06-27 19:09:04,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 19:09:04,843 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 19:09:04,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 19:09:04,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 19:09:04,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 19:09:04,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:09:03" (1/2) ... [2024-06-27 19:09:04,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647a4f9c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:09:04, skipping insertion in model container [2024-06-27 19:09:04,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:09:03" (1/2) ... [2024-06-27 19:09:04,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@26bf3b74 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:09:04, skipping insertion in model container [2024-06-27 19:09:04,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:09:04" (2/2) ... [2024-06-27 19:09:04,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@647a4f9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:04, skipping insertion in model container [2024-06-27 19:09:04,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:09:04" (2/2) ... [2024-06-27 19:09:04,851 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 19:09:04,889 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 19:09:04,890 INFO L97 edCorrectnessWitness]: Location invariant before [L807-L807] (((((((((((((! multithreaded || x$read_delayed == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-27 19:09:04,890 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] (((((((((((((! multithreaded || x$read_delayed == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || (x == 0 || x == 1))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1))) && (! multithreaded || (x$mem_tmp == 0 || x$mem_tmp == 1))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 1))) && (! multithreaded || x$flush_delayed == (_Bool)0) [2024-06-27 19:09:04,890 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 19:09:04,890 INFO L106 edCorrectnessWitness]: ghost_update [L804-L804] multithreaded = 1; [2024-06-27 19:09:04,932 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 19:09:05,085 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-27 19:09:05,260 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:09:05,269 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 19:09:05,297 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-27 19:09:05,365 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:09:05,405 INFO L206 MainTranslator]: Completed translation [2024-06-27 19:09:05,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05 WrapperNode [2024-06-27 19:09:05,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 19:09:05,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 19:09:05,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 19:09:05,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 19:09:05,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,447 INFO L138 Inliner]: procedures = 174, calls = 35, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 108 [2024-06-27 19:09:05,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 19:09:05,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 19:09:05,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 19:09:05,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 19:09:05,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,501 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-27 19:09:05,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,526 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 19:09:05,563 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 19:09:05,563 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 19:09:05,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 19:09:05,564 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (1/1) ... [2024-06-27 19:09:05,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:09:05,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:09:05,620 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-27 19:09:05,684 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-27 19:09:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 19:09:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 19:09:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 19:09:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 19:09:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 19:09:05,693 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 19:09:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 19:09:05,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 19:09:05,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 19:09:05,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 19:09:05,695 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 19:09:05,820 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 19:09:05,822 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 19:09:06,101 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 19:09:06,101 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 19:09:06,188 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 19:09:06,189 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 19:09:06,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:09:06 BoogieIcfgContainer [2024-06-27 19:09:06,189 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 19:09:06,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 19:09:06,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 19:09:06,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 19:09:06,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:09:03" (1/4) ... [2024-06-27 19:09:06,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659fab8e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:09:06, skipping insertion in model container [2024-06-27 19:09:06,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 07:09:04" (2/4) ... [2024-06-27 19:09:06,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659fab8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:09:06, skipping insertion in model container [2024-06-27 19:09:06,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:09:05" (3/4) ... [2024-06-27 19:09:06,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@659fab8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:09:06, skipping insertion in model container [2024-06-27 19:09:06,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:09:06" (4/4) ... [2024-06-27 19:09:06,195 INFO L112 eAbstractionObserver]: Analyzing ICFG safe033_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-06-27 19:09:06,207 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 19:09:06,208 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 19:09:06,208 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 19:09:06,234 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 19:09:06,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 19:09:06,274 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-06-27 19:09:06,274 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:09:06,277 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-27 19:09:06,277 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-06-27 19:09:06,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-06-27 19:09:06,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 19:09:06,290 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;@2b625e54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 19:09:06,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 19:09:06,293 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 19:09:06,294 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 19:09:06,294 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:09:06,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:06,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 19:09:06,295 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-27 19:09:06,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash 302171920, now seen corresponding path program 1 times [2024-06-27 19:09:06,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196612084] [2024-06-27 19:09:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:06,962 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-27 19:09:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196612084] [2024-06-27 19:09:06,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196612084] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:06,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:06,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:09:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567169104] [2024-06-27 19:09:06,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:06,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:09:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:07,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:09:07,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:09:07,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-06-27 19:09:07,049 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-27 19:09:07,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:07,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-06-27 19:09:07,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:07,290 INFO L124 PetriNetUnfolderBase]: 384/675 cut-off events. [2024-06-27 19:09:07,290 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 19:09:07,292 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-27 19:09:07,295 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 29 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-27 19:09:07,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 163 flow [2024-06-27 19:09:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:09:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:09:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-27 19:09:07,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2024-06-27 19:09:07,305 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 76 transitions. [2024-06-27 19:09:07,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 163 flow [2024-06-27 19:09:07,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:09:07,309 INFO L231 Difference]: Finished difference. Result has 41 places, 36 transitions, 98 flow [2024-06-27 19:09:07,310 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-27 19:09:07,313 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2024-06-27 19:09:07,313 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 36 transitions, 98 flow [2024-06-27 19:09:07,313 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-27 19:09:07,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:07,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:07,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 19:09:07,314 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-27 19:09:07,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522001, now seen corresponding path program 1 times [2024-06-27 19:09:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:07,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587798869] [2024-06-27 19:09:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:07,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:07,587 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-27 19:09:07,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:07,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587798869] [2024-06-27 19:09:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587798869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:07,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:09:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833514958] [2024-06-27 19:09:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:07,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:09:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:09:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:09:07,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-06-27 19:09:07,616 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-27 19:09:07,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:07,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-06-27 19:09:07,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:07,745 INFO L124 PetriNetUnfolderBase]: 376/663 cut-off events. [2024-06-27 19:09:07,746 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-06-27 19:09:07,749 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-27 19:09:07,752 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 38 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-27 19:09:07,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 236 flow [2024-06-27 19:09:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:09:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:09:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-06-27 19:09:07,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2024-06-27 19:09:07,755 INFO L175 Difference]: Start difference. First operand has 41 places, 36 transitions, 98 flow. Second operand 4 states and 99 transitions. [2024-06-27 19:09:07,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 236 flow [2024-06-27 19:09:07,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:09:07,759 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 132 flow [2024-06-27 19:09:07,759 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-27 19:09:07,760 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-06-27 19:09:07,760 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 132 flow [2024-06-27 19:09:07,760 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-27 19:09:07,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:07,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:07,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 19:09:07,762 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-27 19:09:07,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash -247451359, now seen corresponding path program 1 times [2024-06-27 19:09:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:07,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349369441] [2024-06-27 19:09:07,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:07,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:07,852 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-27 19:09:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:07,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349369441] [2024-06-27 19:09:07,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349369441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:07,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:09:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333875192] [2024-06-27 19:09:07,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:07,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:09:07,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:07,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:09:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:09:07,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 36 [2024-06-27 19:09:07,855 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-27 19:09:07,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:07,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 36 [2024-06-27 19:09:07,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:07,924 INFO L124 PetriNetUnfolderBase]: 130/311 cut-off events. [2024-06-27 19:09:07,924 INFO L125 PetriNetUnfolderBase]: For 113/120 co-relation queries the response was YES. [2024-06-27 19:09:07,925 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-27 19:09:07,926 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 19 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2024-06-27 19:09:07,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 175 flow [2024-06-27 19:09:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:09:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:09:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-06-27 19:09:07,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-06-27 19:09:07,930 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 132 flow. Second operand 3 states and 80 transitions. [2024-06-27 19:09:07,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 175 flow [2024-06-27 19:09:07,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 166 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 19:09:07,934 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 112 flow [2024-06-27 19:09:07,934 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-27 19:09:07,935 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-06-27 19:09:07,935 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 112 flow [2024-06-27 19:09:07,935 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-27 19:09:07,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:07,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:07,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 19:09:07,936 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-27 19:09:07,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1577556782, now seen corresponding path program 1 times [2024-06-27 19:09:07,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872003932] [2024-06-27 19:09:07,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:08,326 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-27 19:09:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872003932] [2024-06-27 19:09:08,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872003932] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:08,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:08,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:09:08,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439757961] [2024-06-27 19:09:08,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:08,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:09:08,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:08,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:09:08,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:09:08,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:08,376 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-27 19:09:08,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:08,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:08,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:08,543 INFO L124 PetriNetUnfolderBase]: 373/768 cut-off events. [2024-06-27 19:09:08,544 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2024-06-27 19:09:08,545 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-27 19:09:08,547 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 35 selfloop transitions, 7 changer transitions 2/53 dead transitions. [2024-06-27 19:09:08,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 246 flow [2024-06-27 19:09:08,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:09:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:09:08,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-27 19:09:08,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 19:09:08,548 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 112 flow. Second operand 5 states and 96 transitions. [2024-06-27 19:09:08,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 246 flow [2024-06-27 19:09:08,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:09:08,550 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 153 flow [2024-06-27 19:09:08,550 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-27 19:09:08,550 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-06-27 19:09:08,550 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 153 flow [2024-06-27 19:09:08,550 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-27 19:09:08,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:08,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:08,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 19:09:08,551 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-27 19:09:08,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:08,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1266792403, now seen corresponding path program 1 times [2024-06-27 19:09:08,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:08,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702360941] [2024-06-27 19:09:08,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:08,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:09,102 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-27 19:09:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:09,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702360941] [2024-06-27 19:09:09,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702360941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:09,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:09,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:09:09,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722003176] [2024-06-27 19:09:09,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:09,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:09:09,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:09,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:09:09,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:09:09,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-06-27 19:09:09,133 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-27 19:09:09,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:09,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-06-27 19:09:09,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:09,313 INFO L124 PetriNetUnfolderBase]: 269/568 cut-off events. [2024-06-27 19:09:09,314 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2024-06-27 19:09:09,315 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-27 19:09:09,317 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 45 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-27 19:09:09,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 325 flow [2024-06-27 19:09:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:09:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:09:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-06-27 19:09:09,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6064814814814815 [2024-06-27 19:09:09,318 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 153 flow. Second operand 6 states and 131 transitions. [2024-06-27 19:09:09,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 325 flow [2024-06-27 19:09:09,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 316 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 19:09:09,321 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 174 flow [2024-06-27 19:09:09,321 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-27 19:09:09,321 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2024-06-27 19:09:09,322 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 174 flow [2024-06-27 19:09:09,322 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-27 19:09:09,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:09,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:09,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 19:09:09,322 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-27 19:09:09,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:09,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1659618608, now seen corresponding path program 1 times [2024-06-27 19:09:09,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:09,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306051750] [2024-06-27 19:09:09,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:09,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:09,720 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-27 19:09:09,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:09,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306051750] [2024-06-27 19:09:09,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306051750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:09,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:09,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:09:09,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992389497] [2024-06-27 19:09:09,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:09,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:09:09,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:09,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:09:09,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:09:09,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:09,760 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-27 19:09:09,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:09,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:09,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:09,944 INFO L124 PetriNetUnfolderBase]: 375/779 cut-off events. [2024-06-27 19:09:09,944 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES. [2024-06-27 19:09:09,945 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-27 19:09:09,948 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 46 selfloop transitions, 14 changer transitions 0/69 dead transitions. [2024-06-27 19:09:09,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 388 flow [2024-06-27 19:09:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:09:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:09:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-27 19:09:09,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-27 19:09:09,950 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 174 flow. Second operand 6 states and 118 transitions. [2024-06-27 19:09:09,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 388 flow [2024-06-27 19:09:09,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 366 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 19:09:09,952 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 252 flow [2024-06-27 19:09:09,952 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-27 19:09:09,953 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-06-27 19:09:09,953 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 252 flow [2024-06-27 19:09:09,953 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-27 19:09:09,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:09,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:09,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 19:09:09,954 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-27 19:09:09,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:09,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1423219663, now seen corresponding path program 1 times [2024-06-27 19:09:09,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:09,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833188317] [2024-06-27 19:09:09,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:09,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:10,306 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-27 19:09:10,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:10,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833188317] [2024-06-27 19:09:10,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833188317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:10,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:10,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:09:10,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963497203] [2024-06-27 19:09:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:10,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:09:10,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:10,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:09:10,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:09:10,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:10,353 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-27 19:09:10,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:10,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:10,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:10,550 INFO L124 PetriNetUnfolderBase]: 406/826 cut-off events. [2024-06-27 19:09:10,550 INFO L125 PetriNetUnfolderBase]: For 1226/1226 co-relation queries the response was YES. [2024-06-27 19:09:10,552 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-27 19:09:10,555 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 53 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2024-06-27 19:09:10,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 77 transitions, 483 flow [2024-06-27 19:09:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 19:09:10,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2024-06-27 19:09:10,556 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 252 flow. Second operand 7 states and 132 transitions. [2024-06-27 19:09:10,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 77 transitions, 483 flow [2024-06-27 19:09:10,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 77 transitions, 475 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 19:09:10,559 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 336 flow [2024-06-27 19:09:10,560 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-27 19:09:10,560 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-06-27 19:09:10,560 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 336 flow [2024-06-27 19:09:10,560 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-27 19:09:10,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:10,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:10,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 19:09:10,561 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-27 19:09:10,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 818068075, now seen corresponding path program 2 times [2024-06-27 19:09:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:10,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808524769] [2024-06-27 19:09:10,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:10,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:10,960 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-27 19:09:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808524769] [2024-06-27 19:09:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808524769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:10,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:09:10,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774467797] [2024-06-27 19:09:10,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:10,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:09:10,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:10,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:09:10,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:09:10,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:10,993 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-27 19:09:10,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:10,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:10,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:11,230 INFO L124 PetriNetUnfolderBase]: 428/872 cut-off events. [2024-06-27 19:09:11,231 INFO L125 PetriNetUnfolderBase]: For 1813/1813 co-relation queries the response was YES. [2024-06-27 19:09:11,232 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-27 19:09:11,235 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 52 selfloop transitions, 15 changer transitions 0/76 dead transitions. [2024-06-27 19:09:11,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 76 transitions, 541 flow [2024-06-27 19:09:11,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:09:11,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:09:11,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-27 19:09:11,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 19:09:11,237 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 336 flow. Second operand 6 states and 114 transitions. [2024-06-27 19:09:11,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 76 transitions, 541 flow [2024-06-27 19:09:11,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 508 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 19:09:11,240 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 364 flow [2024-06-27 19:09:11,241 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-27 19:09:11,241 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2024-06-27 19:09:11,241 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 364 flow [2024-06-27 19:09:11,241 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-27 19:09:11,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:11,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 19:09:11,242 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-27 19:09:11,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -213339737, now seen corresponding path program 3 times [2024-06-27 19:09:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:11,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679691164] [2024-06-27 19:09:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:11,580 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-27 19:09:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:11,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679691164] [2024-06-27 19:09:11,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679691164] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:11,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:11,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:09:11,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725250127] [2024-06-27 19:09:11,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:11,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:09:11,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:11,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:09:11,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:09:11,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:11,619 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-27 19:09:11,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:11,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:11,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:11,920 INFO L124 PetriNetUnfolderBase]: 418/876 cut-off events. [2024-06-27 19:09:11,921 INFO L125 PetriNetUnfolderBase]: For 2104/2104 co-relation queries the response was YES. [2024-06-27 19:09:11,923 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-27 19:09:11,932 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 49 selfloop transitions, 19 changer transitions 0/77 dead transitions. [2024-06-27 19:09:11,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 558 flow [2024-06-27 19:09:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:09:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:09:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-27 19:09:11,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2024-06-27 19:09:11,934 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 364 flow. Second operand 6 states and 117 transitions. [2024-06-27 19:09:11,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 558 flow [2024-06-27 19:09:11,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 522 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 19:09:11,937 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 373 flow [2024-06-27 19:09:11,938 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-27 19:09:11,938 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 26 predicate places. [2024-06-27 19:09:11,938 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 373 flow [2024-06-27 19:09:11,938 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-27 19:09:11,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:11,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:11,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 19:09:11,939 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-27 19:09:11,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:11,939 INFO L85 PathProgramCache]: Analyzing trace with hash -213329817, now seen corresponding path program 1 times [2024-06-27 19:09:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205536092] [2024-06-27 19:09:11,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:12,425 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-27 19:09:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205536092] [2024-06-27 19:09:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205536092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:12,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:12,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:09:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733647969] [2024-06-27 19:09:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:12,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:09:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:09:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:09:12,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:12,488 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-27 19:09:12,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:12,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:12,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:12,692 INFO L124 PetriNetUnfolderBase]: 430/873 cut-off events. [2024-06-27 19:09:12,692 INFO L125 PetriNetUnfolderBase]: For 1953/1953 co-relation queries the response was YES. [2024-06-27 19:09:12,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2867 conditions, 873 events. 430/873 cut-off events. For 1953/1953 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4821 event pairs, 91 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 2838. Up to 558 conditions per place. [2024-06-27 19:09:12,697 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 61 selfloop transitions, 26 changer transitions 0/96 dead transitions. [2024-06-27 19:09:12,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 96 transitions, 715 flow [2024-06-27 19:09:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:12,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-06-27 19:09:12,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-27 19:09:12,699 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 373 flow. Second operand 7 states and 135 transitions. [2024-06-27 19:09:12,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 96 transitions, 715 flow [2024-06-27 19:09:12,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 96 transitions, 652 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:12,703 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 508 flow [2024-06-27 19:09:12,703 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=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=508, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2024-06-27 19:09:12,704 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2024-06-27 19:09:12,704 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 508 flow [2024-06-27 19:09:12,704 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-27 19:09:12,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:12,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:12,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 19:09:12,705 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-27 19:09:12,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:12,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1976711705, now seen corresponding path program 1 times [2024-06-27 19:09:12,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:12,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248530130] [2024-06-27 19:09:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:12,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:13,224 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-27 19:09:13,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:13,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248530130] [2024-06-27 19:09:13,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248530130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:13,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:13,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:13,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586399434] [2024-06-27 19:09:13,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:13,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:13,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:13,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:13,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 508 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-27 19:09:13,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:13,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:13,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:13,584 INFO L124 PetriNetUnfolderBase]: 443/896 cut-off events. [2024-06-27 19:09:13,584 INFO L125 PetriNetUnfolderBase]: For 2228/2228 co-relation queries the response was YES. [2024-06-27 19:09:13,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3210 conditions, 896 events. 443/896 cut-off events. For 2228/2228 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4969 event pairs, 91 based on Foata normal form. 4/872 useless extension candidates. Maximal degree in co-relation 3178. Up to 537 conditions per place. [2024-06-27 19:09:13,589 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 66 selfloop transitions, 28 changer transitions 0/103 dead transitions. [2024-06-27 19:09:13,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 800 flow [2024-06-27 19:09:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 153 transitions. [2024-06-27 19:09:13,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-06-27 19:09:13,591 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 508 flow. Second operand 8 states and 153 transitions. [2024-06-27 19:09:13,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 800 flow [2024-06-27 19:09:13,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 770 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-27 19:09:13,596 INFO L231 Difference]: Finished difference. Result has 76 places, 75 transitions, 561 flow [2024-06-27 19:09:13,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=561, PETRI_PLACES=76, PETRI_TRANSITIONS=75} [2024-06-27 19:09:13,597 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2024-06-27 19:09:13,597 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 75 transitions, 561 flow [2024-06-27 19:09:13,597 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-27 19:09:13,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:13,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:13,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 19:09:13,598 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-27 19:09:13,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:13,598 INFO L85 PathProgramCache]: Analyzing trace with hash -620949484, now seen corresponding path program 1 times [2024-06-27 19:09:13,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:13,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583241385] [2024-06-27 19:09:13,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:13,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:14,027 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-27 19:09:14,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:14,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583241385] [2024-06-27 19:09:14,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583241385] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:14,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:14,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:09:14,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915142615] [2024-06-27 19:09:14,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:14,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:09:14,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:14,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:09:14,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:09:14,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:14,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 75 transitions, 561 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-27 19:09:14,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:14,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:14,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:14,315 INFO L124 PetriNetUnfolderBase]: 444/906 cut-off events. [2024-06-27 19:09:14,316 INFO L125 PetriNetUnfolderBase]: For 2559/2559 co-relation queries the response was YES. [2024-06-27 19:09:14,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3338 conditions, 906 events. 444/906 cut-off events. For 2559/2559 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5224 event pairs, 118 based on Foata normal form. 1/876 useless extension candidates. Maximal degree in co-relation 3304. Up to 689 conditions per place. [2024-06-27 19:09:14,322 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 77 selfloop transitions, 16 changer transitions 0/102 dead transitions. [2024-06-27 19:09:14,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 102 transitions, 843 flow [2024-06-27 19:09:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-27 19:09:14,323 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 19:09:14,324 INFO L175 Difference]: Start difference. First operand has 76 places, 75 transitions, 561 flow. Second operand 7 states and 133 transitions. [2024-06-27 19:09:14,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 102 transitions, 843 flow [2024-06-27 19:09:14,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 102 transitions, 778 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 19:09:14,330 INFO L231 Difference]: Finished difference. Result has 78 places, 80 transitions, 578 flow [2024-06-27 19:09:14,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=578, PETRI_PLACES=78, PETRI_TRANSITIONS=80} [2024-06-27 19:09:14,330 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-06-27 19:09:14,330 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 80 transitions, 578 flow [2024-06-27 19:09:14,331 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-27 19:09:14,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:14,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:14,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 19:09:14,331 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-27 19:09:14,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:14,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1215777362, now seen corresponding path program 1 times [2024-06-27 19:09:14,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:14,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441801699] [2024-06-27 19:09:14,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:14,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:14,754 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-27 19:09:14,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:14,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441801699] [2024-06-27 19:09:14,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441801699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:14,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:14,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:09:14,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494026783] [2024-06-27 19:09:14,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:14,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:09:14,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:14,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:09:14,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:09:14,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:14,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 578 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-27 19:09:14,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:14,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:14,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:15,029 INFO L124 PetriNetUnfolderBase]: 458/926 cut-off events. [2024-06-27 19:09:15,029 INFO L125 PetriNetUnfolderBase]: For 2646/2646 co-relation queries the response was YES. [2024-06-27 19:09:15,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 926 events. 458/926 cut-off events. For 2646/2646 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5172 event pairs, 86 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 3333. Up to 615 conditions per place. [2024-06-27 19:09:15,035 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 72 selfloop transitions, 25 changer transitions 0/106 dead transitions. [2024-06-27 19:09:15,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 106 transitions, 871 flow [2024-06-27 19:09:15,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 19:09:15,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-06-27 19:09:15,036 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 578 flow. Second operand 7 states and 134 transitions. [2024-06-27 19:09:15,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 106 transitions, 871 flow [2024-06-27 19:09:15,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 106 transitions, 833 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 19:09:15,042 INFO L231 Difference]: Finished difference. Result has 82 places, 84 transitions, 636 flow [2024-06-27 19:09:15,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=636, PETRI_PLACES=82, PETRI_TRANSITIONS=84} [2024-06-27 19:09:15,043 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 42 predicate places. [2024-06-27 19:09:15,043 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 84 transitions, 636 flow [2024-06-27 19:09:15,043 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-27 19:09:15,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:15,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:15,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 19:09:15,044 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-27 19:09:15,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:15,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1966948880, now seen corresponding path program 2 times [2024-06-27 19:09:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:15,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916535463] [2024-06-27 19:09:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:15,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:15,426 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-27 19:09:15,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:15,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916535463] [2024-06-27 19:09:15,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916535463] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:15,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:15,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:09:15,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178685366] [2024-06-27 19:09:15,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:15,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:09:15,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:15,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:09:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:09:15,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:15,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 84 transitions, 636 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-27 19:09:15,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:15,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:15,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:15,668 INFO L124 PetriNetUnfolderBase]: 456/945 cut-off events. [2024-06-27 19:09:15,668 INFO L125 PetriNetUnfolderBase]: For 3030/3030 co-relation queries the response was YES. [2024-06-27 19:09:15,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3539 conditions, 945 events. 456/945 cut-off events. For 3030/3030 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5377 event pairs, 96 based on Foata normal form. 1/916 useless extension candidates. Maximal degree in co-relation 3501. Up to 575 conditions per place. [2024-06-27 19:09:15,675 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 75 selfloop transitions, 24 changer transitions 0/108 dead transitions. [2024-06-27 19:09:15,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 108 transitions, 922 flow [2024-06-27 19:09:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:15,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 19:09:15,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2024-06-27 19:09:15,676 INFO L175 Difference]: Start difference. First operand has 82 places, 84 transitions, 636 flow. Second operand 7 states and 134 transitions. [2024-06-27 19:09:15,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 108 transitions, 922 flow [2024-06-27 19:09:15,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 108 transitions, 886 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-27 19:09:15,683 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 671 flow [2024-06-27 19:09:15,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=671, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2024-06-27 19:09:15,684 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2024-06-27 19:09:15,684 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 671 flow [2024-06-27 19:09:15,684 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-27 19:09:15,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:15,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:15,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 19:09:15,685 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-27 19:09:15,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:15,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1927460372, now seen corresponding path program 1 times [2024-06-27 19:09:15,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:15,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32108147] [2024-06-27 19:09:15,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:15,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:16,168 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-27 19:09:16,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:16,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32108147] [2024-06-27 19:09:16,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32108147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:16,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:16,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:09:16,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462610769] [2024-06-27 19:09:16,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:16,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:09:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:16,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:09:16,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:09:16,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:16,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 671 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-27 19:09:16,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:16,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:16,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:16,454 INFO L124 PetriNetUnfolderBase]: 457/930 cut-off events. [2024-06-27 19:09:16,454 INFO L125 PetriNetUnfolderBase]: For 3353/3353 co-relation queries the response was YES. [2024-06-27 19:09:16,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 930 events. 457/930 cut-off events. For 3353/3353 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5385 event pairs, 106 based on Foata normal form. 1/895 useless extension candidates. Maximal degree in co-relation 3578. Up to 543 conditions per place. [2024-06-27 19:09:16,460 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 67 selfloop transitions, 31 changer transitions 0/107 dead transitions. [2024-06-27 19:09:16,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 960 flow [2024-06-27 19:09:16,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:09:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:09:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-27 19:09:16,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2024-06-27 19:09:16,462 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 671 flow. Second operand 6 states and 118 transitions. [2024-06-27 19:09:16,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 960 flow [2024-06-27 19:09:16,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 107 transitions, 899 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:16,471 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 712 flow [2024-06-27 19:09:16,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=712, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2024-06-27 19:09:16,473 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 47 predicate places. [2024-06-27 19:09:16,473 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 712 flow [2024-06-27 19:09:16,473 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-27 19:09:16,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:16,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:16,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 19:09:16,474 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-27 19:09:16,474 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:16,474 INFO L85 PathProgramCache]: Analyzing trace with hash 835755246, now seen corresponding path program 1 times [2024-06-27 19:09:16,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:16,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937798921] [2024-06-27 19:09:16,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:17,037 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-27 19:09:17,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:17,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937798921] [2024-06-27 19:09:17,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937798921] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:17,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:17,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:17,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519764029] [2024-06-27 19:09:17,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:17,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:17,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:17,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:17,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:17,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 712 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-27 19:09:17,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:17,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:17,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:17,361 INFO L124 PetriNetUnfolderBase]: 473/935 cut-off events. [2024-06-27 19:09:17,361 INFO L125 PetriNetUnfolderBase]: For 3972/3972 co-relation queries the response was YES. [2024-06-27 19:09:17,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3800 conditions, 935 events. 473/935 cut-off events. For 3972/3972 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5251 event pairs, 86 based on Foata normal form. 2/915 useless extension candidates. Maximal degree in co-relation 3760. Up to 620 conditions per place. [2024-06-27 19:09:17,367 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 82 selfloop transitions, 26 changer transitions 0/117 dead transitions. [2024-06-27 19:09:17,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 117 transitions, 1032 flow [2024-06-27 19:09:17,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:17,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 19:09:17,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-27 19:09:17,368 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 712 flow. Second operand 8 states and 152 transitions. [2024-06-27 19:09:17,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 117 transitions, 1032 flow [2024-06-27 19:09:17,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 117 transitions, 980 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 19:09:17,376 INFO L231 Difference]: Finished difference. Result has 91 places, 89 transitions, 728 flow [2024-06-27 19:09:17,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=728, PETRI_PLACES=91, PETRI_TRANSITIONS=89} [2024-06-27 19:09:17,376 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 51 predicate places. [2024-06-27 19:09:17,377 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 89 transitions, 728 flow [2024-06-27 19:09:17,377 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-27 19:09:17,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:17,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:17,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 19:09:17,377 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-27 19:09:17,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:17,378 INFO L85 PathProgramCache]: Analyzing trace with hash 845874576, now seen corresponding path program 2 times [2024-06-27 19:09:17,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:17,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150928440] [2024-06-27 19:09:17,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:17,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:17,970 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-27 19:09:17,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:17,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150928440] [2024-06-27 19:09:17,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150928440] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:17,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:17,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:17,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324591465] [2024-06-27 19:09:17,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:17,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:17,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:17,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:17,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:18,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:18,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 89 transitions, 728 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-27 19:09:18,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:18,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:18,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:18,429 INFO L124 PetriNetUnfolderBase]: 613/1244 cut-off events. [2024-06-27 19:09:18,429 INFO L125 PetriNetUnfolderBase]: For 6256/6256 co-relation queries the response was YES. [2024-06-27 19:09:18,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4872 conditions, 1244 events. 613/1244 cut-off events. For 6256/6256 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7592 event pairs, 132 based on Foata normal form. 15/1222 useless extension candidates. Maximal degree in co-relation 4831. Up to 579 conditions per place. [2024-06-27 19:09:18,444 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 98 selfloop transitions, 36 changer transitions 0/143 dead transitions. [2024-06-27 19:09:18,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 143 transitions, 1300 flow [2024-06-27 19:09:18,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-06-27 19:09:18,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.558641975308642 [2024-06-27 19:09:18,446 INFO L175 Difference]: Start difference. First operand has 91 places, 89 transitions, 728 flow. Second operand 9 states and 181 transitions. [2024-06-27 19:09:18,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 143 transitions, 1300 flow [2024-06-27 19:09:18,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 143 transitions, 1224 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-27 19:09:18,458 INFO L231 Difference]: Finished difference. Result has 96 places, 103 transitions, 897 flow [2024-06-27 19:09:18,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=96, PETRI_TRANSITIONS=103} [2024-06-27 19:09:18,459 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 56 predicate places. [2024-06-27 19:09:18,459 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 103 transitions, 897 flow [2024-06-27 19:09:18,459 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-27 19:09:18,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:18,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:18,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 19:09:18,460 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-27 19:09:18,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:18,460 INFO L85 PathProgramCache]: Analyzing trace with hash 846230766, now seen corresponding path program 3 times [2024-06-27 19:09:18,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:18,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318352849] [2024-06-27 19:09:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:19,016 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-27 19:09:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:19,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318352849] [2024-06-27 19:09:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318352849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344907318] [2024-06-27 19:09:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:19,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:19,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:19,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 103 transitions, 897 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-27 19:09:19,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:19,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:19,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:19,407 INFO L124 PetriNetUnfolderBase]: 722/1435 cut-off events. [2024-06-27 19:09:19,408 INFO L125 PetriNetUnfolderBase]: For 8270/8270 co-relation queries the response was YES. [2024-06-27 19:09:19,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6112 conditions, 1435 events. 722/1435 cut-off events. For 8270/8270 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9086 event pairs, 157 based on Foata normal form. 2/1402 useless extension candidates. Maximal degree in co-relation 6068. Up to 484 conditions per place. [2024-06-27 19:09:19,417 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 102 selfloop transitions, 33 changer transitions 0/144 dead transitions. [2024-06-27 19:09:19,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 144 transitions, 1418 flow [2024-06-27 19:09:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-27 19:09:19,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590277777777778 [2024-06-27 19:09:19,418 INFO L175 Difference]: Start difference. First operand has 96 places, 103 transitions, 897 flow. Second operand 8 states and 161 transitions. [2024-06-27 19:09:19,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 144 transitions, 1418 flow [2024-06-27 19:09:19,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 144 transitions, 1350 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:19,435 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 942 flow [2024-06-27 19:09:19,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=942, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2024-06-27 19:09:19,436 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 60 predicate places. [2024-06-27 19:09:19,436 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 942 flow [2024-06-27 19:09:19,436 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-27 19:09:19,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:19,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:19,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 19:09:19,437 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-27 19:09:19,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:19,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1966620970, now seen corresponding path program 1 times [2024-06-27 19:09:19,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:19,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591584037] [2024-06-27 19:09:19,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:19,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:19,503 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-27 19:09:19,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:19,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591584037] [2024-06-27 19:09:19,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591584037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:19,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:19,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:09:19,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42388008] [2024-06-27 19:09:19,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:19,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:09:19,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:19,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:09:19,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:09:19,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-27 19:09:19,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 942 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-27 19:09:19,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:19,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-27 19:09:19,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:19,804 INFO L124 PetriNetUnfolderBase]: 1105/2220 cut-off events. [2024-06-27 19:09:19,805 INFO L125 PetriNetUnfolderBase]: For 10594/10653 co-relation queries the response was YES. [2024-06-27 19:09:19,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8866 conditions, 2220 events. 1105/2220 cut-off events. For 10594/10653 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 15770 event pairs, 311 based on Foata normal form. 54/2164 useless extension candidates. Maximal degree in co-relation 8821. Up to 1155 conditions per place. [2024-06-27 19:09:19,820 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 121 selfloop transitions, 8 changer transitions 100/259 dead transitions. [2024-06-27 19:09:19,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 259 transitions, 2798 flow [2024-06-27 19:09:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-27 19:09:19,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-06-27 19:09:19,821 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 942 flow. Second operand 8 states and 174 transitions. [2024-06-27 19:09:19,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 259 transitions, 2798 flow [2024-06-27 19:09:19,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 259 transitions, 2647 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:19,858 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 932 flow [2024-06-27 19:09:19,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=932, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2024-06-27 19:09:19,859 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 67 predicate places. [2024-06-27 19:09:19,859 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 932 flow [2024-06-27 19:09:19,859 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-27 19:09:19,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:19,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:19,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 19:09:19,860 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-27 19:09:19,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash -111054137, now seen corresponding path program 1 times [2024-06-27 19:09:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:19,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623916228] [2024-06-27 19:09:19,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:19,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:20,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-27 19:09:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623916228] [2024-06-27 19:09:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623916228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345849417] [2024-06-27 19:09:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:20,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:20,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:20,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:20,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:20,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 932 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-27 19:09:20,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:20,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:20,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:20,760 INFO L124 PetriNetUnfolderBase]: 734/1483 cut-off events. [2024-06-27 19:09:20,760 INFO L125 PetriNetUnfolderBase]: For 8820/8820 co-relation queries the response was YES. [2024-06-27 19:09:20,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6522 conditions, 1483 events. 734/1483 cut-off events. For 8820/8820 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9643 event pairs, 201 based on Foata normal form. 2/1480 useless extension candidates. Maximal degree in co-relation 6472. Up to 1170 conditions per place. [2024-06-27 19:09:20,771 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 111 selfloop transitions, 17 changer transitions 0/137 dead transitions. [2024-06-27 19:09:20,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 137 transitions, 1296 flow [2024-06-27 19:09:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-27 19:09:20,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5208333333333334 [2024-06-27 19:09:20,772 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 932 flow. Second operand 8 states and 150 transitions. [2024-06-27 19:09:20,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 137 transitions, 1296 flow [2024-06-27 19:09:20,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 1276 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 19:09:20,796 INFO L231 Difference]: Finished difference. Result has 109 places, 110 transitions, 985 flow [2024-06-27 19:09:20,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=985, PETRI_PLACES=109, PETRI_TRANSITIONS=110} [2024-06-27 19:09:20,796 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 69 predicate places. [2024-06-27 19:09:20,796 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 110 transitions, 985 flow [2024-06-27 19:09:20,796 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-27 19:09:20,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:20,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:20,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 19:09:20,797 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-27 19:09:20,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:20,797 INFO L85 PathProgramCache]: Analyzing trace with hash 844744553, now seen corresponding path program 2 times [2024-06-27 19:09:20,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:20,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21792001] [2024-06-27 19:09:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:21,357 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-27 19:09:21,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:21,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21792001] [2024-06-27 19:09:21,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21792001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:21,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:21,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723506709] [2024-06-27 19:09:21,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:21,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:21,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:21,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:21,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:21,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:21,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 985 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-27 19:09:21,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:21,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:21,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:21,810 INFO L124 PetriNetUnfolderBase]: 735/1490 cut-off events. [2024-06-27 19:09:21,810 INFO L125 PetriNetUnfolderBase]: For 9455/9455 co-relation queries the response was YES. [2024-06-27 19:09:21,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6579 conditions, 1490 events. 735/1490 cut-off events. For 9455/9455 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9692 event pairs, 240 based on Foata normal form. 2/1487 useless extension candidates. Maximal degree in co-relation 6527. Up to 1192 conditions per place. [2024-06-27 19:09:21,820 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 113 selfloop transitions, 17 changer transitions 0/139 dead transitions. [2024-06-27 19:09:21,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 139 transitions, 1355 flow [2024-06-27 19:09:21,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-27 19:09:21,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5243055555555556 [2024-06-27 19:09:21,821 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 985 flow. Second operand 8 states and 151 transitions. [2024-06-27 19:09:21,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 139 transitions, 1355 flow [2024-06-27 19:09:21,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 139 transitions, 1310 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:21,842 INFO L231 Difference]: Finished difference. Result has 112 places, 111 transitions, 994 flow [2024-06-27 19:09:21,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=994, PETRI_PLACES=112, PETRI_TRANSITIONS=111} [2024-06-27 19:09:21,843 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 72 predicate places. [2024-06-27 19:09:21,843 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 111 transitions, 994 flow [2024-06-27 19:09:21,843 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-27 19:09:21,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:21,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:21,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 19:09:21,844 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-27 19:09:21,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:21,844 INFO L85 PathProgramCache]: Analyzing trace with hash -110900315, now seen corresponding path program 1 times [2024-06-27 19:09:21,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480624419] [2024-06-27 19:09:21,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:22,441 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-27 19:09:22,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:22,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480624419] [2024-06-27 19:09:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480624419] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:22,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:22,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:22,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577168272] [2024-06-27 19:09:22,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:22,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:22,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:22,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:22,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 111 transitions, 994 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-27 19:09:22,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:22,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:22,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:22,823 INFO L124 PetriNetUnfolderBase]: 744/1542 cut-off events. [2024-06-27 19:09:22,823 INFO L125 PetriNetUnfolderBase]: For 9983/9985 co-relation queries the response was YES. [2024-06-27 19:09:22,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6715 conditions, 1542 events. 744/1542 cut-off events. For 9983/9985 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10156 event pairs, 185 based on Foata normal form. 4/1540 useless extension candidates. Maximal degree in co-relation 6662. Up to 1020 conditions per place. [2024-06-27 19:09:22,834 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 90 selfloop transitions, 38 changer transitions 0/137 dead transitions. [2024-06-27 19:09:22,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 137 transitions, 1379 flow [2024-06-27 19:09:22,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 19:09:22,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-06-27 19:09:22,837 INFO L175 Difference]: Start difference. First operand has 112 places, 111 transitions, 994 flow. Second operand 7 states and 138 transitions. [2024-06-27 19:09:22,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 137 transitions, 1379 flow [2024-06-27 19:09:22,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 137 transitions, 1325 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 19:09:22,862 INFO L231 Difference]: Finished difference. Result has 113 places, 113 transitions, 1058 flow [2024-06-27 19:09:22,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=940, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1058, PETRI_PLACES=113, PETRI_TRANSITIONS=113} [2024-06-27 19:09:22,863 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 73 predicate places. [2024-06-27 19:09:22,863 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 113 transitions, 1058 flow [2024-06-27 19:09:22,863 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-27 19:09:22,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:22,864 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:22,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 19:09:22,864 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-27 19:09:22,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:22,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1396006461, now seen corresponding path program 3 times [2024-06-27 19:09:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:22,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333564350] [2024-06-27 19:09:22,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:22,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:23,341 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-27 19:09:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:23,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333564350] [2024-06-27 19:09:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333564350] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:23,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:23,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613104199] [2024-06-27 19:09:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:23,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:23,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:23,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:23,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:23,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 113 transitions, 1058 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-27 19:09:23,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:23,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:23,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:23,785 INFO L124 PetriNetUnfolderBase]: 741/1499 cut-off events. [2024-06-27 19:09:23,786 INFO L125 PetriNetUnfolderBase]: For 10508/10508 co-relation queries the response was YES. [2024-06-27 19:09:23,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6798 conditions, 1499 events. 741/1499 cut-off events. For 10508/10508 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9755 event pairs, 232 based on Foata normal form. 2/1496 useless extension candidates. Maximal degree in co-relation 6744. Up to 1182 conditions per place. [2024-06-27 19:09:23,794 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 114 selfloop transitions, 19 changer transitions 0/142 dead transitions. [2024-06-27 19:09:23,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 142 transitions, 1446 flow [2024-06-27 19:09:23,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:23,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2024-06-27 19:09:23,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173611111111112 [2024-06-27 19:09:23,796 INFO L175 Difference]: Start difference. First operand has 113 places, 113 transitions, 1058 flow. Second operand 8 states and 149 transitions. [2024-06-27 19:09:23,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 142 transitions, 1446 flow [2024-06-27 19:09:23,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 142 transitions, 1364 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:23,819 INFO L231 Difference]: Finished difference. Result has 117 places, 115 transitions, 1050 flow [2024-06-27 19:09:23,819 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=976, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1050, PETRI_PLACES=117, PETRI_TRANSITIONS=115} [2024-06-27 19:09:23,820 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 77 predicate places. [2024-06-27 19:09:23,820 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 115 transitions, 1050 flow [2024-06-27 19:09:23,820 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-27 19:09:23,820 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:23,820 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:23,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 19:09:23,820 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-27 19:09:23,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1161898729, now seen corresponding path program 2 times [2024-06-27 19:09:23,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:23,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704324741] [2024-06-27 19:09:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:24,322 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-27 19:09:24,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:24,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704324741] [2024-06-27 19:09:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704324741] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:24,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:24,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:24,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940975352] [2024-06-27 19:09:24,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:24,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:24,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:24,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:24,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:24,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 1050 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-27 19:09:24,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:24,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:24,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:24,715 INFO L124 PetriNetUnfolderBase]: 758/1487 cut-off events. [2024-06-27 19:09:24,716 INFO L125 PetriNetUnfolderBase]: For 10854/10858 co-relation queries the response was YES. [2024-06-27 19:09:24,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6840 conditions, 1487 events. 758/1487 cut-off events. For 10854/10858 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9420 event pairs, 131 based on Foata normal form. 5/1486 useless extension candidates. Maximal degree in co-relation 6784. Up to 978 conditions per place. [2024-06-27 19:09:24,726 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 86 selfloop transitions, 56 changer transitions 0/151 dead transitions. [2024-06-27 19:09:24,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 151 transitions, 1570 flow [2024-06-27 19:09:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-06-27 19:09:24,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451388888888888 [2024-06-27 19:09:24,727 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 1050 flow. Second operand 8 states and 157 transitions. [2024-06-27 19:09:24,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 151 transitions, 1570 flow [2024-06-27 19:09:24,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 151 transitions, 1519 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:24,754 INFO L231 Difference]: Finished difference. Result has 121 places, 124 transitions, 1281 flow [2024-06-27 19:09:24,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1281, PETRI_PLACES=121, PETRI_TRANSITIONS=124} [2024-06-27 19:09:24,754 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2024-06-27 19:09:24,755 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 124 transitions, 1281 flow [2024-06-27 19:09:24,755 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-27 19:09:24,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:24,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:24,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 19:09:24,755 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-27 19:09:24,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 452299631, now seen corresponding path program 3 times [2024-06-27 19:09:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:24,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512792883] [2024-06-27 19:09:24,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:25,377 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-27 19:09:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512792883] [2024-06-27 19:09:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512792883] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924298863] [2024-06-27 19:09:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:25,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:25,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:25,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 124 transitions, 1281 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-27 19:09:25,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:25,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:25,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:25,908 INFO L124 PetriNetUnfolderBase]: 762/1574 cut-off events. [2024-06-27 19:09:25,908 INFO L125 PetriNetUnfolderBase]: For 12022/12022 co-relation queries the response was YES. [2024-06-27 19:09:25,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7383 conditions, 1574 events. 762/1574 cut-off events. For 12022/12022 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10436 event pairs, 179 based on Foata normal form. 1/1570 useless extension candidates. Maximal degree in co-relation 7325. Up to 1037 conditions per place. [2024-06-27 19:09:25,919 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 120 selfloop transitions, 37 changer transitions 0/166 dead transitions. [2024-06-27 19:09:25,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 166 transitions, 1828 flow [2024-06-27 19:09:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:09:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:09:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 192 transitions. [2024-06-27 19:09:25,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-27 19:09:25,921 INFO L175 Difference]: Start difference. First operand has 121 places, 124 transitions, 1281 flow. Second operand 10 states and 192 transitions. [2024-06-27 19:09:25,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 166 transitions, 1828 flow [2024-06-27 19:09:25,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 166 transitions, 1700 flow, removed 58 selfloop flow, removed 2 redundant places. [2024-06-27 19:09:25,961 INFO L231 Difference]: Finished difference. Result has 131 places, 129 transitions, 1333 flow [2024-06-27 19:09:25,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1333, PETRI_PLACES=131, PETRI_TRANSITIONS=129} [2024-06-27 19:09:25,961 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 91 predicate places. [2024-06-27 19:09:25,962 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 129 transitions, 1333 flow [2024-06-27 19:09:25,962 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-27 19:09:25,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:25,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:25,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 19:09:25,962 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-27 19:09:25,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:25,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1408699609, now seen corresponding path program 1 times [2024-06-27 19:09:25,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:25,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957615985] [2024-06-27 19:09:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:25,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:26,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-27 19:09:26,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:26,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957615985] [2024-06-27 19:09:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957615985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:26,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273449093] [2024-06-27 19:09:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:26,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:26,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:26,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 129 transitions, 1333 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-27 19:09:26,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:26,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:26,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:26,922 INFO L124 PetriNetUnfolderBase]: 778/1576 cut-off events. [2024-06-27 19:09:26,922 INFO L125 PetriNetUnfolderBase]: For 12673/12673 co-relation queries the response was YES. [2024-06-27 19:09:26,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7515 conditions, 1576 events. 778/1576 cut-off events. For 12673/12673 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10505 event pairs, 208 based on Foata normal form. 2/1570 useless extension candidates. Maximal degree in co-relation 7453. Up to 1216 conditions per place. [2024-06-27 19:09:26,932 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 128 selfloop transitions, 15 changer transitions 0/152 dead transitions. [2024-06-27 19:09:26,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 152 transitions, 1703 flow [2024-06-27 19:09:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:26,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-27 19:09:26,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2024-06-27 19:09:26,947 INFO L175 Difference]: Start difference. First operand has 131 places, 129 transitions, 1333 flow. Second operand 7 states and 130 transitions. [2024-06-27 19:09:26,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 152 transitions, 1703 flow [2024-06-27 19:09:26,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 152 transitions, 1615 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 19:09:26,977 INFO L231 Difference]: Finished difference. Result has 132 places, 130 transitions, 1289 flow [2024-06-27 19:09:26,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1289, PETRI_PLACES=132, PETRI_TRANSITIONS=130} [2024-06-27 19:09:26,978 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-06-27 19:09:26,978 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 130 transitions, 1289 flow [2024-06-27 19:09:26,979 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-27 19:09:26,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:26,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:26,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 19:09:26,979 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-27 19:09:26,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 330473585, now seen corresponding path program 2 times [2024-06-27 19:09:26,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:26,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736760784] [2024-06-27 19:09:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:27,510 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-27 19:09:27,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:27,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736760784] [2024-06-27 19:09:27,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736760784] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:27,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:27,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:27,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903216948] [2024-06-27 19:09:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:27,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:27,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:27,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:27,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:27,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:27,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 130 transitions, 1289 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-27 19:09:27,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:27,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:27,960 INFO L124 PetriNetUnfolderBase]: 810/1577 cut-off events. [2024-06-27 19:09:27,961 INFO L125 PetriNetUnfolderBase]: For 12846/12850 co-relation queries the response was YES. [2024-06-27 19:09:27,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7525 conditions, 1577 events. 810/1577 cut-off events. For 12846/12850 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10166 event pairs, 156 based on Foata normal form. 8/1579 useless extension candidates. Maximal degree in co-relation 7462. Up to 1089 conditions per place. [2024-06-27 19:09:28,002 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 102 selfloop transitions, 43 changer transitions 0/154 dead transitions. [2024-06-27 19:09:28,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 154 transitions, 1679 flow [2024-06-27 19:09:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:28,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:28,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2024-06-27 19:09:28,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5436507936507936 [2024-06-27 19:09:28,004 INFO L175 Difference]: Start difference. First operand has 132 places, 130 transitions, 1289 flow. Second operand 7 states and 137 transitions. [2024-06-27 19:09:28,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 154 transitions, 1679 flow [2024-06-27 19:09:28,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 154 transitions, 1645 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:28,039 INFO L231 Difference]: Finished difference. Result has 134 places, 131 transitions, 1359 flow [2024-06-27 19:09:28,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1359, PETRI_PLACES=134, PETRI_TRANSITIONS=131} [2024-06-27 19:09:28,039 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2024-06-27 19:09:28,039 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 131 transitions, 1359 flow [2024-06-27 19:09:28,040 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-27 19:09:28,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:28,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:28,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 19:09:28,040 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-27 19:09:28,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:28,040 INFO L85 PathProgramCache]: Analyzing trace with hash -527389283, now seen corresponding path program 3 times [2024-06-27 19:09:28,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:28,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448737359] [2024-06-27 19:09:28,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:28,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:28,560 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-27 19:09:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448737359] [2024-06-27 19:09:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448737359] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:28,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:28,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:09:28,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358882851] [2024-06-27 19:09:28,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:28,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:09:28,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:28,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:09:28,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:09:28,647 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:28,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 131 transitions, 1359 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-27 19:09:28,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:28,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:28,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:28,997 INFO L124 PetriNetUnfolderBase]: 816/1574 cut-off events. [2024-06-27 19:09:28,997 INFO L125 PetriNetUnfolderBase]: For 13304/13304 co-relation queries the response was YES. [2024-06-27 19:09:29,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7689 conditions, 1574 events. 816/1574 cut-off events. For 13304/13304 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10176 event pairs, 134 based on Foata normal form. 4/1572 useless extension candidates. Maximal degree in co-relation 7625. Up to 925 conditions per place. [2024-06-27 19:09:29,009 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 114 selfloop transitions, 35 changer transitions 0/158 dead transitions. [2024-06-27 19:09:29,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 158 transitions, 1789 flow [2024-06-27 19:09:29,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-06-27 19:09:29,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-06-27 19:09:29,010 INFO L175 Difference]: Start difference. First operand has 134 places, 131 transitions, 1359 flow. Second operand 7 states and 136 transitions. [2024-06-27 19:09:29,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 158 transitions, 1789 flow [2024-06-27 19:09:29,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 158 transitions, 1699 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:29,046 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 1404 flow [2024-06-27 19:09:29,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1404, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2024-06-27 19:09:29,047 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 97 predicate places. [2024-06-27 19:09:29,047 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 1404 flow [2024-06-27 19:09:29,047 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-27 19:09:29,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:29,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:29,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 19:09:29,048 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-27 19:09:29,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:29,048 INFO L85 PathProgramCache]: Analyzing trace with hash -527204709, now seen corresponding path program 1 times [2024-06-27 19:09:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938262521] [2024-06-27 19:09:29,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:29,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:29,752 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-27 19:09:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:29,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938262521] [2024-06-27 19:09:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938262521] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:29,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:29,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:29,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202120536] [2024-06-27 19:09:29,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:29,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:29,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:29,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:29,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:29,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:29,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 1404 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-27 19:09:29,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:29,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:29,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:30,257 INFO L124 PetriNetUnfolderBase]: 872/1786 cut-off events. [2024-06-27 19:09:30,257 INFO L125 PetriNetUnfolderBase]: For 15884/15886 co-relation queries the response was YES. [2024-06-27 19:09:30,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8362 conditions, 1786 events. 872/1786 cut-off events. For 15884/15886 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12097 event pairs, 207 based on Foata normal form. 10/1789 useless extension candidates. Maximal degree in co-relation 8296. Up to 1127 conditions per place. [2024-06-27 19:09:30,269 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 119 selfloop transitions, 33 changer transitions 0/161 dead transitions. [2024-06-27 19:09:30,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 161 transitions, 1841 flow [2024-06-27 19:09:30,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:09:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:09:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-27 19:09:30,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5674603174603174 [2024-06-27 19:09:30,271 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 1404 flow. Second operand 7 states and 143 transitions. [2024-06-27 19:09:30,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 161 transitions, 1841 flow [2024-06-27 19:09:30,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 161 transitions, 1777 flow, removed 14 selfloop flow, removed 3 redundant places. [2024-06-27 19:09:30,322 INFO L231 Difference]: Finished difference. Result has 142 places, 135 transitions, 1435 flow [2024-06-27 19:09:30,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1435, PETRI_PLACES=142, PETRI_TRANSITIONS=135} [2024-06-27 19:09:30,323 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 102 predicate places. [2024-06-27 19:09:30,323 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 135 transitions, 1435 flow [2024-06-27 19:09:30,323 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-27 19:09:30,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:30,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:30,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 19:09:30,324 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-27 19:09:30,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash 563185313, now seen corresponding path program 2 times [2024-06-27 19:09:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867789423] [2024-06-27 19:09:30,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:30,945 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-27 19:09:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867789423] [2024-06-27 19:09:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867789423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597479493] [2024-06-27 19:09:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:30,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:30,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:31,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:31,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 135 transitions, 1435 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-27 19:09:31,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:31,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:31,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:31,510 INFO L124 PetriNetUnfolderBase]: 1049/2083 cut-off events. [2024-06-27 19:09:31,510 INFO L125 PetriNetUnfolderBase]: For 21792/21796 co-relation queries the response was YES. [2024-06-27 19:09:31,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10010 conditions, 2083 events. 1049/2083 cut-off events. For 21792/21796 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14420 event pairs, 211 based on Foata normal form. 10/2087 useless extension candidates. Maximal degree in co-relation 9941. Up to 1013 conditions per place. [2024-06-27 19:09:31,522 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 106 selfloop transitions, 60 changer transitions 0/175 dead transitions. [2024-06-27 19:09:31,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 175 transitions, 2011 flow [2024-06-27 19:09:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:31,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-27 19:09:31,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-27 19:09:31,523 INFO L175 Difference]: Start difference. First operand has 142 places, 135 transitions, 1435 flow. Second operand 9 states and 180 transitions. [2024-06-27 19:09:31,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 175 transitions, 2011 flow [2024-06-27 19:09:31,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 175 transitions, 1980 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 19:09:31,581 INFO L231 Difference]: Finished difference. Result has 148 places, 135 transitions, 1528 flow [2024-06-27 19:09:31,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1528, PETRI_PLACES=148, PETRI_TRANSITIONS=135} [2024-06-27 19:09:31,582 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 108 predicate places. [2024-06-27 19:09:31,582 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 135 transitions, 1528 flow [2024-06-27 19:09:31,582 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-27 19:09:31,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:31,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:31,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 19:09:31,583 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-27 19:09:31,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:31,583 INFO L85 PathProgramCache]: Analyzing trace with hash 562888643, now seen corresponding path program 3 times [2024-06-27 19:09:31,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:31,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756569163] [2024-06-27 19:09:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:31,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:32,329 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-27 19:09:32,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756569163] [2024-06-27 19:09:32,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756569163] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:32,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:32,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:32,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239329746] [2024-06-27 19:09:32,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:32,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:32,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:32,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:32,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:32,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 135 transitions, 1528 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-27 19:09:32,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:32,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:32,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:32,953 INFO L124 PetriNetUnfolderBase]: 1078/2297 cut-off events. [2024-06-27 19:09:32,953 INFO L125 PetriNetUnfolderBase]: For 21930/21932 co-relation queries the response was YES. [2024-06-27 19:09:32,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10570 conditions, 2297 events. 1078/2297 cut-off events. For 21930/21932 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 16939 event pairs, 354 based on Foata normal form. 10/2302 useless extension candidates. Maximal degree in co-relation 10500. Up to 1550 conditions per place. [2024-06-27 19:09:32,970 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 132 selfloop transitions, 37 changer transitions 0/178 dead transitions. [2024-06-27 19:09:32,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 178 transitions, 2096 flow [2024-06-27 19:09:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:09:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:09:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-06-27 19:09:32,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2024-06-27 19:09:32,972 INFO L175 Difference]: Start difference. First operand has 148 places, 135 transitions, 1528 flow. Second operand 10 states and 194 transitions. [2024-06-27 19:09:32,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 178 transitions, 2096 flow [2024-06-27 19:09:33,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 178 transitions, 1974 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 19:09:33,071 INFO L231 Difference]: Finished difference. Result has 151 places, 138 transitions, 1532 flow [2024-06-27 19:09:33,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1410, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1532, PETRI_PLACES=151, PETRI_TRANSITIONS=138} [2024-06-27 19:09:33,071 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2024-06-27 19:09:33,071 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 138 transitions, 1532 flow [2024-06-27 19:09:33,072 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-27 19:09:33,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:33,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:33,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 19:09:33,072 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-27 19:09:33,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:33,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1623575709, now seen corresponding path program 4 times [2024-06-27 19:09:33,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:33,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119881981] [2024-06-27 19:09:33,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:33,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:33,724 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-27 19:09:33,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:33,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119881981] [2024-06-27 19:09:33,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119881981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:33,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444003902] [2024-06-27 19:09:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:33,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:33,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:33,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:33,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:33,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:33,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 138 transitions, 1532 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-27 19:09:33,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:33,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:33,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:34,227 INFO L124 PetriNetUnfolderBase]: 1050/2201 cut-off events. [2024-06-27 19:09:34,227 INFO L125 PetriNetUnfolderBase]: For 20361/20361 co-relation queries the response was YES. [2024-06-27 19:09:34,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10179 conditions, 2201 events. 1050/2201 cut-off events. For 20361/20361 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15998 event pairs, 308 based on Foata normal form. 8/2204 useless extension candidates. Maximal degree in co-relation 10108. Up to 1509 conditions per place. [2024-06-27 19:09:34,242 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 139 selfloop transitions, 28 changer transitions 0/176 dead transitions. [2024-06-27 19:09:34,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 176 transitions, 2069 flow [2024-06-27 19:09:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 19:09:34,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2024-06-27 19:09:34,244 INFO L175 Difference]: Start difference. First operand has 151 places, 138 transitions, 1532 flow. Second operand 9 states and 172 transitions. [2024-06-27 19:09:34,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 176 transitions, 2069 flow [2024-06-27 19:09:34,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 176 transitions, 1987 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 19:09:34,307 INFO L231 Difference]: Finished difference. Result has 154 places, 140 transitions, 1548 flow [2024-06-27 19:09:34,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1548, PETRI_PLACES=154, PETRI_TRANSITIONS=140} [2024-06-27 19:09:34,307 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 114 predicate places. [2024-06-27 19:09:34,307 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 140 transitions, 1548 flow [2024-06-27 19:09:34,307 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-27 19:09:34,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:34,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:34,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 19:09:34,308 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:09:34,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash 554614433, now seen corresponding path program 5 times [2024-06-27 19:09:34,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:34,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471401830] [2024-06-27 19:09:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:34,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:34,936 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-27 19:09:34,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:34,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471401830] [2024-06-27 19:09:34,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471401830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:34,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:34,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474690940] [2024-06-27 19:09:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:34,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:34,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:34,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:34,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:34,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:34,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 140 transitions, 1548 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-27 19:09:34,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:34,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:34,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:35,472 INFO L124 PetriNetUnfolderBase]: 1083/2280 cut-off events. [2024-06-27 19:09:35,472 INFO L125 PetriNetUnfolderBase]: For 20177/20179 co-relation queries the response was YES. [2024-06-27 19:09:35,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10361 conditions, 2280 events. 1083/2280 cut-off events. For 20177/20179 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 16737 event pairs, 328 based on Foata normal form. 10/2285 useless extension candidates. Maximal degree in co-relation 10288. Up to 1576 conditions per place. [2024-06-27 19:09:35,488 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 135 selfloop transitions, 31 changer transitions 0/175 dead transitions. [2024-06-27 19:09:35,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 175 transitions, 2044 flow [2024-06-27 19:09:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:35,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:35,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-27 19:09:35,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-06-27 19:09:35,489 INFO L175 Difference]: Start difference. First operand has 154 places, 140 transitions, 1548 flow. Second operand 9 states and 174 transitions. [2024-06-27 19:09:35,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 175 transitions, 2044 flow [2024-06-27 19:09:35,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 175 transitions, 1990 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:35,547 INFO L231 Difference]: Finished difference. Result has 158 places, 140 transitions, 1561 flow [2024-06-27 19:09:35,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1561, PETRI_PLACES=158, PETRI_TRANSITIONS=140} [2024-06-27 19:09:35,548 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 118 predicate places. [2024-06-27 19:09:35,548 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 140 transitions, 1561 flow [2024-06-27 19:09:35,548 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-27 19:09:35,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:35,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:35,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 19:09:35,549 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:09:35,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:35,549 INFO L85 PathProgramCache]: Analyzing trace with hash -742958903, now seen corresponding path program 1 times [2024-06-27 19:09:35,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957129525] [2024-06-27 19:09:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:35,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:35,588 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-27 19:09:35,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957129525] [2024-06-27 19:09:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957129525] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:35,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:09:35,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089331220] [2024-06-27 19:09:35,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:35,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:09:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:35,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:09:35,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:09:35,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-06-27 19:09:35,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 140 transitions, 1561 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-27 19:09:35,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:35,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-06-27 19:09:35,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:35,833 INFO L124 PetriNetUnfolderBase]: 786/1969 cut-off events. [2024-06-27 19:09:35,834 INFO L125 PetriNetUnfolderBase]: For 13446/13528 co-relation queries the response was YES. [2024-06-27 19:09:35,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8050 conditions, 1969 events. 786/1969 cut-off events. For 13446/13528 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15397 event pairs, 129 based on Foata normal form. 172/2107 useless extension candidates. Maximal degree in co-relation 7978. Up to 797 conditions per place. [2024-06-27 19:09:35,844 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 63 selfloop transitions, 25 changer transitions 0/118 dead transitions. [2024-06-27 19:09:35,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 118 transitions, 1462 flow [2024-06-27 19:09:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:09:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:09:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2024-06-27 19:09:35,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2024-06-27 19:09:35,846 INFO L175 Difference]: Start difference. First operand has 158 places, 140 transitions, 1561 flow. Second operand 4 states and 100 transitions. [2024-06-27 19:09:35,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 118 transitions, 1462 flow [2024-06-27 19:09:35,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 118 transitions, 1082 flow, removed 16 selfloop flow, removed 41 redundant places. [2024-06-27 19:09:35,882 INFO L231 Difference]: Finished difference. Result has 122 places, 100 transitions, 896 flow [2024-06-27 19:09:35,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=896, PETRI_PLACES=122, PETRI_TRANSITIONS=100} [2024-06-27 19:09:35,882 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 82 predicate places. [2024-06-27 19:09:35,883 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 100 transitions, 896 flow [2024-06-27 19:09:35,883 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-27 19:09:35,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:35,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:35,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 19:09:35,883 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-27 19:09:35,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1910576537, now seen corresponding path program 6 times [2024-06-27 19:09:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:35,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995647756] [2024-06-27 19:09:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:36,547 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-27 19:09:36,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:36,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995647756] [2024-06-27 19:09:36,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995647756] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:36,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:36,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317299634] [2024-06-27 19:09:36,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:36,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:36,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:36,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:36,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:36,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:36,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 100 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-27 19:09:36,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:36,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:36,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:36,998 INFO L124 PetriNetUnfolderBase]: 943/2231 cut-off events. [2024-06-27 19:09:36,999 INFO L125 PetriNetUnfolderBase]: For 14848/14848 co-relation queries the response was YES. [2024-06-27 19:09:37,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8338 conditions, 2231 events. 943/2231 cut-off events. For 14848/14848 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 17157 event pairs, 409 based on Foata normal form. 6/2095 useless extension candidates. Maximal degree in co-relation 8284. Up to 1347 conditions per place. [2024-06-27 19:09:37,012 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 82 selfloop transitions, 39 changer transitions 0/131 dead transitions. [2024-06-27 19:09:37,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 131 transitions, 1334 flow [2024-06-27 19:09:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:37,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 19:09:37,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 19:09:37,014 INFO L175 Difference]: Start difference. First operand has 122 places, 100 transitions, 896 flow. Second operand 9 states and 167 transitions. [2024-06-27 19:09:37,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 131 transitions, 1334 flow [2024-06-27 19:09:37,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 131 transitions, 1300 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 19:09:37,048 INFO L231 Difference]: Finished difference. Result has 128 places, 102 transitions, 959 flow [2024-06-27 19:09:37,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=959, PETRI_PLACES=128, PETRI_TRANSITIONS=102} [2024-06-27 19:09:37,050 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 88 predicate places. [2024-06-27 19:09:37,050 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 102 transitions, 959 flow [2024-06-27 19:09:37,050 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-27 19:09:37,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:37,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:37,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 19:09:37,051 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-27 19:09:37,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:37,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1943245, now seen corresponding path program 7 times [2024-06-27 19:09:37,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:37,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117645642] [2024-06-27 19:09:37,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:37,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:37,627 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-27 19:09:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117645642] [2024-06-27 19:09:37,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117645642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:37,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:37,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:37,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970717971] [2024-06-27 19:09:37,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:37,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:37,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:37,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:37,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:37,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:37,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 102 transitions, 959 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-27 19:09:37,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:37,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:37,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:38,188 INFO L124 PetriNetUnfolderBase]: 1081/2577 cut-off events. [2024-06-27 19:09:38,189 INFO L125 PetriNetUnfolderBase]: For 19834/19834 co-relation queries the response was YES. [2024-06-27 19:09:38,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9815 conditions, 2577 events. 1081/2577 cut-off events. For 19834/19834 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 20690 event pairs, 527 based on Foata normal form. 6/2424 useless extension candidates. Maximal degree in co-relation 9760. Up to 1555 conditions per place. [2024-06-27 19:09:38,202 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 91 selfloop transitions, 30 changer transitions 0/131 dead transitions. [2024-06-27 19:09:38,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 131 transitions, 1383 flow [2024-06-27 19:09:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 19:09:38,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-06-27 19:09:38,204 INFO L175 Difference]: Start difference. First operand has 128 places, 102 transitions, 959 flow. Second operand 9 states and 167 transitions. [2024-06-27 19:09:38,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 131 transitions, 1383 flow [2024-06-27 19:09:38,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 131 transitions, 1329 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 19:09:38,246 INFO L231 Difference]: Finished difference. Result has 132 places, 102 transitions, 968 flow [2024-06-27 19:09:38,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=968, PETRI_PLACES=132, PETRI_TRANSITIONS=102} [2024-06-27 19:09:38,246 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 92 predicate places. [2024-06-27 19:09:38,247 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 102 transitions, 968 flow [2024-06-27 19:09:38,247 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-27 19:09:38,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:38,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:38,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 19:09:38,247 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-27 19:09:38,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:38,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1136388113, now seen corresponding path program 8 times [2024-06-27 19:09:38,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:38,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585594253] [2024-06-27 19:09:38,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:38,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:38,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-27 19:09:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:38,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585594253] [2024-06-27 19:09:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585594253] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123781644] [2024-06-27 19:09:38,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:38,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:38,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:38,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:38,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:38,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 102 transitions, 968 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-27 19:09:38,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:38,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:38,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:39,293 INFO L124 PetriNetUnfolderBase]: 1071/2562 cut-off events. [2024-06-27 19:09:39,293 INFO L125 PetriNetUnfolderBase]: For 18389/18389 co-relation queries the response was YES. [2024-06-27 19:09:39,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9524 conditions, 2562 events. 1071/2562 cut-off events. For 18389/18389 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 20659 event pairs, 568 based on Foata normal form. 8/2408 useless extension candidates. Maximal degree in co-relation 9469. Up to 1747 conditions per place. [2024-06-27 19:09:39,310 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 75 selfloop transitions, 39 changer transitions 0/124 dead transitions. [2024-06-27 19:09:39,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 124 transitions, 1288 flow [2024-06-27 19:09:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 160 transitions. [2024-06-27 19:09:39,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2024-06-27 19:09:39,312 INFO L175 Difference]: Start difference. First operand has 132 places, 102 transitions, 968 flow. Second operand 9 states and 160 transitions. [2024-06-27 19:09:39,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 124 transitions, 1288 flow [2024-06-27 19:09:39,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 124 transitions, 1215 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 19:09:39,355 INFO L231 Difference]: Finished difference. Result has 134 places, 102 transitions, 977 flow [2024-06-27 19:09:39,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=977, PETRI_PLACES=134, PETRI_TRANSITIONS=102} [2024-06-27 19:09:39,357 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 94 predicate places. [2024-06-27 19:09:39,357 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 102 transitions, 977 flow [2024-06-27 19:09:39,357 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-27 19:09:39,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:39,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:39,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 19:09:39,358 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-27 19:09:39,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1478983373, now seen corresponding path program 9 times [2024-06-27 19:09:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:39,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727078733] [2024-06-27 19:09:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:40,158 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-27 19:09:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727078733] [2024-06-27 19:09:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727078733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:40,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:40,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126294429] [2024-06-27 19:09:40,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:40,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:40,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:40,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:40,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:40,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 102 transitions, 977 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-27 19:09:40,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:40,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:40,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:40,632 INFO L124 PetriNetUnfolderBase]: 1068/2568 cut-off events. [2024-06-27 19:09:40,633 INFO L125 PetriNetUnfolderBase]: For 17026/17026 co-relation queries the response was YES. [2024-06-27 19:09:40,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9442 conditions, 2568 events. 1068/2568 cut-off events. For 17026/17026 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 20643 event pairs, 510 based on Foata normal form. 6/2424 useless extension candidates. Maximal degree in co-relation 9386. Up to 1299 conditions per place. [2024-06-27 19:09:40,648 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 93 selfloop transitions, 34 changer transitions 0/137 dead transitions. [2024-06-27 19:09:40,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 137 transitions, 1445 flow [2024-06-27 19:09:40,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:40,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:40,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 19:09:40,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5216049382716049 [2024-06-27 19:09:40,651 INFO L175 Difference]: Start difference. First operand has 134 places, 102 transitions, 977 flow. Second operand 9 states and 169 transitions. [2024-06-27 19:09:40,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 137 transitions, 1445 flow [2024-06-27 19:09:40,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 137 transitions, 1368 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 19:09:40,696 INFO L231 Difference]: Finished difference. Result has 136 places, 102 transitions, 971 flow [2024-06-27 19:09:40,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=971, PETRI_PLACES=136, PETRI_TRANSITIONS=102} [2024-06-27 19:09:40,696 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 96 predicate places. [2024-06-27 19:09:40,697 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 102 transitions, 971 flow [2024-06-27 19:09:40,697 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-27 19:09:40,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:40,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:40,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 19:09:40,697 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-27 19:09:40,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:40,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1646575, now seen corresponding path program 10 times [2024-06-27 19:09:40,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:40,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578049849] [2024-06-27 19:09:40,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:40,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:41,459 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-27 19:09:41,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578049849] [2024-06-27 19:09:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578049849] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:41,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:41,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:41,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428656417] [2024-06-27 19:09:41,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:41,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:41,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:41,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:41,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:41,532 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:41,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 102 transitions, 971 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-27 19:09:41,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:41,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:41,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:42,001 INFO L124 PetriNetUnfolderBase]: 1102/2658 cut-off events. [2024-06-27 19:09:42,002 INFO L125 PetriNetUnfolderBase]: For 18024/18024 co-relation queries the response was YES. [2024-06-27 19:09:42,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9670 conditions, 2658 events. 1102/2658 cut-off events. For 18024/18024 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21703 event pairs, 590 based on Foata normal form. 8/2500 useless extension candidates. Maximal degree in co-relation 9613. Up to 1839 conditions per place. [2024-06-27 19:09:42,017 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 86 selfloop transitions, 30 changer transitions 0/126 dead transitions. [2024-06-27 19:09:42,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 126 transitions, 1301 flow [2024-06-27 19:09:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:09:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:09:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 19:09:42,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49166666666666664 [2024-06-27 19:09:42,019 INFO L175 Difference]: Start difference. First operand has 136 places, 102 transitions, 971 flow. Second operand 10 states and 177 transitions. [2024-06-27 19:09:42,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 126 transitions, 1301 flow [2024-06-27 19:09:42,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 126 transitions, 1234 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 19:09:42,064 INFO L231 Difference]: Finished difference. Result has 139 places, 102 transitions, 971 flow [2024-06-27 19:09:42,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=971, PETRI_PLACES=139, PETRI_TRANSITIONS=102} [2024-06-27 19:09:42,064 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-06-27 19:09:42,065 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 102 transitions, 971 flow [2024-06-27 19:09:42,065 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-27 19:09:42,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:42,065 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-27 19:09:42,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 19:09:42,065 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-27 19:09:42,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1407541138, now seen corresponding path program 1 times [2024-06-27 19:09:42,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:42,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606217054] [2024-06-27 19:09:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:42,604 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-27 19:09:42,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:42,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606217054] [2024-06-27 19:09:42,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606217054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:42,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:42,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484850968] [2024-06-27 19:09:42,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:42,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:42,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:42,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:42,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:42,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 102 transitions, 971 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-27 19:09:42,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:42,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:42,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:43,099 INFO L124 PetriNetUnfolderBase]: 1078/2587 cut-off events. [2024-06-27 19:09:43,100 INFO L125 PetriNetUnfolderBase]: For 14743/14743 co-relation queries the response was YES. [2024-06-27 19:09:43,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9342 conditions, 2587 events. 1078/2587 cut-off events. For 14743/14743 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 20887 event pairs, 516 based on Foata normal form. 6/2443 useless extension candidates. Maximal degree in co-relation 9284. Up to 1828 conditions per place. [2024-06-27 19:09:43,115 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 109 selfloop transitions, 13 changer transitions 0/132 dead transitions. [2024-06-27 19:09:43,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 132 transitions, 1323 flow [2024-06-27 19:09:43,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:43,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 19:09:43,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-06-27 19:09:43,116 INFO L175 Difference]: Start difference. First operand has 139 places, 102 transitions, 971 flow. Second operand 8 states and 147 transitions. [2024-06-27 19:09:43,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 132 transitions, 1323 flow [2024-06-27 19:09:43,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 132 transitions, 1253 flow, removed 1 selfloop flow, removed 9 redundant places. [2024-06-27 19:09:43,155 INFO L231 Difference]: Finished difference. Result has 138 places, 102 transitions, 931 flow [2024-06-27 19:09:43,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=901, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=931, PETRI_PLACES=138, PETRI_TRANSITIONS=102} [2024-06-27 19:09:43,155 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 98 predicate places. [2024-06-27 19:09:43,156 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 102 transitions, 931 flow [2024-06-27 19:09:43,156 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-27 19:09:43,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:43,156 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-27 19:09:43,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 19:09:43,156 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:09:43,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:43,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1649241422, now seen corresponding path program 2 times [2024-06-27 19:09:43,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:43,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520825528] [2024-06-27 19:09:43,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:43,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:43,892 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-27 19:09:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:43,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520825528] [2024-06-27 19:09:43,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520825528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:43,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:43,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:09:43,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252066229] [2024-06-27 19:09:43,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:43,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:09:43,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:43,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:09:43,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:09:43,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-06-27 19:09:43,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 102 transitions, 931 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-27 19:09:43,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:43,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-06-27 19:09:43,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:44,409 INFO L124 PetriNetUnfolderBase]: 1071/2574 cut-off events. [2024-06-27 19:09:44,409 INFO L125 PetriNetUnfolderBase]: For 12016/12016 co-relation queries the response was YES. [2024-06-27 19:09:44,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9042 conditions, 2574 events. 1071/2574 cut-off events. For 12016/12016 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 20889 event pairs, 506 based on Foata normal form. 6/2425 useless extension candidates. Maximal degree in co-relation 8983. Up to 1629 conditions per place. [2024-06-27 19:09:44,421 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 91 selfloop transitions, 27 changer transitions 0/128 dead transitions. [2024-06-27 19:09:44,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 128 transitions, 1197 flow [2024-06-27 19:09:44,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:09:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:09:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 19:09:44,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-06-27 19:09:44,423 INFO L175 Difference]: Start difference. First operand has 138 places, 102 transitions, 931 flow. Second operand 8 states and 148 transitions. [2024-06-27 19:09:44,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 128 transitions, 1197 flow [2024-06-27 19:09:44,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 128 transitions, 995 flow, removed 16 selfloop flow, removed 32 redundant places. [2024-06-27 19:09:44,447 INFO L231 Difference]: Finished difference. Result has 112 places, 101 transitions, 717 flow [2024-06-27 19:09:44,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=717, PETRI_PLACES=112, PETRI_TRANSITIONS=101} [2024-06-27 19:09:44,447 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 72 predicate places. [2024-06-27 19:09:44,447 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 101 transitions, 717 flow [2024-06-27 19:09:44,448 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-27 19:09:44,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:44,448 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] [2024-06-27 19:09:44,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 19:09:44,448 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-27 19:09:44,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash -451003817, now seen corresponding path program 1 times [2024-06-27 19:09:44,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:44,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979870223] [2024-06-27 19:09:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:44,527 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-27 19:09:44,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:44,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979870223] [2024-06-27 19:09:44,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979870223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:44,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:44,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:09:44,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511239833] [2024-06-27 19:09:44,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:44,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:09:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:09:44,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:09:44,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-27 19:09:44,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 101 transitions, 717 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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-27 19:09:44,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:44,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-27 19:09:44,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:44,785 INFO L124 PetriNetUnfolderBase]: 965/2316 cut-off events. [2024-06-27 19:09:44,785 INFO L125 PetriNetUnfolderBase]: For 2940/2942 co-relation queries the response was YES. [2024-06-27 19:09:44,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6551 conditions, 2316 events. 965/2316 cut-off events. For 2940/2942 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18854 event pairs, 390 based on Foata normal form. 1/2148 useless extension candidates. Maximal degree in co-relation 6521. Up to 1001 conditions per place. [2024-06-27 19:09:44,795 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 51 selfloop transitions, 19 changer transitions 56/157 dead transitions. [2024-06-27 19:09:44,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 157 transitions, 1191 flow [2024-06-27 19:09:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:09:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:09:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 192 transitions. [2024-06-27 19:09:44,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-06-27 19:09:44,796 INFO L175 Difference]: Start difference. First operand has 112 places, 101 transitions, 717 flow. Second operand 9 states and 192 transitions. [2024-06-27 19:09:44,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 157 transitions, 1191 flow [2024-06-27 19:09:44,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 157 transitions, 1116 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 19:09:44,807 INFO L231 Difference]: Finished difference. Result has 118 places, 89 transitions, 622 flow [2024-06-27 19:09:44,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=622, PETRI_PLACES=118, PETRI_TRANSITIONS=89} [2024-06-27 19:09:44,810 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 78 predicate places. [2024-06-27 19:09:44,811 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 89 transitions, 622 flow [2024-06-27 19:09:44,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 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-27 19:09:44,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:44,815 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-27 19:09:44,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 19:09:44,816 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-27 19:09:44,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:44,816 INFO L85 PathProgramCache]: Analyzing trace with hash -73260887, now seen corresponding path program 1 times [2024-06-27 19:09:44,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:44,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006806135] [2024-06-27 19:09:44,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:44,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:44,884 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-27 19:09:44,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:44,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006806135] [2024-06-27 19:09:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006806135] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:44,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:44,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:09:44,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257318876] [2024-06-27 19:09:44,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:44,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:09:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:44,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:09:44,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:09:44,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-06-27 19:09:44,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 89 transitions, 622 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-27 19:09:44,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:44,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-06-27 19:09:44,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:45,033 INFO L124 PetriNetUnfolderBase]: 567/1488 cut-off events. [2024-06-27 19:09:45,034 INFO L125 PetriNetUnfolderBase]: For 2308/2317 co-relation queries the response was YES. [2024-06-27 19:09:45,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4700 conditions, 1488 events. 567/1488 cut-off events. For 2308/2317 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 10867 event pairs, 112 based on Foata normal form. 104/1562 useless extension candidates. Maximal degree in co-relation 4667. Up to 390 conditions per place. [2024-06-27 19:09:45,039 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 38 selfloop transitions, 21 changer transitions 14/95 dead transitions. [2024-06-27 19:09:45,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 95 transitions, 763 flow [2024-06-27 19:09:45,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:09:45,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:09:45,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-06-27 19:09:45,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2024-06-27 19:09:45,040 INFO L175 Difference]: Start difference. First operand has 118 places, 89 transitions, 622 flow. Second operand 5 states and 115 transitions. [2024-06-27 19:09:45,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 95 transitions, 763 flow [2024-06-27 19:09:45,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 95 transitions, 645 flow, removed 5 selfloop flow, removed 20 redundant places. [2024-06-27 19:09:45,050 INFO L231 Difference]: Finished difference. Result has 97 places, 75 transitions, 491 flow [2024-06-27 19:09:45,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=97, PETRI_TRANSITIONS=75} [2024-06-27 19:09:45,051 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-06-27 19:09:45,051 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 75 transitions, 491 flow [2024-06-27 19:09:45,051 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-27 19:09:45,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:45,052 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-27 19:09:45,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 19:09:45,052 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:09:45,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash -825966932, now seen corresponding path program 1 times [2024-06-27 19:09:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:45,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221460134] [2024-06-27 19:09:45,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:09:45,130 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-27 19:09:45,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:09:45,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221460134] [2024-06-27 19:09:45,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221460134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:09:45,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:09:45,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:09:45,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466035661] [2024-06-27 19:09:45,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:09:45,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:09:45,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:09:45,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:09:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:09:45,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-06-27 19:09:45,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 75 transitions, 491 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-27 19:09:45,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:09:45,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-06-27 19:09:45,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:09:45,254 INFO L124 PetriNetUnfolderBase]: 381/1032 cut-off events. [2024-06-27 19:09:45,255 INFO L125 PetriNetUnfolderBase]: For 1398/1398 co-relation queries the response was YES. [2024-06-27 19:09:45,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3079 conditions, 1032 events. 381/1032 cut-off events. For 1398/1398 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6908 event pairs, 226 based on Foata normal form. 0/947 useless extension candidates. Maximal degree in co-relation 3055. Up to 472 conditions per place. [2024-06-27 19:09:45,258 INFO L140 encePairwiseOnDemand]: 30/36 looper letters, 26 selfloop transitions, 4 changer transitions 38/89 dead transitions. [2024-06-27 19:09:45,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 89 transitions, 651 flow [2024-06-27 19:09:45,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:09:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:09:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-06-27 19:09:45,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2024-06-27 19:09:45,259 INFO L175 Difference]: Start difference. First operand has 97 places, 75 transitions, 491 flow. Second operand 6 states and 121 transitions. [2024-06-27 19:09:45,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 89 transitions, 651 flow [2024-06-27 19:09:45,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 89 transitions, 525 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 19:09:45,265 INFO L231 Difference]: Finished difference. Result has 89 places, 49 transitions, 245 flow [2024-06-27 19:09:45,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=89, PETRI_TRANSITIONS=49} [2024-06-27 19:09:45,266 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 49 predicate places. [2024-06-27 19:09:45,266 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 49 transitions, 245 flow [2024-06-27 19:09:45,266 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-27 19:09:45,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:09:45,266 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-27 19:09:45,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 19:09:45,266 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:09:45,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:09:45,267 INFO L85 PathProgramCache]: Analyzing trace with hash 421926606, now seen corresponding path program 2 times [2024-06-27 19:09:45,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:09:45,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3109487] [2024-06-27 19:09:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:09:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:09:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:09:45,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 19:09:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:09:45,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 19:09:45,336 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 19:09:45,337 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 19:09:45,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 19:09:45,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 19:09:45,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 19:09:45,342 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 19:09:45,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 19:09:45,343 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 19:09:45,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 19:09:45,343 INFO L445 BasicCegarLoop]: Path program histogram: [10, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:09:45,349 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 19:09:45,349 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 19:09:45,419 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 19:09:45,420 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 19:09:45,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 07:09:45 BasicIcfg [2024-06-27 19:09:45,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 19:09:45,421 INFO L158 Benchmark]: Toolchain (without parser) took 40578.02ms. Allocated memory was 155.2MB in the beginning and 853.5MB in the end (delta: 698.4MB). Free memory was 117.8MB in the beginning and 812.4MB in the end (delta: -694.6MB). Peak memory consumption was 508.8MB. Max. memory is 16.1GB. [2024-06-27 19:09:45,421 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:09:45,421 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:09:45,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.94ms. Allocated memory is still 155.2MB. Free memory was 117.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-27 19:09:45,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 83.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 19:09:45,422 INFO L158 Benchmark]: Boogie Preprocessor took 114.76ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 124.7MB in the end (delta: -41.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 19:09:45,422 INFO L158 Benchmark]: RCFGBuilder took 625.84ms. Allocated memory is still 155.2MB. Free memory was 124.7MB in the beginning and 81.7MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-06-27 19:09:45,422 INFO L158 Benchmark]: TraceAbstraction took 39229.94ms. Allocated memory was 155.2MB in the beginning and 853.5MB in the end (delta: 698.4MB). Free memory was 80.7MB in the beginning and 812.4MB in the end (delta: -731.8MB). Peak memory consumption was 474.1MB. Max. memory is 16.1GB. [2024-06-27 19:09:45,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 76.6MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.94ms. Allocated memory is still 155.2MB. Free memory was 117.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 155.2MB. Free memory was 86.0MB in the beginning and 83.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.76ms. Allocated memory is still 155.2MB. Free memory was 83.0MB in the beginning and 124.7MB in the end (delta: -41.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 625.84ms. Allocated memory is still 155.2MB. Free memory was 124.7MB in the beginning and 81.7MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 39229.94ms. Allocated memory was 155.2MB in the beginning and 853.5MB in the end (delta: 698.4MB). Free memory was 80.7MB in the beginning and 812.4MB in the end (delta: -731.8MB). Peak memory consumption was 474.1MB. 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, arg={0: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 || (x$read_delayed == (_Bool) 0)) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (x$flush_delayed == (_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, 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=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}, 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}, 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] [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=0, 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=0, 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=0, 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=0, 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] [L807] 0 //@ assert ((((((((((((((!multithreaded || (x$read_delayed == (_Bool) 0)) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || ((x == 0) || (x == 1)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1)))) && (!multithreaded || ((x$mem_tmp == 0) || (x$mem_tmp == 1)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 1)))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2561=-1, t2562=0, weak$$choice0=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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.1s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 17.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2595 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2156 mSDsluCounter, 1523 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1297 mSDsCounter, 476 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12046 IncrementalHoareTripleChecker+Invalid, 12522 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 476 mSolverCounterUnsat, 226 mSDtfsCounter, 12046 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1561occurred in iteration=33, InterpolantAutomatonStates: 321, 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, 20.3s InterpolantComputationTime, 693 NumberOfCodeBlocks, 693 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 623 ConstructedInterpolants, 0 QuantifiedInterpolants, 21065 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 44 InterpolantComputations, 44 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-27 19:09:45,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE