./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_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/safe029_power.opt_pso.opt_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/safe029_power.opt_pso.opt_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/protection/safe029_power.opt_pso.opt_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:08:07,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 19:08:07,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 19:08:07,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 19:08:07,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 19:08:07,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 19:08:07,956 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 19:08:07,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 19:08:07,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 19:08:07,957 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 19:08:07,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 19:08:07,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 19:08:07,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 19:08:07,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 19:08:07,959 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 19:08:07,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 19:08:07,959 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 19:08:07,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 19:08:07,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 19:08:07,960 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 19:08:07,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 19:08:07,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 19:08:07,961 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 19:08:07,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 19:08:07,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 19:08:07,962 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 19:08:07,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 19:08:07,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 19:08:07,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 19:08:07,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 19:08:07,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 19:08:07,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 19:08:07,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:08:07,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 19:08:07,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 19:08:07,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 19:08:07,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 19:08:07,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 19:08:07,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 19:08:07,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 19:08:07,976 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 19:08:07,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 19:08:07,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 19:08:07,977 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:08:08,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 19:08:08,244 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 19:08:08,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 19:08:08,247 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 19:08:08,247 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 19:08:08,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-27 19:08:09,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 19:08:09,367 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 19:08:09,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-06-27 19:08:09,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7a8782b/9ec50a27af1240b3aa149d42a6bc680e/FLAGa06e1bbf5 [2024-06-27 19:08:09,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7a8782b/9ec50a27af1240b3aa149d42a6bc680e [2024-06-27 19:08:09,390 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 19:08:09,391 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 19:08:09,391 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/safe029_power.opt_pso.opt_rmo.opt.yml/witness.yml [2024-06-27 19:08:09,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 19:08:09,560 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 19:08:09,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 19:08:09,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 19:08:09,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 19:08:09,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:08:09" (1/2) ... [2024-06-27 19:08:09,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f12bafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:08:09, skipping insertion in model container [2024-06-27 19:08:09,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:08:09" (1/2) ... [2024-06-27 19:08:09,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23793adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:08:09, skipping insertion in model container [2024-06-27 19:08:09,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:08:09" (2/2) ... [2024-06-27 19:08:09,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f12bafd and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:09, skipping insertion in model container [2024-06-27 19:08:09,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:08:09" (2/2) ... [2024-06-27 19:08:09,568 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 19:08:09,614 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 19:08:09,615 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] ((((((((((((! multithreaded || x$r_buff0_thd1 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-06-27 19:08:09,615 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] ((((((((((((! multithreaded || x$r_buff0_thd1 == (_Bool)0) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || x$flush_delayed == (_Bool)0)) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0) [2024-06-27 19:08:09,615 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 19:08:09,615 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-27 19:08:09,649 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 19:08:09,800 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] [2024-06-27 19:08:09,951 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:08:09,967 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 19:08:10,000 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/safe029_power.opt_pso.opt_rmo.opt.i[967,980] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 19:08:10,085 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:08:10,161 INFO L206 MainTranslator]: Completed translation [2024-06-27 19:08:10,171 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10 WrapperNode [2024-06-27 19:08:10,172 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 19:08:10,173 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 19:08:10,173 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 19:08:10,173 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 19:08:10,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,257 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-06-27 19:08:10,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 19:08:10,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 19:08:10,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 19:08:10,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 19:08:10,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,332 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:08:10,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 19:08:10,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 19:08:10,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 19:08:10,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 19:08:10,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (1/1) ... [2024-06-27 19:08:10,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:08:10,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:08:10,420 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:08:10,422 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:08:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 19:08:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 19:08:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 19:08:10,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 19:08:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 19:08:10,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 19:08:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 19:08:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 19:08:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 19:08:10,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 19:08:10,456 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:08:10,563 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 19:08:10,565 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 19:08:10,824 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 19:08:10,824 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 19:08:10,945 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 19:08:10,945 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 19:08:10,945 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:08:10 BoogieIcfgContainer [2024-06-27 19:08:10,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 19:08:10,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 19:08:10,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 19:08:10,949 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 19:08:10,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 07:08:09" (1/4) ... [2024-06-27 19:08:10,950 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f21f18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:08:10, skipping insertion in model container [2024-06-27 19:08:10,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:08:09" (2/4) ... [2024-06-27 19:08:10,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f21f18f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:08:10, skipping insertion in model container [2024-06-27 19:08:10,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:08:10" (3/4) ... [2024-06-27 19:08:10,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f21f18f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:08:10, skipping insertion in model container [2024-06-27 19:08:10,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:08:10" (4/4) ... [2024-06-27 19:08:10,952 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-06-27 19:08:10,965 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 19:08:10,966 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 19:08:10,966 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 19:08:10,995 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 19:08:11,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 19:08:11,039 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 19:08:11,039 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:08:11,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-06-27 19:08:11,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 19:08:11,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-27 19:08:11,052 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 19:08:11,057 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;@5ebf8c1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 19:08:11,057 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 19:08:11,061 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 19:08:11,062 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 19:08:11,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:08:11,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:11,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 19:08:11,063 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:08:11,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 302383596, now seen corresponding path program 1 times [2024-06-27 19:08:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433463481] [2024-06-27 19:08:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:11,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:11,693 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:08:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433463481] [2024-06-27 19:08:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433463481] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:11,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:11,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:08:11,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156640609] [2024-06-27 19:08:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:11,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:08:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:08:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:08:11,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:11,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:11,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:11,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:11,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:11,989 INFO L124 PetriNetUnfolderBase]: 543/1033 cut-off events. [2024-06-27 19:08:11,989 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 19:08:11,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 1033 events. 543/1033 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5477 event pairs, 424 based on Foata normal form. 43/979 useless extension candidates. Maximal degree in co-relation 1942. Up to 892 conditions per place. [2024-06-27 19:08:11,996 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-27 19:08:11,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 169 flow [2024-06-27 19:08:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:08:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:08:12,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-27 19:08:12,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 19:08:12,006 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 70 transitions. [2024-06-27 19:08:12,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 169 flow [2024-06-27 19:08:12,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:12,010 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 96 flow [2024-06-27 19:08:12,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2024-06-27 19:08:12,014 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-27 19:08:12,014 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 96 flow [2024-06-27 19:08:12,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:08:12,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:12,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:12,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 19:08:12,015 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:08:12,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1466614967, now seen corresponding path program 1 times [2024-06-27 19:08:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292375910] [2024-06-27 19:08:12,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:12,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:12,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292375910] [2024-06-27 19:08:12,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292375910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:12,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:12,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:08:12,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43924380] [2024-06-27 19:08:12,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:12,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:08:12,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:12,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:08:12,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:08:12,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:12,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:08:12,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:12,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:12,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:12,441 INFO L124 PetriNetUnfolderBase]: 539/907 cut-off events. [2024-06-27 19:08:12,442 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-06-27 19:08:12,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 907 events. 539/907 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4304 event pairs, 213 based on Foata normal form. 2/859 useless extension candidates. Maximal degree in co-relation 2028. Up to 867 conditions per place. [2024-06-27 19:08:12,448 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 41 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-27 19:08:12,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 242 flow [2024-06-27 19:08:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:08:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:08:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-06-27 19:08:12,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-06-27 19:08:12,451 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 96 flow. Second operand 4 states and 90 transitions. [2024-06-27 19:08:12,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 242 flow [2024-06-27 19:08:12,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 56 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:08:12,454 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 130 flow [2024-06-27 19:08:12,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-06-27 19:08:12,455 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-06-27 19:08:12,455 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 130 flow [2024-06-27 19:08:12,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 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:08:12,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:12,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:12,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 19:08:12,456 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:12,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1779577443, now seen corresponding path program 1 times [2024-06-27 19:08:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:12,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86941478] [2024-06-27 19:08:12,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:12,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:12,734 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:08:12,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:12,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86941478] [2024-06-27 19:08:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86941478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:12,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:08:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142053887] [2024-06-27 19:08:12,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:12,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:08:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:08:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:08:12,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:12,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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:08:12,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:12,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:12,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:12,910 INFO L124 PetriNetUnfolderBase]: 531/1015 cut-off events. [2024-06-27 19:08:12,910 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2024-06-27 19:08:12,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2326 conditions, 1015 events. 531/1015 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5408 event pairs, 173 based on Foata normal form. 4/931 useless extension candidates. Maximal degree in co-relation 2312. Up to 838 conditions per place. [2024-06-27 19:08:12,915 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 48 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-27 19:08:12,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 69 transitions, 354 flow [2024-06-27 19:08:12,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:08:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:08:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-06-27 19:08:12,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2024-06-27 19:08:12,916 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 130 flow. Second operand 5 states and 107 transitions. [2024-06-27 19:08:12,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 69 transitions, 354 flow [2024-06-27 19:08:12,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 328 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:12,919 INFO L231 Difference]: Finished difference. Result has 48 places, 50 transitions, 227 flow [2024-06-27 19:08:12,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=48, PETRI_TRANSITIONS=50} [2024-06-27 19:08:12,920 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-27 19:08:12,920 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 227 flow [2024-06-27 19:08:12,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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:08:12,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:12,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:12,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 19:08:12,921 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:12,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:12,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1763624040, now seen corresponding path program 1 times [2024-06-27 19:08:12,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:12,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414582637] [2024-06-27 19:08:12,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:12,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:12,969 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:08:12,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:12,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414582637] [2024-06-27 19:08:12,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414582637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:12,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:12,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:08:12,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392446286] [2024-06-27 19:08:12,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:12,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:08:12,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:12,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:08:12,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:08:12,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-27 19:08:12,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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:08:12,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:12,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-27 19:08:12,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:13,047 INFO L124 PetriNetUnfolderBase]: 185/485 cut-off events. [2024-06-27 19:08:13,047 INFO L125 PetriNetUnfolderBase]: For 266/292 co-relation queries the response was YES. [2024-06-27 19:08:13,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 485 events. 185/485 cut-off events. For 266/292 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2887 event pairs, 80 based on Foata normal form. 10/462 useless extension candidates. Maximal degree in co-relation 1045. Up to 286 conditions per place. [2024-06-27 19:08:13,050 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 25 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-27 19:08:13,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 266 flow [2024-06-27 19:08:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:08:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:08:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-27 19:08:13,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2024-06-27 19:08:13,051 INFO L175 Difference]: Start difference. First operand has 48 places, 50 transitions, 227 flow. Second operand 3 states and 76 transitions. [2024-06-27 19:08:13,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 266 flow [2024-06-27 19:08:13,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 262 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 19:08:13,053 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 194 flow [2024-06-27 19:08:13,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-27 19:08:13,054 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2024-06-27 19:08:13,054 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 194 flow [2024-06-27 19:08:13,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 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:08:13,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:13,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:13,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 19:08:13,055 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:08:13,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:13,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1293255526, now seen corresponding path program 1 times [2024-06-27 19:08:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:13,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227953707] [2024-06-27 19:08:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:13,574 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:08:13,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227953707] [2024-06-27 19:08:13,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227953707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:13,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:13,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659992804] [2024-06-27 19:08:13,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:13,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:13,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:13,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:13,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 19:08:13,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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:08:13,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:13,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 19:08:13,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:13,801 INFO L124 PetriNetUnfolderBase]: 449/863 cut-off events. [2024-06-27 19:08:13,802 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2024-06-27 19:08:13,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 863 events. 449/863 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4372 event pairs, 96 based on Foata normal form. 4/830 useless extension candidates. Maximal degree in co-relation 2105. Up to 678 conditions per place. [2024-06-27 19:08:13,806 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 47 selfloop transitions, 12 changer transitions 1/68 dead transitions. [2024-06-27 19:08:13,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 372 flow [2024-06-27 19:08:13,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:13,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-27 19:08:13,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2024-06-27 19:08:13,808 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 194 flow. Second operand 6 states and 118 transitions. [2024-06-27 19:08:13,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 372 flow [2024-06-27 19:08:13,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 68 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:13,811 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 215 flow [2024-06-27 19:08:13,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-06-27 19:08:13,812 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 13 predicate places. [2024-06-27 19:08:13,812 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 215 flow [2024-06-27 19:08:13,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 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:08:13,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:13,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:13,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 19:08:13,813 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:08:13,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1670383745, now seen corresponding path program 1 times [2024-06-27 19:08:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:13,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606117534] [2024-06-27 19:08:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:14,098 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:08:14,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:14,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606117534] [2024-06-27 19:08:14,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606117534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:14,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:08:14,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337302664] [2024-06-27 19:08:14,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:14,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:08:14,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:14,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:08:14,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:08:14,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:14,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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:08:14,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:14,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:14,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:14,280 INFO L124 PetriNetUnfolderBase]: 452/867 cut-off events. [2024-06-27 19:08:14,280 INFO L125 PetriNetUnfolderBase]: For 769/769 co-relation queries the response was YES. [2024-06-27 19:08:14,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 867 events. 452/867 cut-off events. For 769/769 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4262 event pairs, 186 based on Foata normal form. 1/831 useless extension candidates. Maximal degree in co-relation 2215. Up to 738 conditions per place. [2024-06-27 19:08:14,284 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 48 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2024-06-27 19:08:14,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 384 flow [2024-06-27 19:08:14,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:08:14,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:08:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-27 19:08:14,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46285714285714286 [2024-06-27 19:08:14,286 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 215 flow. Second operand 5 states and 81 transitions. [2024-06-27 19:08:14,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 384 flow [2024-06-27 19:08:14,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 351 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:14,288 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 244 flow [2024-06-27 19:08:14,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2024-06-27 19:08:14,289 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2024-06-27 19:08:14,289 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 244 flow [2024-06-27 19:08:14,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 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:08:14,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:14,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:14,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 19:08:14,290 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:08:14,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash -242287912, now seen corresponding path program 1 times [2024-06-27 19:08:14,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:14,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455013736] [2024-06-27 19:08:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:14,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:14,629 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:08:14,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:14,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455013736] [2024-06-27 19:08:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455013736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:14,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:14,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396307889] [2024-06-27 19:08:14,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:14,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:14,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:14,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:14,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:14,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 244 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:14,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:14,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:14,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:14,893 INFO L124 PetriNetUnfolderBase]: 479/921 cut-off events. [2024-06-27 19:08:14,894 INFO L125 PetriNetUnfolderBase]: For 1008/1017 co-relation queries the response was YES. [2024-06-27 19:08:14,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2473 conditions, 921 events. 479/921 cut-off events. For 1008/1017 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4692 event pairs, 174 based on Foata normal form. 8/888 useless extension candidates. Maximal degree in co-relation 2449. Up to 709 conditions per place. [2024-06-27 19:08:14,898 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 57 selfloop transitions, 14 changer transitions 0/77 dead transitions. [2024-06-27 19:08:14,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 77 transitions, 489 flow [2024-06-27 19:08:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-27 19:08:14,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 19:08:14,900 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 244 flow. Second operand 6 states and 102 transitions. [2024-06-27 19:08:14,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 77 transitions, 489 flow [2024-06-27 19:08:14,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 480 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:14,902 INFO L231 Difference]: Finished difference. Result has 59 places, 58 transitions, 338 flow [2024-06-27 19:08:14,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2024-06-27 19:08:14,903 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 20 predicate places. [2024-06-27 19:08:14,903 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 338 flow [2024-06-27 19:08:14,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:14,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:14,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:14,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 19:08:14,904 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:08:14,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:14,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1070861662, now seen corresponding path program 1 times [2024-06-27 19:08:14,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:14,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850173531] [2024-06-27 19:08:14,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:14,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:15,231 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:08:15,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:15,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850173531] [2024-06-27 19:08:15,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850173531] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:15,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:15,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:15,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78406597] [2024-06-27 19:08:15,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:15,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:15,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:15,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:15,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:15,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:15,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 338 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:15,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:15,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:15,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:15,479 INFO L124 PetriNetUnfolderBase]: 501/964 cut-off events. [2024-06-27 19:08:15,480 INFO L125 PetriNetUnfolderBase]: For 1596/1596 co-relation queries the response was YES. [2024-06-27 19:08:15,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2994 conditions, 964 events. 501/964 cut-off events. For 1596/1596 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4916 event pairs, 191 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 2966. Up to 798 conditions per place. [2024-06-27 19:08:15,484 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 64 selfloop transitions, 15 changer transitions 0/85 dead transitions. [2024-06-27 19:08:15,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 85 transitions, 598 flow [2024-06-27 19:08:15,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:15,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:15,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-27 19:08:15,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46122448979591835 [2024-06-27 19:08:15,486 INFO L175 Difference]: Start difference. First operand has 59 places, 58 transitions, 338 flow. Second operand 7 states and 113 transitions. [2024-06-27 19:08:15,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 85 transitions, 598 flow [2024-06-27 19:08:15,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 590 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 19:08:15,489 INFO L231 Difference]: Finished difference. Result has 66 places, 65 transitions, 427 flow [2024-06-27 19:08:15,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=66, PETRI_TRANSITIONS=65} [2024-06-27 19:08:15,490 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2024-06-27 19:08:15,490 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 65 transitions, 427 flow [2024-06-27 19:08:15,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:15,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:15,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:15,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 19:08:15,491 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:08:15,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1073257374, now seen corresponding path program 2 times [2024-06-27 19:08:15,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:15,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095672644] [2024-06-27 19:08:15,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:15,761 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:08:15,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:15,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095672644] [2024-06-27 19:08:15,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095672644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:15,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:15,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697309884] [2024-06-27 19:08:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:15,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:15,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:15,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 427 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:15,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:15,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:15,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:16,007 INFO L124 PetriNetUnfolderBase]: 514/987 cut-off events. [2024-06-27 19:08:16,007 INFO L125 PetriNetUnfolderBase]: For 2114/2114 co-relation queries the response was YES. [2024-06-27 19:08:16,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3253 conditions, 987 events. 514/987 cut-off events. For 2114/2114 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5060 event pairs, 190 based on Foata normal form. 1/944 useless extension candidates. Maximal degree in co-relation 3221. Up to 808 conditions per place. [2024-06-27 19:08:16,013 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 63 selfloop transitions, 15 changer transitions 0/84 dead transitions. [2024-06-27 19:08:16,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 84 transitions, 656 flow [2024-06-27 19:08:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:16,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:16,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-27 19:08:16,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-06-27 19:08:16,015 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 427 flow. Second operand 6 states and 98 transitions. [2024-06-27 19:08:16,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 84 transitions, 656 flow [2024-06-27 19:08:16,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 84 transitions, 623 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:16,019 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 455 flow [2024-06-27 19:08:16,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2024-06-27 19:08:16,020 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 29 predicate places. [2024-06-27 19:08:16,020 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 455 flow [2024-06-27 19:08:16,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:16,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:16,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:16,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 19:08:16,021 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:08:16,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:16,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1560639004, now seen corresponding path program 3 times [2024-06-27 19:08:16,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:16,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393912858] [2024-06-27 19:08:16,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:16,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:16,309 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:08:16,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:16,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393912858] [2024-06-27 19:08:16,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393912858] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:16,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:16,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 19:08:16,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191284624] [2024-06-27 19:08:16,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:16,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 19:08:16,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:16,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 19:08:16,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 19:08:16,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:16,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 455 flow. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:16,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:16,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:16,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:16,561 INFO L124 PetriNetUnfolderBase]: 509/974 cut-off events. [2024-06-27 19:08:16,561 INFO L125 PetriNetUnfolderBase]: For 2439/2451 co-relation queries the response was YES. [2024-06-27 19:08:16,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 974 events. 509/974 cut-off events. For 2439/2451 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4948 event pairs, 177 based on Foata normal form. 10/940 useless extension candidates. Maximal degree in co-relation 3252. Up to 724 conditions per place. [2024-06-27 19:08:16,567 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 60 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2024-06-27 19:08:16,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 85 transitions, 675 flow [2024-06-27 19:08:16,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:08:16,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:08:16,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 19:08:16,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-27 19:08:16,568 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 455 flow. Second operand 6 states and 101 transitions. [2024-06-27 19:08:16,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 85 transitions, 675 flow [2024-06-27 19:08:16,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 639 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:16,573 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 464 flow [2024-06-27 19:08:16,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-06-27 19:08:16,575 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 31 predicate places. [2024-06-27 19:08:16,575 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 464 flow [2024-06-27 19:08:16,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 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:08:16,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:16,576 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:16,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 19:08:16,576 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:08:16,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:16,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1079009982, now seen corresponding path program 1 times [2024-06-27 19:08:16,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:16,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806018545] [2024-06-27 19:08:16,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:16,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:17,033 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:08:17,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806018545] [2024-06-27 19:08:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806018545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:17,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:17,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:17,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391019975] [2024-06-27 19:08:17,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:17,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:17,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:17,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:17,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:17,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:17,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 464 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:17,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:17,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:17,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:17,311 INFO L124 PetriNetUnfolderBase]: 525/1009 cut-off events. [2024-06-27 19:08:17,311 INFO L125 PetriNetUnfolderBase]: For 2383/2383 co-relation queries the response was YES. [2024-06-27 19:08:17,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3393 conditions, 1009 events. 525/1009 cut-off events. For 2383/2383 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5217 event pairs, 248 based on Foata normal form. 2/968 useless extension candidates. Maximal degree in co-relation 3360. Up to 725 conditions per place. [2024-06-27 19:08:17,317 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 62 selfloop transitions, 28 changer transitions 0/96 dead transitions. [2024-06-27 19:08:17,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 96 transitions, 772 flow [2024-06-27 19:08:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:17,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:17,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-27 19:08:17,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 19:08:17,319 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 464 flow. Second operand 8 states and 128 transitions. [2024-06-27 19:08:17,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 96 transitions, 772 flow [2024-06-27 19:08:17,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 96 transitions, 719 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:17,325 INFO L231 Difference]: Finished difference. Result has 74 places, 73 transitions, 528 flow [2024-06-27 19:08:17,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=528, PETRI_PLACES=74, PETRI_TRANSITIONS=73} [2024-06-27 19:08:17,326 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 35 predicate places. [2024-06-27 19:08:17,326 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 73 transitions, 528 flow [2024-06-27 19:08:17,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:17,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:17,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:17,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 19:08:17,327 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:08:17,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:17,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1050449808, now seen corresponding path program 1 times [2024-06-27 19:08:17,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:17,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700672159] [2024-06-27 19:08:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:17,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:17,624 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:08:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700672159] [2024-06-27 19:08:17,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700672159] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:17,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626182836] [2024-06-27 19:08:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:17,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:17,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:17,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:17,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:17,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:17,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 73 transitions, 528 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:17,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:17,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:17,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:17,889 INFO L124 PetriNetUnfolderBase]: 556/1059 cut-off events. [2024-06-27 19:08:17,890 INFO L125 PetriNetUnfolderBase]: For 2678/2678 co-relation queries the response was YES. [2024-06-27 19:08:17,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3757 conditions, 1059 events. 556/1059 cut-off events. For 2678/2678 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5453 event pairs, 144 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 3722. Up to 825 conditions per place. [2024-06-27 19:08:17,897 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 75 selfloop transitions, 30 changer transitions 0/111 dead transitions. [2024-06-27 19:08:17,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 877 flow [2024-06-27 19:08:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 19:08:17,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-27 19:08:17,899 INFO L175 Difference]: Start difference. First operand has 74 places, 73 transitions, 528 flow. Second operand 8 states and 135 transitions. [2024-06-27 19:08:17,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 877 flow [2024-06-27 19:08:17,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 111 transitions, 826 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:17,909 INFO L231 Difference]: Finished difference. Result has 80 places, 85 transitions, 635 flow [2024-06-27 19:08:17,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=635, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2024-06-27 19:08:17,911 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2024-06-27 19:08:17,911 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 635 flow [2024-06-27 19:08:17,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:17,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:17,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:17,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 19:08:17,912 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:08:17,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash 188386502, now seen corresponding path program 2 times [2024-06-27 19:08:17,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124186508] [2024-06-27 19:08:17,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:18,223 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:08:18,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:18,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124186508] [2024-06-27 19:08:18,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124186508] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:18,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:18,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914754786] [2024-06-27 19:08:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:18,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:18,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:18,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:18,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:18,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:18,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:18,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:18,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:18,529 INFO L124 PetriNetUnfolderBase]: 576/1083 cut-off events. [2024-06-27 19:08:18,530 INFO L125 PetriNetUnfolderBase]: For 3759/3759 co-relation queries the response was YES. [2024-06-27 19:08:18,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4214 conditions, 1083 events. 576/1083 cut-off events. For 3759/3759 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5519 event pairs, 141 based on Foata normal form. 2/1041 useless extension candidates. Maximal degree in co-relation 4175. Up to 837 conditions per place. [2024-06-27 19:08:18,537 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 74 selfloop transitions, 31 changer transitions 0/111 dead transitions. [2024-06-27 19:08:18,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 111 transitions, 967 flow [2024-06-27 19:08:18,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:18,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:18,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 19:08:18,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 19:08:18,538 INFO L175 Difference]: Start difference. First operand has 80 places, 85 transitions, 635 flow. Second operand 7 states and 120 transitions. [2024-06-27 19:08:18,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 111 transitions, 967 flow [2024-06-27 19:08:18,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 111 transitions, 917 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:18,549 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 687 flow [2024-06-27 19:08:18,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=687, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2024-06-27 19:08:18,550 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2024-06-27 19:08:18,550 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 687 flow [2024-06-27 19:08:18,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:18,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:18,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:18,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 19:08:18,551 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:08:18,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:18,551 INFO L85 PathProgramCache]: Analyzing trace with hash 684886424, now seen corresponding path program 3 times [2024-06-27 19:08:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968753841] [2024-06-27 19:08:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:18,841 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:08:18,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:18,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968753841] [2024-06-27 19:08:18,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968753841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963024013] [2024-06-27 19:08:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:18,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:18,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:18,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:18,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:18,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 687 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:18,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:18,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:18,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:19,141 INFO L124 PetriNetUnfolderBase]: 612/1143 cut-off events. [2024-06-27 19:08:19,145 INFO L125 PetriNetUnfolderBase]: For 4812/4812 co-relation queries the response was YES. [2024-06-27 19:08:19,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4698 conditions, 1143 events. 612/1143 cut-off events. For 4812/4812 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5880 event pairs, 134 based on Foata normal form. 2/1099 useless extension candidates. Maximal degree in co-relation 4658. Up to 838 conditions per place. [2024-06-27 19:08:19,155 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 83 selfloop transitions, 34 changer transitions 0/123 dead transitions. [2024-06-27 19:08:19,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 123 transitions, 1155 flow [2024-06-27 19:08:19,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 19:08:19,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 19:08:19,157 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 687 flow. Second operand 7 states and 120 transitions. [2024-06-27 19:08:19,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 123 transitions, 1155 flow [2024-06-27 19:08:19,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 123 transitions, 1067 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:19,166 INFO L231 Difference]: Finished difference. Result has 87 places, 99 transitions, 815 flow [2024-06-27 19:08:19,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=815, PETRI_PLACES=87, PETRI_TRANSITIONS=99} [2024-06-27 19:08:19,167 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 48 predicate places. [2024-06-27 19:08:19,167 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 99 transitions, 815 flow [2024-06-27 19:08:19,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:19,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:19,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:19,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 19:08:19,168 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:08:19,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:19,168 INFO L85 PathProgramCache]: Analyzing trace with hash -910705280, now seen corresponding path program 4 times [2024-06-27 19:08:19,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:19,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503099390] [2024-06-27 19:08:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:19,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:19,504 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:08:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:19,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503099390] [2024-06-27 19:08:19,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503099390] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:19,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:19,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:19,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801943059] [2024-06-27 19:08:19,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:19,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:19,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:19,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:19,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:19,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:19,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 99 transitions, 815 flow. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:19,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:19,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:19,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:19,817 INFO L124 PetriNetUnfolderBase]: 678/1233 cut-off events. [2024-06-27 19:08:19,817 INFO L125 PetriNetUnfolderBase]: For 5714/5714 co-relation queries the response was YES. [2024-06-27 19:08:19,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5182 conditions, 1233 events. 678/1233 cut-off events. For 5714/5714 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6293 event pairs, 110 based on Foata normal form. 6/1194 useless extension candidates. Maximal degree in co-relation 5140. Up to 654 conditions per place. [2024-06-27 19:08:19,832 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 103 selfloop transitions, 44 changer transitions 0/153 dead transitions. [2024-06-27 19:08:19,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 153 transitions, 1482 flow [2024-06-27 19:08:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-27 19:08:19,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-27 19:08:19,834 INFO L175 Difference]: Start difference. First operand has 87 places, 99 transitions, 815 flow. Second operand 7 states and 128 transitions. [2024-06-27 19:08:19,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 153 transitions, 1482 flow [2024-06-27 19:08:19,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 153 transitions, 1420 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:19,849 INFO L231 Difference]: Finished difference. Result has 92 places, 119 transitions, 1068 flow [2024-06-27 19:08:19,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1068, PETRI_PLACES=92, PETRI_TRANSITIONS=119} [2024-06-27 19:08:19,850 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2024-06-27 19:08:19,850 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 119 transitions, 1068 flow [2024-06-27 19:08:19,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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:08:19,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:19,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:19,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 19:08:19,851 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:08:19,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:19,852 INFO L85 PathProgramCache]: Analyzing trace with hash -910428233, now seen corresponding path program 1 times [2024-06-27 19:08:19,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:19,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784891805] [2024-06-27 19:08:19,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:19,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:20,390 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:08:20,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784891805] [2024-06-27 19:08:20,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784891805] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:20,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:20,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94043270] [2024-06-27 19:08:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:20,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:20,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:20,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:20,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:20,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:20,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 119 transitions, 1068 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:08:20,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:20,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:20,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:20,852 INFO L124 PetriNetUnfolderBase]: 780/1415 cut-off events. [2024-06-27 19:08:20,852 INFO L125 PetriNetUnfolderBase]: For 7973/7973 co-relation queries the response was YES. [2024-06-27 19:08:20,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6452 conditions, 1415 events. 780/1415 cut-off events. For 7973/7973 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7554 event pairs, 110 based on Foata normal form. 16/1386 useless extension candidates. Maximal degree in co-relation 6407. Up to 733 conditions per place. [2024-06-27 19:08:20,862 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 113 selfloop transitions, 59 changer transitions 0/178 dead transitions. [2024-06-27 19:08:20,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 178 transitions, 1890 flow [2024-06-27 19:08:20,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 19:08:20,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 19:08:20,864 INFO L175 Difference]: Start difference. First operand has 92 places, 119 transitions, 1068 flow. Second operand 8 states and 147 transitions. [2024-06-27 19:08:20,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 178 transitions, 1890 flow [2024-06-27 19:08:20,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 178 transitions, 1822 flow, removed 26 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:20,881 INFO L231 Difference]: Finished difference. Result has 101 places, 141 transitions, 1459 flow [2024-06-27 19:08:20,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1018, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1459, PETRI_PLACES=101, PETRI_TRANSITIONS=141} [2024-06-27 19:08:20,882 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 62 predicate places. [2024-06-27 19:08:20,882 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 141 transitions, 1459 flow [2024-06-27 19:08:20,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:08:20,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:20,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:20,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 19:08:20,884 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:08:20,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1054336259, now seen corresponding path program 1 times [2024-06-27 19:08:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000611091] [2024-06-27 19:08:20,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:20,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:21,394 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:08:21,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:21,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000611091] [2024-06-27 19:08:21,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000611091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:21,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:21,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:21,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683040735] [2024-06-27 19:08:21,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:21,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:21,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:21,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:21,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:21,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 141 transitions, 1459 flow. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:08:21,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:21,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:21,781 INFO L124 PetriNetUnfolderBase]: 782/1416 cut-off events. [2024-06-27 19:08:21,781 INFO L125 PetriNetUnfolderBase]: For 8591/8591 co-relation queries the response was YES. [2024-06-27 19:08:21,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 1416 events. 782/1416 cut-off events. For 8591/8591 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7609 event pairs, 167 based on Foata normal form. 1/1375 useless extension candidates. Maximal degree in co-relation 7039. Up to 1167 conditions per place. [2024-06-27 19:08:21,790 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 128 selfloop transitions, 36 changer transitions 0/170 dead transitions. [2024-06-27 19:08:21,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 170 transitions, 1964 flow [2024-06-27 19:08:21,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-27 19:08:21,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2024-06-27 19:08:21,791 INFO L175 Difference]: Start difference. First operand has 101 places, 141 transitions, 1459 flow. Second operand 7 states and 121 transitions. [2024-06-27 19:08:21,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 170 transitions, 1964 flow [2024-06-27 19:08:21,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 170 transitions, 1869 flow, removed 38 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:21,813 INFO L231 Difference]: Finished difference. Result has 107 places, 148 transitions, 1560 flow [2024-06-27 19:08:21,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1560, PETRI_PLACES=107, PETRI_TRANSITIONS=148} [2024-06-27 19:08:21,813 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2024-06-27 19:08:21,813 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 148 transitions, 1560 flow [2024-06-27 19:08:21,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 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:08:21,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:21,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:21,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 19:08:21,813 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:08:21,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:21,814 INFO L85 PathProgramCache]: Analyzing trace with hash 604450939, now seen corresponding path program 1 times [2024-06-27 19:08:21,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:21,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99786638] [2024-06-27 19:08:21,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:21,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:22,161 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:08:22,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:22,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99786638] [2024-06-27 19:08:22,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99786638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:22,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:22,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474494558] [2024-06-27 19:08:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:22,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:22,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:22,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:22,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:22,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 148 transitions, 1560 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:22,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:22,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:22,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:22,579 INFO L124 PetriNetUnfolderBase]: 802/1442 cut-off events. [2024-06-27 19:08:22,579 INFO L125 PetriNetUnfolderBase]: For 9404/9404 co-relation queries the response was YES. [2024-06-27 19:08:22,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7358 conditions, 1442 events. 802/1442 cut-off events. For 9404/9404 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 7698 event pairs, 178 based on Foata normal form. 2/1402 useless extension candidates. Maximal degree in co-relation 7305. Up to 1173 conditions per place. [2024-06-27 19:08:22,589 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 132 selfloop transitions, 35 changer transitions 0/173 dead transitions. [2024-06-27 19:08:22,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 173 transitions, 2032 flow [2024-06-27 19:08:22,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2024-06-27 19:08:22,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 19:08:22,591 INFO L175 Difference]: Start difference. First operand has 107 places, 148 transitions, 1560 flow. Second operand 7 states and 119 transitions. [2024-06-27 19:08:22,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 173 transitions, 2032 flow [2024-06-27 19:08:22,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 173 transitions, 1995 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:22,614 INFO L231 Difference]: Finished difference. Result has 111 places, 151 transitions, 1642 flow [2024-06-27 19:08:22,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1523, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1642, PETRI_PLACES=111, PETRI_TRANSITIONS=151} [2024-06-27 19:08:22,615 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 72 predicate places. [2024-06-27 19:08:22,615 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 151 transitions, 1642 flow [2024-06-27 19:08:22,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:22,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:22,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:22,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 19:08:22,616 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:22,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1050497033, now seen corresponding path program 2 times [2024-06-27 19:08:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878129504] [2024-06-27 19:08:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:23,030 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:08:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:23,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878129504] [2024-06-27 19:08:23,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878129504] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:23,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:23,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:23,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954772567] [2024-06-27 19:08:23,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:23,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:23,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:23,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:23,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:23,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 151 transitions, 1642 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:23,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:23,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:23,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:23,371 INFO L124 PetriNetUnfolderBase]: 836/1493 cut-off events. [2024-06-27 19:08:23,371 INFO L125 PetriNetUnfolderBase]: For 11038/11038 co-relation queries the response was YES. [2024-06-27 19:08:23,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7811 conditions, 1493 events. 836/1493 cut-off events. For 11038/11038 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7992 event pairs, 154 based on Foata normal form. 2/1452 useless extension candidates. Maximal degree in co-relation 7757. Up to 847 conditions per place. [2024-06-27 19:08:23,382 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 109 selfloop transitions, 68 changer transitions 0/183 dead transitions. [2024-06-27 19:08:23,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 183 transitions, 2283 flow [2024-06-27 19:08:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:23,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-06-27 19:08:23,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2024-06-27 19:08:23,383 INFO L175 Difference]: Start difference. First operand has 111 places, 151 transitions, 1642 flow. Second operand 7 states and 125 transitions. [2024-06-27 19:08:23,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 183 transitions, 2283 flow [2024-06-27 19:08:23,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 183 transitions, 2204 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:23,410 INFO L231 Difference]: Finished difference. Result has 114 places, 159 transitions, 1860 flow [2024-06-27 19:08:23,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1860, PETRI_PLACES=114, PETRI_TRANSITIONS=159} [2024-06-27 19:08:23,411 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 75 predicate places. [2024-06-27 19:08:23,411 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 159 transitions, 1860 flow [2024-06-27 19:08:23,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:23,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:23,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:23,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 19:08:23,412 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:08:23,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:23,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1050490523, now seen corresponding path program 3 times [2024-06-27 19:08:23,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:23,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459810240] [2024-06-27 19:08:23,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:23,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:23,753 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:08:23,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:23,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459810240] [2024-06-27 19:08:23,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459810240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:23,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:23,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:23,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627351685] [2024-06-27 19:08:23,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:23,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:23,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:23,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:23,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 159 transitions, 1860 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:23,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:23,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:23,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:24,113 INFO L124 PetriNetUnfolderBase]: 826/1479 cut-off events. [2024-06-27 19:08:24,114 INFO L125 PetriNetUnfolderBase]: For 11919/11919 co-relation queries the response was YES. [2024-06-27 19:08:24,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8077 conditions, 1479 events. 826/1479 cut-off events. For 11919/11919 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7913 event pairs, 150 based on Foata normal form. 4/1439 useless extension candidates. Maximal degree in co-relation 8021. Up to 839 conditions per place. [2024-06-27 19:08:24,125 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 102 selfloop transitions, 75 changer transitions 0/183 dead transitions. [2024-06-27 19:08:24,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 183 transitions, 2400 flow [2024-06-27 19:08:24,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:24,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:24,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-27 19:08:24,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-27 19:08:24,127 INFO L175 Difference]: Start difference. First operand has 114 places, 159 transitions, 1860 flow. Second operand 7 states and 127 transitions. [2024-06-27 19:08:24,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 183 transitions, 2400 flow [2024-06-27 19:08:24,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 183 transitions, 2285 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:24,156 INFO L231 Difference]: Finished difference. Result has 118 places, 159 transitions, 1907 flow [2024-06-27 19:08:24,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1745, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1907, PETRI_PLACES=118, PETRI_TRANSITIONS=159} [2024-06-27 19:08:24,157 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 79 predicate places. [2024-06-27 19:08:24,157 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 159 transitions, 1907 flow [2024-06-27 19:08:24,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:24,158 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:24,158 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:24,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 19:08:24,158 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:08:24,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1841188991, now seen corresponding path program 1 times [2024-06-27 19:08:24,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639233474] [2024-06-27 19:08:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:24,606 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:08:24,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:24,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639233474] [2024-06-27 19:08:24,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639233474] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:24,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:24,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:24,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867319821] [2024-06-27 19:08:24,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:24,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:24,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:24,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:24,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 159 transitions, 1907 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:24,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:24,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:24,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:24,999 INFO L124 PetriNetUnfolderBase]: 839/1507 cut-off events. [2024-06-27 19:08:24,999 INFO L125 PetriNetUnfolderBase]: For 12377/12377 co-relation queries the response was YES. [2024-06-27 19:08:25,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8277 conditions, 1507 events. 839/1507 cut-off events. For 12377/12377 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8172 event pairs, 157 based on Foata normal form. 1/1462 useless extension candidates. Maximal degree in co-relation 8220. Up to 1237 conditions per place. [2024-06-27 19:08:25,011 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 148 selfloop transitions, 34 changer transitions 0/188 dead transitions. [2024-06-27 19:08:25,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 188 transitions, 2499 flow [2024-06-27 19:08:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 19:08:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 19:08:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-27 19:08:25,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-27 19:08:25,013 INFO L175 Difference]: Start difference. First operand has 118 places, 159 transitions, 1907 flow. Second operand 7 states and 117 transitions. [2024-06-27 19:08:25,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 188 transitions, 2499 flow [2024-06-27 19:08:25,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 2344 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:25,044 INFO L231 Difference]: Finished difference. Result has 120 places, 164 transitions, 1913 flow [2024-06-27 19:08:25,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1913, PETRI_PLACES=120, PETRI_TRANSITIONS=164} [2024-06-27 19:08:25,044 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 81 predicate places. [2024-06-27 19:08:25,044 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 164 transitions, 1913 flow [2024-06-27 19:08:25,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:25,045 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:25,045 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:25,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 19:08:25,045 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:08:25,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1841485661, now seen corresponding path program 2 times [2024-06-27 19:08:25,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:25,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511693184] [2024-06-27 19:08:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:25,478 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:08:25,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:25,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511693184] [2024-06-27 19:08:25,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511693184] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:25,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:25,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 19:08:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763902264] [2024-06-27 19:08:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:25,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 19:08:25,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:25,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 19:08:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 19:08:25,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:25,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 164 transitions, 1913 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:25,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:25,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:25,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:25,904 INFO L124 PetriNetUnfolderBase]: 840/1502 cut-off events. [2024-06-27 19:08:25,905 INFO L125 PetriNetUnfolderBase]: For 11907/11907 co-relation queries the response was YES. [2024-06-27 19:08:25,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8206 conditions, 1502 events. 840/1502 cut-off events. For 11907/11907 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8054 event pairs, 162 based on Foata normal form. 1/1459 useless extension candidates. Maximal degree in co-relation 8148. Up to 1202 conditions per place. [2024-06-27 19:08:25,914 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 146 selfloop transitions, 46 changer transitions 0/198 dead transitions. [2024-06-27 19:08:25,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 198 transitions, 2547 flow [2024-06-27 19:08:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 19:08:25,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-27 19:08:25,915 INFO L175 Difference]: Start difference. First operand has 120 places, 164 transitions, 1913 flow. Second operand 8 states and 134 transitions. [2024-06-27 19:08:25,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 198 transitions, 2547 flow [2024-06-27 19:08:25,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 198 transitions, 2456 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:25,947 INFO L231 Difference]: Finished difference. Result has 123 places, 169 transitions, 2012 flow [2024-06-27 19:08:25,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2012, PETRI_PLACES=123, PETRI_TRANSITIONS=169} [2024-06-27 19:08:25,948 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2024-06-27 19:08:25,948 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 169 transitions, 2012 flow [2024-06-27 19:08:25,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 0 states have call successors, (0), 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:08:25,948 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:25,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:25,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 19:08:25,949 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:08:25,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:25,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1675253435, now seen corresponding path program 1 times [2024-06-27 19:08:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698180710] [2024-06-27 19:08:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:26,486 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:08:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698180710] [2024-06-27 19:08:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698180710] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:26,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:26,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078825092] [2024-06-27 19:08:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:26,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:26,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:26,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:26,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:26,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 169 transitions, 2012 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:26,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:26,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:26,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:26,963 INFO L124 PetriNetUnfolderBase]: 858/1531 cut-off events. [2024-06-27 19:08:26,963 INFO L125 PetriNetUnfolderBase]: For 13266/13266 co-relation queries the response was YES. [2024-06-27 19:08:26,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8506 conditions, 1531 events. 858/1531 cut-off events. For 13266/13266 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8214 event pairs, 135 based on Foata normal form. 2/1491 useless extension candidates. Maximal degree in co-relation 8447. Up to 1275 conditions per place. [2024-06-27 19:08:26,971 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 162 selfloop transitions, 32 changer transitions 0/200 dead transitions. [2024-06-27 19:08:26,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 200 transitions, 2548 flow [2024-06-27 19:08:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 19:08:26,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-27 19:08:26,973 INFO L175 Difference]: Start difference. First operand has 123 places, 169 transitions, 2012 flow. Second operand 8 states and 135 transitions. [2024-06-27 19:08:26,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 200 transitions, 2548 flow [2024-06-27 19:08:27,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 200 transitions, 2428 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:27,004 INFO L231 Difference]: Finished difference. Result has 126 places, 174 transitions, 2025 flow [2024-06-27 19:08:27,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1892, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2025, PETRI_PLACES=126, PETRI_TRANSITIONS=174} [2024-06-27 19:08:27,004 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 87 predicate places. [2024-06-27 19:08:27,005 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 174 transitions, 2025 flow [2024-06-27 19:08:27,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:27,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:27,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:27,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 19:08:27,005 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:08:27,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1557960640, now seen corresponding path program 1 times [2024-06-27 19:08:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:27,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292524465] [2024-06-27 19:08:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:27,597 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:08:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292524465] [2024-06-27 19:08:27,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292524465] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:27,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:27,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:27,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874022063] [2024-06-27 19:08:27,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:27,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:27,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:27,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:27,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:27,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 174 transitions, 2025 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:27,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:27,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:27,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:28,091 INFO L124 PetriNetUnfolderBase]: 933/1645 cut-off events. [2024-06-27 19:08:28,091 INFO L125 PetriNetUnfolderBase]: For 14511/14511 co-relation queries the response was YES. [2024-06-27 19:08:28,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9307 conditions, 1645 events. 933/1645 cut-off events. For 14511/14511 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8862 event pairs, 187 based on Foata normal form. 1/1601 useless extension candidates. Maximal degree in co-relation 9246. Up to 1349 conditions per place. [2024-06-27 19:08:28,103 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 167 selfloop transitions, 50 changer transitions 0/223 dead transitions. [2024-06-27 19:08:28,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 223 transitions, 2969 flow [2024-06-27 19:08:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-27 19:08:28,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-27 19:08:28,105 INFO L175 Difference]: Start difference. First operand has 126 places, 174 transitions, 2025 flow. Second operand 8 states and 130 transitions. [2024-06-27 19:08:28,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 223 transitions, 2969 flow [2024-06-27 19:08:28,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 223 transitions, 2860 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:28,146 INFO L231 Difference]: Finished difference. Result has 131 places, 197 transitions, 2447 flow [2024-06-27 19:08:28,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1934, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2447, PETRI_PLACES=131, PETRI_TRANSITIONS=197} [2024-06-27 19:08:28,147 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 92 predicate places. [2024-06-27 19:08:28,147 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 197 transitions, 2447 flow [2024-06-27 19:08:28,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:28,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:28,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:28,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 19:08:28,147 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:08:28,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:28,148 INFO L85 PathProgramCache]: Analyzing trace with hash 800471032, now seen corresponding path program 2 times [2024-06-27 19:08:28,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:28,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732779071] [2024-06-27 19:08:28,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:28,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:28,591 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:08:28,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732779071] [2024-06-27 19:08:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732779071] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:28,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:28,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726453678] [2024-06-27 19:08:28,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:28,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:28,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 197 transitions, 2447 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:28,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:28,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:28,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:29,067 INFO L124 PetriNetUnfolderBase]: 958/1679 cut-off events. [2024-06-27 19:08:29,067 INFO L125 PetriNetUnfolderBase]: For 15850/15850 co-relation queries the response was YES. [2024-06-27 19:08:29,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9756 conditions, 1679 events. 958/1679 cut-off events. For 15850/15850 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9037 event pairs, 181 based on Foata normal form. 1/1636 useless extension candidates. Maximal degree in co-relation 9692. Up to 1369 conditions per place. [2024-06-27 19:08:29,077 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 168 selfloop transitions, 63 changer transitions 0/237 dead transitions. [2024-06-27 19:08:29,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 237 transitions, 3282 flow [2024-06-27 19:08:29,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-27 19:08:29,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 19:08:29,079 INFO L175 Difference]: Start difference. First operand has 131 places, 197 transitions, 2447 flow. Second operand 8 states and 136 transitions. [2024-06-27 19:08:29,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 237 transitions, 3282 flow [2024-06-27 19:08:29,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 237 transitions, 3173 flow, removed 32 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:29,128 INFO L231 Difference]: Finished difference. Result has 139 places, 213 transitions, 2807 flow [2024-06-27 19:08:29,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2373, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2807, PETRI_PLACES=139, PETRI_TRANSITIONS=213} [2024-06-27 19:08:29,129 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 100 predicate places. [2024-06-27 19:08:29,129 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 213 transitions, 2807 flow [2024-06-27 19:08:29,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:29,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:29,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:29,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 19:08:29,130 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:08:29,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:29,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1396444529, now seen corresponding path program 2 times [2024-06-27 19:08:29,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:29,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044970205] [2024-06-27 19:08:29,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:29,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:08:29,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:29,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044970205] [2024-06-27 19:08:29,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044970205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:29,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:29,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:29,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748657031] [2024-06-27 19:08:29,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:29,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:29,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:29,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:29,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:29,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 213 transitions, 2807 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:29,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:29,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:29,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:30,268 INFO L124 PetriNetUnfolderBase]: 973/1703 cut-off events. [2024-06-27 19:08:30,268 INFO L125 PetriNetUnfolderBase]: For 18478/18478 co-relation queries the response was YES. [2024-06-27 19:08:30,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10151 conditions, 1703 events. 973/1703 cut-off events. For 18478/18478 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9181 event pairs, 170 based on Foata normal form. 2/1664 useless extension candidates. Maximal degree in co-relation 10083. Up to 1370 conditions per place. [2024-06-27 19:08:30,280 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 178 selfloop transitions, 59 changer transitions 0/243 dead transitions. [2024-06-27 19:08:30,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 243 transitions, 3472 flow [2024-06-27 19:08:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 19:08:30,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-27 19:08:30,282 INFO L175 Difference]: Start difference. First operand has 139 places, 213 transitions, 2807 flow. Second operand 8 states and 134 transitions. [2024-06-27 19:08:30,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 243 transitions, 3472 flow [2024-06-27 19:08:30,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 243 transitions, 3368 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:30,323 INFO L231 Difference]: Finished difference. Result has 143 places, 217 transitions, 2944 flow [2024-06-27 19:08:30,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2703, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2944, PETRI_PLACES=143, PETRI_TRANSITIONS=217} [2024-06-27 19:08:30,325 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 104 predicate places. [2024-06-27 19:08:30,325 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 217 transitions, 2944 flow [2024-06-27 19:08:30,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:30,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:30,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:30,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 19:08:30,325 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:08:30,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:30,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1674289535, now seen corresponding path program 3 times [2024-06-27 19:08:30,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:30,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100920656] [2024-06-27 19:08:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:30,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:30,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:08:30,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:30,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100920656] [2024-06-27 19:08:30,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100920656] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:30,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:30,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:30,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007503672] [2024-06-27 19:08:30,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:30,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:30,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:30,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:30,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:30,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:30,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 217 transitions, 2944 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:30,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:30,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:30,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:31,405 INFO L124 PetriNetUnfolderBase]: 988/1725 cut-off events. [2024-06-27 19:08:31,405 INFO L125 PetriNetUnfolderBase]: For 20330/20330 co-relation queries the response was YES. [2024-06-27 19:08:31,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10504 conditions, 1725 events. 988/1725 cut-off events. For 20330/20330 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9328 event pairs, 161 based on Foata normal form. 2/1686 useless extension candidates. Maximal degree in co-relation 10435. Up to 1377 conditions per place. [2024-06-27 19:08:31,449 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 174 selfloop transitions, 65 changer transitions 0/245 dead transitions. [2024-06-27 19:08:31,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 245 transitions, 3594 flow [2024-06-27 19:08:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 19:08:31,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-27 19:08:31,454 INFO L175 Difference]: Start difference. First operand has 143 places, 217 transitions, 2944 flow. Second operand 8 states and 134 transitions. [2024-06-27 19:08:31,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 245 transitions, 3594 flow [2024-06-27 19:08:31,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 245 transitions, 3482 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:31,510 INFO L231 Difference]: Finished difference. Result has 146 places, 219 transitions, 3009 flow [2024-06-27 19:08:31,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2832, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3009, PETRI_PLACES=146, PETRI_TRANSITIONS=219} [2024-06-27 19:08:31,511 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-06-27 19:08:31,511 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 219 transitions, 3009 flow [2024-06-27 19:08:31,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:31,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:31,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:31,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 19:08:31,511 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:08:31,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash 985568575, now seen corresponding path program 4 times [2024-06-27 19:08:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:31,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368924248] [2024-06-27 19:08:31,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:31,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:32,041 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:08:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368924248] [2024-06-27 19:08:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368924248] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:32,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:32,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574350104] [2024-06-27 19:08:32,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:32,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:32,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:32,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:32,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 219 transitions, 3009 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:32,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:32,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:32,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:32,556 INFO L124 PetriNetUnfolderBase]: 1068/1869 cut-off events. [2024-06-27 19:08:32,557 INFO L125 PetriNetUnfolderBase]: For 25380/25380 co-relation queries the response was YES. [2024-06-27 19:08:32,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11148 conditions, 1869 events. 1068/1869 cut-off events. For 25380/25380 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 10358 event pairs, 174 based on Foata normal form. 14/1837 useless extension candidates. Maximal degree in co-relation 11078. Up to 957 conditions per place. [2024-06-27 19:08:32,588 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 144 selfloop transitions, 103 changer transitions 0/253 dead transitions. [2024-06-27 19:08:32,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 253 transitions, 3777 flow [2024-06-27 19:08:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 19:08:32,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 19:08:32,591 INFO L175 Difference]: Start difference. First operand has 146 places, 219 transitions, 3009 flow. Second operand 8 states and 147 transitions. [2024-06-27 19:08:32,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 253 transitions, 3777 flow [2024-06-27 19:08:32,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 253 transitions, 3616 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:32,657 INFO L231 Difference]: Finished difference. Result has 148 places, 222 transitions, 3118 flow [2024-06-27 19:08:32,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2848, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3118, PETRI_PLACES=148, PETRI_TRANSITIONS=222} [2024-06-27 19:08:32,662 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 109 predicate places. [2024-06-27 19:08:32,662 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 222 transitions, 3118 flow [2024-06-27 19:08:32,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 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:08:32,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:32,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:32,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 19:08:32,663 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:08:32,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:32,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1242276847, now seen corresponding path program 1 times [2024-06-27 19:08:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:32,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517994219] [2024-06-27 19:08:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:33,210 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:08:33,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:33,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517994219] [2024-06-27 19:08:33,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517994219] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:33,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:33,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:33,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638443524] [2024-06-27 19:08:33,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:33,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:33,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:33,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:33,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:33,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:33,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 222 transitions, 3118 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:33,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:33,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:33,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:33,587 INFO L124 PetriNetUnfolderBase]: 1064/1866 cut-off events. [2024-06-27 19:08:33,587 INFO L125 PetriNetUnfolderBase]: For 22115/22115 co-relation queries the response was YES. [2024-06-27 19:08:33,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11257 conditions, 1866 events. 1064/1866 cut-off events. For 22115/22115 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10372 event pairs, 173 based on Foata normal form. 2/1821 useless extension candidates. Maximal degree in co-relation 11186. Up to 1110 conditions per place. [2024-06-27 19:08:33,600 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 141 selfloop transitions, 102 changer transitions 0/249 dead transitions. [2024-06-27 19:08:33,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 249 transitions, 3782 flow [2024-06-27 19:08:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:33,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:33,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-27 19:08:33,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 19:08:33,602 INFO L175 Difference]: Start difference. First operand has 148 places, 222 transitions, 3118 flow. Second operand 8 states and 140 transitions. [2024-06-27 19:08:33,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 249 transitions, 3782 flow [2024-06-27 19:08:33,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 249 transitions, 3514 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:33,664 INFO L231 Difference]: Finished difference. Result has 150 places, 224 transitions, 3092 flow [2024-06-27 19:08:33,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2862, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3092, PETRI_PLACES=150, PETRI_TRANSITIONS=224} [2024-06-27 19:08:33,666 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-27 19:08:33,666 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 224 transitions, 3092 flow [2024-06-27 19:08:33,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:33,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:33,667 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:33,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 19:08:33,667 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:08:33,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:33,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1242284566, now seen corresponding path program 1 times [2024-06-27 19:08:33,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:33,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255910842] [2024-06-27 19:08:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:34,204 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:08:34,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:34,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255910842] [2024-06-27 19:08:34,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255910842] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:34,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:34,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:34,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366114886] [2024-06-27 19:08:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:34,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:34,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:34,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:34,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:34,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:34,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 224 transitions, 3092 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:34,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:34,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:34,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:34,695 INFO L124 PetriNetUnfolderBase]: 1083/1907 cut-off events. [2024-06-27 19:08:34,696 INFO L125 PetriNetUnfolderBase]: For 22581/22581 co-relation queries the response was YES. [2024-06-27 19:08:34,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11292 conditions, 1907 events. 1083/1907 cut-off events. For 22581/22581 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10709 event pairs, 287 based on Foata normal form. 2/1864 useless extension candidates. Maximal degree in co-relation 11220. Up to 1604 conditions per place. [2024-06-27 19:08:34,713 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 213 selfloop transitions, 38 changer transitions 0/257 dead transitions. [2024-06-27 19:08:34,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 257 transitions, 3856 flow [2024-06-27 19:08:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-27 19:08:34,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45396825396825397 [2024-06-27 19:08:34,714 INFO L175 Difference]: Start difference. First operand has 150 places, 224 transitions, 3092 flow. Second operand 9 states and 143 transitions. [2024-06-27 19:08:34,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 257 transitions, 3856 flow [2024-06-27 19:08:34,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 257 transitions, 3632 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:34,779 INFO L231 Difference]: Finished difference. Result has 153 places, 226 transitions, 3006 flow [2024-06-27 19:08:34,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2878, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3006, PETRI_PLACES=153, PETRI_TRANSITIONS=226} [2024-06-27 19:08:34,780 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 114 predicate places. [2024-06-27 19:08:34,780 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 226 transitions, 3006 flow [2024-06-27 19:08:34,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:34,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:34,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:34,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 19:08:34,780 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:08:34,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:34,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1251807766, now seen corresponding path program 2 times [2024-06-27 19:08:34,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:34,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984363832] [2024-06-27 19:08:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:34,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:35,288 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:08:35,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:35,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984363832] [2024-06-27 19:08:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984363832] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:35,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267644530] [2024-06-27 19:08:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:35,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:35,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:35,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:35,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 226 transitions, 3006 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:35,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:35,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:35,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:35,731 INFO L124 PetriNetUnfolderBase]: 1119/1968 cut-off events. [2024-06-27 19:08:35,731 INFO L125 PetriNetUnfolderBase]: For 23277/23277 co-relation queries the response was YES. [2024-06-27 19:08:35,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11570 conditions, 1968 events. 1119/1968 cut-off events. For 23277/23277 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11127 event pairs, 188 based on Foata normal form. 2/1924 useless extension candidates. Maximal degree in co-relation 11497. Up to 1530 conditions per place. [2024-06-27 19:08:35,745 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 212 selfloop transitions, 48 changer transitions 0/266 dead transitions. [2024-06-27 19:08:35,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 266 transitions, 3911 flow [2024-06-27 19:08:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 19:08:35,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2024-06-27 19:08:35,747 INFO L175 Difference]: Start difference. First operand has 153 places, 226 transitions, 3006 flow. Second operand 8 states and 135 transitions. [2024-06-27 19:08:35,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 266 transitions, 3911 flow [2024-06-27 19:08:35,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 266 transitions, 3801 flow, removed 19 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:35,814 INFO L231 Difference]: Finished difference. Result has 155 places, 234 transitions, 3157 flow [2024-06-27 19:08:35,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2896, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3157, PETRI_PLACES=155, PETRI_TRANSITIONS=234} [2024-06-27 19:08:35,814 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2024-06-27 19:08:35,815 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 234 transitions, 3157 flow [2024-06-27 19:08:35,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:35,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:35,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:35,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 19:08:35,815 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:08:35,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1251481336, now seen corresponding path program 3 times [2024-06-27 19:08:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:35,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513488229] [2024-06-27 19:08:35,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:35,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:36,374 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:08:36,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513488229] [2024-06-27 19:08:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513488229] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:36,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:36,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329324923] [2024-06-27 19:08:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:36,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:36,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:36,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:36,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 234 transitions, 3157 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:36,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:36,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:36,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:36,898 INFO L124 PetriNetUnfolderBase]: 1120/1983 cut-off events. [2024-06-27 19:08:36,898 INFO L125 PetriNetUnfolderBase]: For 23222/23222 co-relation queries the response was YES. [2024-06-27 19:08:36,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11644 conditions, 1983 events. 1120/1983 cut-off events. For 23222/23222 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11309 event pairs, 212 based on Foata normal form. 2/1935 useless extension candidates. Maximal degree in co-relation 11569. Up to 1611 conditions per place. [2024-06-27 19:08:36,913 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 214 selfloop transitions, 50 changer transitions 0/270 dead transitions. [2024-06-27 19:08:36,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 270 transitions, 3932 flow [2024-06-27 19:08:36,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 19:08:36,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 19:08:36,915 INFO L175 Difference]: Start difference. First operand has 155 places, 234 transitions, 3157 flow. Second operand 9 states and 150 transitions. [2024-06-27 19:08:36,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 270 transitions, 3932 flow [2024-06-27 19:08:36,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 270 transitions, 3772 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:36,996 INFO L231 Difference]: Finished difference. Result has 160 places, 235 transitions, 3134 flow [2024-06-27 19:08:36,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3013, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3134, PETRI_PLACES=160, PETRI_TRANSITIONS=235} [2024-06-27 19:08:36,997 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 121 predicate places. [2024-06-27 19:08:36,997 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 235 transitions, 3134 flow [2024-06-27 19:08:36,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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:08:36,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:36,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:36,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 19:08:36,998 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:36,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:36,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1982873384, now seen corresponding path program 1 times [2024-06-27 19:08:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067102432] [2024-06-27 19:08:36,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:36,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:37,073 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:08:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067102432] [2024-06-27 19:08:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067102432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:08:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837689904] [2024-06-27 19:08:37,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:37,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:08:37,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:37,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:08:37,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:08:37,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 19:08:37,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 235 transitions, 3134 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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:08:37,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:37,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 19:08:37,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:37,260 INFO L124 PetriNetUnfolderBase]: 628/1249 cut-off events. [2024-06-27 19:08:37,260 INFO L125 PetriNetUnfolderBase]: For 12139/12264 co-relation queries the response was YES. [2024-06-27 19:08:37,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6102 conditions, 1249 events. 628/1249 cut-off events. For 12139/12264 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7287 event pairs, 113 based on Foata normal form. 149/1316 useless extension candidates. Maximal degree in co-relation 6026. Up to 452 conditions per place. [2024-06-27 19:08:37,268 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 69 selfloop transitions, 33 changer transitions 0/151 dead transitions. [2024-06-27 19:08:37,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 151 transitions, 2114 flow [2024-06-27 19:08:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:08:37,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:08:37,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-27 19:08:37,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-06-27 19:08:37,269 INFO L175 Difference]: Start difference. First operand has 160 places, 235 transitions, 3134 flow. Second operand 4 states and 93 transitions. [2024-06-27 19:08:37,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 151 transitions, 2114 flow [2024-06-27 19:08:37,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 151 transitions, 1729 flow, removed 7 selfloop flow, removed 29 redundant places. [2024-06-27 19:08:37,306 INFO L231 Difference]: Finished difference. Result has 136 places, 139 transitions, 1597 flow [2024-06-27 19:08:37,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1597, PETRI_PLACES=136, PETRI_TRANSITIONS=139} [2024-06-27 19:08:37,307 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 97 predicate places. [2024-06-27 19:08:37,307 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 139 transitions, 1597 flow [2024-06-27 19:08:37,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 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:08:37,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:37,307 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:08:37,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 19:08:37,307 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:37,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1067967068, now seen corresponding path program 1 times [2024-06-27 19:08:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624412744] [2024-06-27 19:08:37,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:37,837 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:08:37,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:37,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624412744] [2024-06-27 19:08:37,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624412744] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:37,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:37,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:37,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334370964] [2024-06-27 19:08:37,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:37,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:37,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:37,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:37,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:37,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 139 transitions, 1597 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:37,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:37,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:37,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:38,257 INFO L124 PetriNetUnfolderBase]: 770/1424 cut-off events. [2024-06-27 19:08:38,258 INFO L125 PetriNetUnfolderBase]: For 12650/12650 co-relation queries the response was YES. [2024-06-27 19:08:38,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7292 conditions, 1424 events. 770/1424 cut-off events. For 12650/12650 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7573 event pairs, 171 based on Foata normal form. 2/1361 useless extension candidates. Maximal degree in co-relation 7225. Up to 1193 conditions per place. [2024-06-27 19:08:38,268 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 132 selfloop transitions, 24 changer transitions 0/163 dead transitions. [2024-06-27 19:08:38,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 163 transitions, 2047 flow [2024-06-27 19:08:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2024-06-27 19:08:38,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-27 19:08:38,269 INFO L175 Difference]: Start difference. First operand has 136 places, 139 transitions, 1597 flow. Second operand 8 states and 124 transitions. [2024-06-27 19:08:38,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 163 transitions, 2047 flow [2024-06-27 19:08:38,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 163 transitions, 2013 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 19:08:38,316 INFO L231 Difference]: Finished difference. Result has 142 places, 141 transitions, 1656 flow [2024-06-27 19:08:38,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1563, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1656, PETRI_PLACES=142, PETRI_TRANSITIONS=141} [2024-06-27 19:08:38,318 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 103 predicate places. [2024-06-27 19:08:38,319 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 141 transitions, 1656 flow [2024-06-27 19:08:38,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:38,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:38,319 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:08:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 19:08:38,320 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:08:38,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 395152344, now seen corresponding path program 2 times [2024-06-27 19:08:38,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:38,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062949699] [2024-06-27 19:08:38,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:38,816 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:08:38,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:38,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062949699] [2024-06-27 19:08:38,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062949699] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:38,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:38,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:38,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434626084] [2024-06-27 19:08:38,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:38,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:38,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:38,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 141 transitions, 1656 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:38,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:38,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:38,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:39,260 INFO L124 PetriNetUnfolderBase]: 805/1485 cut-off events. [2024-06-27 19:08:39,260 INFO L125 PetriNetUnfolderBase]: For 14480/14480 co-relation queries the response was YES. [2024-06-27 19:08:39,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7820 conditions, 1485 events. 805/1485 cut-off events. For 14480/14480 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8020 event pairs, 222 based on Foata normal form. 2/1415 useless extension candidates. Maximal degree in co-relation 7751. Up to 1168 conditions per place. [2024-06-27 19:08:39,270 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 118 selfloop transitions, 42 changer transitions 0/167 dead transitions. [2024-06-27 19:08:39,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 167 transitions, 2218 flow [2024-06-27 19:08:39,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:39,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-27 19:08:39,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 19:08:39,271 INFO L175 Difference]: Start difference. First operand has 142 places, 141 transitions, 1656 flow. Second operand 8 states and 126 transitions. [2024-06-27 19:08:39,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 167 transitions, 2218 flow [2024-06-27 19:08:39,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 167 transitions, 2141 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:39,316 INFO L231 Difference]: Finished difference. Result has 144 places, 145 transitions, 1752 flow [2024-06-27 19:08:39,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1752, PETRI_PLACES=144, PETRI_TRANSITIONS=145} [2024-06-27 19:08:39,317 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 105 predicate places. [2024-06-27 19:08:39,317 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 145 transitions, 1752 flow [2024-06-27 19:08:39,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:39,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:39,317 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:08:39,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 19:08:39,317 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:08:39,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 478273884, now seen corresponding path program 3 times [2024-06-27 19:08:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664846624] [2024-06-27 19:08:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:39,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:39,817 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:08:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:39,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664846624] [2024-06-27 19:08:39,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664846624] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:39,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:39,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:39,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735381325] [2024-06-27 19:08:39,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:39,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:39,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:39,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:39,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 145 transitions, 1752 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:39,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:39,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:39,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:40,227 INFO L124 PetriNetUnfolderBase]: 802/1480 cut-off events. [2024-06-27 19:08:40,228 INFO L125 PetriNetUnfolderBase]: For 14470/14470 co-relation queries the response was YES. [2024-06-27 19:08:40,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7802 conditions, 1480 events. 802/1480 cut-off events. For 14470/14470 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7953 event pairs, 224 based on Foata normal form. 2/1409 useless extension candidates. Maximal degree in co-relation 7732. Up to 1226 conditions per place. [2024-06-27 19:08:40,236 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 113 selfloop transitions, 44 changer transitions 0/164 dead transitions. [2024-06-27 19:08:40,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 164 transitions, 2156 flow [2024-06-27 19:08:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:40,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-27 19:08:40,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2024-06-27 19:08:40,237 INFO L175 Difference]: Start difference. First operand has 144 places, 145 transitions, 1752 flow. Second operand 8 states and 121 transitions. [2024-06-27 19:08:40,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 164 transitions, 2156 flow [2024-06-27 19:08:40,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 164 transitions, 2040 flow, removed 35 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:40,284 INFO L231 Difference]: Finished difference. Result has 148 places, 145 transitions, 1734 flow [2024-06-27 19:08:40,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1734, PETRI_PLACES=148, PETRI_TRANSITIONS=145} [2024-06-27 19:08:40,285 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 109 predicate places. [2024-06-27 19:08:40,285 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 145 transitions, 1734 flow [2024-06-27 19:08:40,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:40,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:40,285 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:08:40,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 19:08:40,285 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:08:40,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:40,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1188162654, now seen corresponding path program 1 times [2024-06-27 19:08:40,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:40,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752353020] [2024-06-27 19:08:40,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:40,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:40,696 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:08:40,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:40,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752353020] [2024-06-27 19:08:40,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752353020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:40,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:40,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:40,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427735529] [2024-06-27 19:08:40,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:40,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:40,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:40,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:40,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:40,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:40,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 145 transitions, 1734 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:40,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:40,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:40,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:41,103 INFO L124 PetriNetUnfolderBase]: 954/1768 cut-off events. [2024-06-27 19:08:41,104 INFO L125 PetriNetUnfolderBase]: For 25960/25960 co-relation queries the response was YES. [2024-06-27 19:08:41,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9461 conditions, 1768 events. 954/1768 cut-off events. For 25960/25960 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10062 event pairs, 231 based on Foata normal form. 8/1705 useless extension candidates. Maximal degree in co-relation 9389. Up to 837 conditions per place. [2024-06-27 19:08:41,115 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 106 selfloop transitions, 63 changer transitions 0/176 dead transitions. [2024-06-27 19:08:41,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 176 transitions, 2356 flow [2024-06-27 19:08:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-27 19:08:41,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-27 19:08:41,117 INFO L175 Difference]: Start difference. First operand has 148 places, 145 transitions, 1734 flow. Second operand 8 states and 138 transitions. [2024-06-27 19:08:41,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 176 transitions, 2356 flow [2024-06-27 19:08:41,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 2258 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:41,184 INFO L231 Difference]: Finished difference. Result has 149 places, 147 transitions, 1828 flow [2024-06-27 19:08:41,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1828, PETRI_PLACES=149, PETRI_TRANSITIONS=147} [2024-06-27 19:08:41,185 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 110 predicate places. [2024-06-27 19:08:41,185 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 147 transitions, 1828 flow [2024-06-27 19:08:41,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:41,185 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:41,185 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:08:41,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 19:08:41,186 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:08:41,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash -203826188, now seen corresponding path program 2 times [2024-06-27 19:08:41,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392417316] [2024-06-27 19:08:41,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:41,593 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:08:41,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:41,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392417316] [2024-06-27 19:08:41,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392417316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:41,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:41,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:41,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904712511] [2024-06-27 19:08:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:41,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:41,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:41,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:41,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 147 transitions, 1828 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:41,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:41,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:41,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:41,979 INFO L124 PetriNetUnfolderBase]: 1000/1860 cut-off events. [2024-06-27 19:08:41,979 INFO L125 PetriNetUnfolderBase]: For 29020/29020 co-relation queries the response was YES. [2024-06-27 19:08:41,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9947 conditions, 1860 events. 1000/1860 cut-off events. For 29020/29020 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10830 event pairs, 311 based on Foata normal form. 12/1794 useless extension candidates. Maximal degree in co-relation 9874. Up to 1287 conditions per place. [2024-06-27 19:08:41,992 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 103 selfloop transitions, 61 changer transitions 0/171 dead transitions. [2024-06-27 19:08:41,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 171 transitions, 2318 flow [2024-06-27 19:08:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-27 19:08:41,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-27 19:08:41,994 INFO L175 Difference]: Start difference. First operand has 149 places, 147 transitions, 1828 flow. Second operand 8 states and 132 transitions. [2024-06-27 19:08:41,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 171 transitions, 2318 flow [2024-06-27 19:08:42,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 171 transitions, 2216 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-27 19:08:42,058 INFO L231 Difference]: Finished difference. Result has 153 places, 149 transitions, 1905 flow [2024-06-27 19:08:42,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1905, PETRI_PLACES=153, PETRI_TRANSITIONS=149} [2024-06-27 19:08:42,059 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 114 predicate places. [2024-06-27 19:08:42,059 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 149 transitions, 1905 flow [2024-06-27 19:08:42,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:42,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:42,060 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:08:42,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 19:08:42,060 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:08:42,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -210492862, now seen corresponding path program 4 times [2024-06-27 19:08:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593574990] [2024-06-27 19:08:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:42,651 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:08:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:42,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593574990] [2024-06-27 19:08:42,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593574990] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:42,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:42,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:42,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402944552] [2024-06-27 19:08:42,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:42,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:42,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:42,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:42,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 1905 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:42,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:42,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:42,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:43,102 INFO L124 PetriNetUnfolderBase]: 997/1855 cut-off events. [2024-06-27 19:08:43,102 INFO L125 PetriNetUnfolderBase]: For 23115/23115 co-relation queries the response was YES. [2024-06-27 19:08:43,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10027 conditions, 1855 events. 997/1855 cut-off events. For 23115/23115 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10816 event pairs, 314 based on Foata normal form. 2/1776 useless extension candidates. Maximal degree in co-relation 9952. Up to 1412 conditions per place. [2024-06-27 19:08:43,115 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 106 selfloop transitions, 56 changer transitions 0/169 dead transitions. [2024-06-27 19:08:43,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 169 transitions, 2369 flow [2024-06-27 19:08:43,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-27 19:08:43,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45 [2024-06-27 19:08:43,116 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 1905 flow. Second operand 8 states and 126 transitions. [2024-06-27 19:08:43,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 169 transitions, 2369 flow [2024-06-27 19:08:43,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 169 transitions, 2220 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:43,188 INFO L231 Difference]: Finished difference. Result has 155 places, 151 transitions, 1927 flow [2024-06-27 19:08:43,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1927, PETRI_PLACES=155, PETRI_TRANSITIONS=151} [2024-06-27 19:08:43,189 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2024-06-27 19:08:43,189 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 151 transitions, 1927 flow [2024-06-27 19:08:43,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:43,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:43,190 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:08:43,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 19:08:43,190 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:08:43,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1194842348, now seen corresponding path program 5 times [2024-06-27 19:08:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352547731] [2024-06-27 19:08:43,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:43,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:43,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:43,631 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:08:43,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:43,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352547731] [2024-06-27 19:08:43,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352547731] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:43,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:43,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:43,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486899833] [2024-06-27 19:08:43,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:43,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:43,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:43,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:43,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 151 transitions, 1927 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:43,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:43,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:43,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:44,077 INFO L124 PetriNetUnfolderBase]: 997/1855 cut-off events. [2024-06-27 19:08:44,077 INFO L125 PetriNetUnfolderBase]: For 21613/21613 co-relation queries the response was YES. [2024-06-27 19:08:44,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9849 conditions, 1855 events. 997/1855 cut-off events. For 21613/21613 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10782 event pairs, 309 based on Foata normal form. 2/1786 useless extension candidates. Maximal degree in co-relation 9773. Up to 1042 conditions per place. [2024-06-27 19:08:44,088 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 107 selfloop transitions, 63 changer transitions 0/177 dead transitions. [2024-06-27 19:08:44,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 177 transitions, 2443 flow [2024-06-27 19:08:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-27 19:08:44,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-27 19:08:44,092 INFO L175 Difference]: Start difference. First operand has 155 places, 151 transitions, 1927 flow. Second operand 8 states and 133 transitions. [2024-06-27 19:08:44,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 177 transitions, 2443 flow [2024-06-27 19:08:44,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 177 transitions, 2290 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:44,167 INFO L231 Difference]: Finished difference. Result has 157 places, 153 transitions, 1960 flow [2024-06-27 19:08:44,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1774, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1960, PETRI_PLACES=157, PETRI_TRANSITIONS=153} [2024-06-27 19:08:44,167 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 118 predicate places. [2024-06-27 19:08:44,167 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 153 transitions, 1960 flow [2024-06-27 19:08:44,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:44,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:44,168 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:08:44,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 19:08:44,168 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:08:44,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:44,168 INFO L85 PathProgramCache]: Analyzing trace with hash -144122714, now seen corresponding path program 3 times [2024-06-27 19:08:44,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213060081] [2024-06-27 19:08:44,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:44,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:44,704 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:08:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:44,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213060081] [2024-06-27 19:08:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213060081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:44,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:44,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41046142] [2024-06-27 19:08:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:44,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:44,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:44,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:44,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:44,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 153 transitions, 1960 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:44,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:44,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:44,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:45,223 INFO L124 PetriNetUnfolderBase]: 1065/1984 cut-off events. [2024-06-27 19:08:45,224 INFO L125 PetriNetUnfolderBase]: For 28685/28685 co-relation queries the response was YES. [2024-06-27 19:08:45,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 1984 events. 1065/1984 cut-off events. For 28685/28685 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11774 event pairs, 363 based on Foata normal form. 10/1919 useless extension candidates. Maximal degree in co-relation 10397. Up to 1250 conditions per place. [2024-06-27 19:08:45,236 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 117 selfloop transitions, 54 changer transitions 0/178 dead transitions. [2024-06-27 19:08:45,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 178 transitions, 2462 flow [2024-06-27 19:08:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-27 19:08:45,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603174603174603 [2024-06-27 19:08:45,237 INFO L175 Difference]: Start difference. First operand has 157 places, 153 transitions, 1960 flow. Second operand 9 states and 145 transitions. [2024-06-27 19:08:45,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 178 transitions, 2462 flow [2024-06-27 19:08:45,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 178 transitions, 2294 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:45,323 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 1946 flow [2024-06-27 19:08:45,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1946, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2024-06-27 19:08:45,324 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 121 predicate places. [2024-06-27 19:08:45,324 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 1946 flow [2024-06-27 19:08:45,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 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:08:45,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:45,325 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:08:45,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 19:08:45,325 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:45,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash -143883704, now seen corresponding path program 4 times [2024-06-27 19:08:45,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:45,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705271823] [2024-06-27 19:08:45,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:45,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:45,700 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:08:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705271823] [2024-06-27 19:08:45,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705271823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:45,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:45,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004971182] [2024-06-27 19:08:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:45,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:45,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:45,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:45,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:45,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 1946 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:45,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:45,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:45,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:46,134 INFO L124 PetriNetUnfolderBase]: 1117/2084 cut-off events. [2024-06-27 19:08:46,134 INFO L125 PetriNetUnfolderBase]: For 29193/29193 co-relation queries the response was YES. [2024-06-27 19:08:46,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10837 conditions, 2084 events. 1117/2084 cut-off events. For 29193/29193 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 12553 event pairs, 366 based on Foata normal form. 8/2019 useless extension candidates. Maximal degree in co-relation 10759. Up to 1198 conditions per place. [2024-06-27 19:08:46,149 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 120 selfloop transitions, 55 changer transitions 0/182 dead transitions. [2024-06-27 19:08:46,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 2476 flow [2024-06-27 19:08:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-27 19:08:46,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2024-06-27 19:08:46,150 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 1946 flow. Second operand 8 states and 137 transitions. [2024-06-27 19:08:46,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 182 transitions, 2476 flow [2024-06-27 19:08:46,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 182 transitions, 2354 flow, removed 11 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:46,246 INFO L231 Difference]: Finished difference. Result has 161 places, 155 transitions, 1977 flow [2024-06-27 19:08:46,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1977, PETRI_PLACES=161, PETRI_TRANSITIONS=155} [2024-06-27 19:08:46,246 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 122 predicate places. [2024-06-27 19:08:46,247 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 155 transitions, 1977 flow [2024-06-27 19:08:46,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:46,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:46,247 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:08:46,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 19:08:46,247 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:46,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:46,248 INFO L85 PathProgramCache]: Analyzing trace with hash 151335496, now seen corresponding path program 5 times [2024-06-27 19:08:46,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:46,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365552786] [2024-06-27 19:08:46,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:46,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:46,713 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:08:46,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:46,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365552786] [2024-06-27 19:08:46,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365552786] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:46,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:46,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 19:08:46,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301782311] [2024-06-27 19:08:46,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:46,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 19:08:46,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:46,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 19:08:46,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 19:08:46,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:46,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 155 transitions, 1977 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:46,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:46,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:46,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:47,211 INFO L124 PetriNetUnfolderBase]: 1174/2201 cut-off events. [2024-06-27 19:08:47,212 INFO L125 PetriNetUnfolderBase]: For 32730/32731 co-relation queries the response was YES. [2024-06-27 19:08:47,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11417 conditions, 2201 events. 1174/2201 cut-off events. For 32730/32731 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 13599 event pairs, 402 based on Foata normal form. 8/2138 useless extension candidates. Maximal degree in co-relation 11338. Up to 1264 conditions per place. [2024-06-27 19:08:47,228 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 115 selfloop transitions, 67 changer transitions 0/189 dead transitions. [2024-06-27 19:08:47,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 189 transitions, 2662 flow [2024-06-27 19:08:47,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 150 transitions. [2024-06-27 19:08:47,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47619047619047616 [2024-06-27 19:08:47,229 INFO L175 Difference]: Start difference. First operand has 161 places, 155 transitions, 1977 flow. Second operand 9 states and 150 transitions. [2024-06-27 19:08:47,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 189 transitions, 2662 flow [2024-06-27 19:08:47,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 189 transitions, 2527 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-27 19:08:47,340 INFO L231 Difference]: Finished difference. Result has 164 places, 157 transitions, 2058 flow [2024-06-27 19:08:47,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1842, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2058, PETRI_PLACES=164, PETRI_TRANSITIONS=157} [2024-06-27 19:08:47,341 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 125 predicate places. [2024-06-27 19:08:47,341 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 157 transitions, 2058 flow [2024-06-27 19:08:47,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 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:08:47,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:47,341 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:08:47,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 19:08:47,341 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:47,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash 394400856, now seen corresponding path program 1 times [2024-06-27 19:08:47,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:47,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194809348] [2024-06-27 19:08:47,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:47,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:47,917 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:08:47,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:47,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194809348] [2024-06-27 19:08:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194809348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:47,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:47,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:47,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830933758] [2024-06-27 19:08:47,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:47,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:47,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:47,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:47,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:47,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 157 transitions, 2058 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:47,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:47,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:47,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:48,456 INFO L124 PetriNetUnfolderBase]: 1256/2360 cut-off events. [2024-06-27 19:08:48,456 INFO L125 PetriNetUnfolderBase]: For 33064/33064 co-relation queries the response was YES. [2024-06-27 19:08:48,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12043 conditions, 2360 events. 1256/2360 cut-off events. For 33064/33064 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 14976 event pairs, 498 based on Foata normal form. 6/2285 useless extension candidates. Maximal degree in co-relation 11963. Up to 2054 conditions per place. [2024-06-27 19:08:48,474 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 160 selfloop transitions, 29 changer transitions 0/196 dead transitions. [2024-06-27 19:08:48,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 196 transitions, 2656 flow [2024-06-27 19:08:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 19:08:48,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 19:08:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-27 19:08:48,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-27 19:08:48,478 INFO L175 Difference]: Start difference. First operand has 164 places, 157 transitions, 2058 flow. Second operand 10 states and 155 transitions. [2024-06-27 19:08:48,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 196 transitions, 2656 flow [2024-06-27 19:08:48,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 196 transitions, 2559 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:48,603 INFO L231 Difference]: Finished difference. Result has 172 places, 164 transitions, 2119 flow [2024-06-27 19:08:48,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2119, PETRI_PLACES=172, PETRI_TRANSITIONS=164} [2024-06-27 19:08:48,603 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 133 predicate places. [2024-06-27 19:08:48,603 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 164 transitions, 2119 flow [2024-06-27 19:08:48,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:48,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:48,604 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:08:48,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 19:08:48,604 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:48,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1894430060, now seen corresponding path program 2 times [2024-06-27 19:08:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023408442] [2024-06-27 19:08:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:49,260 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:08:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023408442] [2024-06-27 19:08:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023408442] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:49,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:49,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:49,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607037732] [2024-06-27 19:08:49,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:49,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:49,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:49,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:49,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:49,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:49,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 164 transitions, 2119 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:49,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:49,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:49,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:49,810 INFO L124 PetriNetUnfolderBase]: 1256/2360 cut-off events. [2024-06-27 19:08:49,810 INFO L125 PetriNetUnfolderBase]: For 28698/28698 co-relation queries the response was YES. [2024-06-27 19:08:49,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11958 conditions, 2360 events. 1256/2360 cut-off events. For 28698/28698 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14935 event pairs, 422 based on Foata normal form. 6/2296 useless extension candidates. Maximal degree in co-relation 11873. Up to 1899 conditions per place. [2024-06-27 19:08:49,829 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 155 selfloop transitions, 32 changer transitions 0/194 dead transitions. [2024-06-27 19:08:49,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 194 transitions, 2671 flow [2024-06-27 19:08:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:49,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-27 19:08:49,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-27 19:08:49,830 INFO L175 Difference]: Start difference. First operand has 172 places, 164 transitions, 2119 flow. Second operand 9 states and 140 transitions. [2024-06-27 19:08:49,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 194 transitions, 2671 flow [2024-06-27 19:08:49,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 2585 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 19:08:49,956 INFO L231 Difference]: Finished difference. Result has 176 places, 165 transitions, 2145 flow [2024-06-27 19:08:49,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2037, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2145, PETRI_PLACES=176, PETRI_TRANSITIONS=165} [2024-06-27 19:08:49,957 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 137 predicate places. [2024-06-27 19:08:49,957 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 165 transitions, 2145 flow [2024-06-27 19:08:49,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:49,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:49,957 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:08:49,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 19:08:49,957 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:49,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:49,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1941589178, now seen corresponding path program 3 times [2024-06-27 19:08:49,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:49,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391128807] [2024-06-27 19:08:49,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:49,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:50,420 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:08:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:50,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391128807] [2024-06-27 19:08:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391128807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:50,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:50,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438701224] [2024-06-27 19:08:50,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:50,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:50,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:50,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:50,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:50,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 165 transitions, 2145 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:50,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:50,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:50,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:50,923 INFO L124 PetriNetUnfolderBase]: 1292/2430 cut-off events. [2024-06-27 19:08:50,923 INFO L125 PetriNetUnfolderBase]: For 29339/29339 co-relation queries the response was YES. [2024-06-27 19:08:50,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12280 conditions, 2430 events. 1292/2430 cut-off events. For 29339/29339 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 15553 event pairs, 538 based on Foata normal form. 6/2355 useless extension candidates. Maximal degree in co-relation 12194. Up to 2090 conditions per place. [2024-06-27 19:08:50,942 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 140 selfloop transitions, 45 changer transitions 0/192 dead transitions. [2024-06-27 19:08:50,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 192 transitions, 2679 flow [2024-06-27 19:08:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:50,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-06-27 19:08:50,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43492063492063493 [2024-06-27 19:08:50,944 INFO L175 Difference]: Start difference. First operand has 176 places, 165 transitions, 2145 flow. Second operand 9 states and 137 transitions. [2024-06-27 19:08:50,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 192 transitions, 2679 flow [2024-06-27 19:08:51,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 192 transitions, 2587 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:51,060 INFO L231 Difference]: Finished difference. Result has 178 places, 166 transitions, 2187 flow [2024-06-27 19:08:51,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2053, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2187, PETRI_PLACES=178, PETRI_TRANSITIONS=166} [2024-06-27 19:08:51,060 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 139 predicate places. [2024-06-27 19:08:51,060 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 166 transitions, 2187 flow [2024-06-27 19:08:51,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:51,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:51,061 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:08:51,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 19:08:51,061 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:51,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:51,061 INFO L85 PathProgramCache]: Analyzing trace with hash -635178562, now seen corresponding path program 4 times [2024-06-27 19:08:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10771126] [2024-06-27 19:08:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:51,691 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:08:51,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:51,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10771126] [2024-06-27 19:08:51,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10771126] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:51,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539849042] [2024-06-27 19:08:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:51,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:51,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:51,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 166 transitions, 2187 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:51,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:51,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:51,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:52,360 INFO L124 PetriNetUnfolderBase]: 1328/2502 cut-off events. [2024-06-27 19:08:52,361 INFO L125 PetriNetUnfolderBase]: For 29825/29825 co-relation queries the response was YES. [2024-06-27 19:08:52,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12575 conditions, 2502 events. 1328/2502 cut-off events. For 29825/29825 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16193 event pairs, 557 based on Foata normal form. 6/2428 useless extension candidates. Maximal degree in co-relation 12488. Up to 2102 conditions per place. [2024-06-27 19:08:52,388 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 145 selfloop transitions, 43 changer transitions 0/195 dead transitions. [2024-06-27 19:08:52,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 195 transitions, 2739 flow [2024-06-27 19:08:52,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-27 19:08:52,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44761904761904764 [2024-06-27 19:08:52,390 INFO L175 Difference]: Start difference. First operand has 178 places, 166 transitions, 2187 flow. Second operand 9 states and 141 transitions. [2024-06-27 19:08:52,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 195 transitions, 2739 flow [2024-06-27 19:08:52,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 195 transitions, 2623 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:52,512 INFO L231 Difference]: Finished difference. Result has 180 places, 167 transitions, 2203 flow [2024-06-27 19:08:52,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2071, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2203, PETRI_PLACES=180, PETRI_TRANSITIONS=167} [2024-06-27 19:08:52,513 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 141 predicate places. [2024-06-27 19:08:52,513 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 167 transitions, 2203 flow [2024-06-27 19:08:52,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:52,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:52,513 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:08:52,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 19:08:52,517 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:52,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash 2064656532, now seen corresponding path program 5 times [2024-06-27 19:08:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:52,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987619426] [2024-06-27 19:08:52,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:53,197 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:08:53,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:53,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987619426] [2024-06-27 19:08:53,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987619426] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:53,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:53,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 19:08:53,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612429980] [2024-06-27 19:08:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:53,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 19:08:53,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:53,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 19:08:53,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 19:08:53,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:53,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 167 transitions, 2203 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:53,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:53,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:53,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:53,780 INFO L124 PetriNetUnfolderBase]: 1364/2574 cut-off events. [2024-06-27 19:08:53,780 INFO L125 PetriNetUnfolderBase]: For 30997/30997 co-relation queries the response was YES. [2024-06-27 19:08:53,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12877 conditions, 2574 events. 1364/2574 cut-off events. For 30997/30997 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 16824 event pairs, 558 based on Foata normal form. 6/2497 useless extension candidates. Maximal degree in co-relation 12789. Up to 2051 conditions per place. [2024-06-27 19:08:53,801 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 129 selfloop transitions, 57 changer transitions 0/193 dead transitions. [2024-06-27 19:08:53,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 193 transitions, 2741 flow [2024-06-27 19:08:53,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 19:08:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 19:08:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-27 19:08:53,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4507936507936508 [2024-06-27 19:08:53,803 INFO L175 Difference]: Start difference. First operand has 180 places, 167 transitions, 2203 flow. Second operand 9 states and 142 transitions. [2024-06-27 19:08:53,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 193 transitions, 2741 flow [2024-06-27 19:08:53,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 193 transitions, 2625 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:53,933 INFO L231 Difference]: Finished difference. Result has 182 places, 168 transitions, 2247 flow [2024-06-27 19:08:53,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2087, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2247, PETRI_PLACES=182, PETRI_TRANSITIONS=168} [2024-06-27 19:08:53,933 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 143 predicate places. [2024-06-27 19:08:53,934 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 168 transitions, 2247 flow [2024-06-27 19:08:53,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 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:08:53,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:53,934 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:08:53,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 19:08:53,934 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:53,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:53,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2064512382, now seen corresponding path program 6 times [2024-06-27 19:08:53,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:53,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959020319] [2024-06-27 19:08:53,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:53,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:54,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:08:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:54,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959020319] [2024-06-27 19:08:54,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959020319] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:54,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:54,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:54,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238759748] [2024-06-27 19:08:54,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:54,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:54,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:54,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:54,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:54,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:54,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 168 transitions, 2247 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 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:08:54,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:54,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:54,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:55,152 INFO L124 PetriNetUnfolderBase]: 1357/2561 cut-off events. [2024-06-27 19:08:55,153 INFO L125 PetriNetUnfolderBase]: For 25681/25681 co-relation queries the response was YES. [2024-06-27 19:08:55,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12607 conditions, 2561 events. 1357/2561 cut-off events. For 25681/25681 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 16713 event pairs, 504 based on Foata normal form. 6/2490 useless extension candidates. Maximal degree in co-relation 12518. Up to 1852 conditions per place. [2024-06-27 19:08:55,173 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 126 selfloop transitions, 61 changer transitions 0/194 dead transitions. [2024-06-27 19:08:55,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 194 transitions, 2773 flow [2024-06-27 19:08:55,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:55,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-27 19:08:55,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-27 19:08:55,175 INFO L175 Difference]: Start difference. First operand has 182 places, 168 transitions, 2247 flow. Second operand 8 states and 129 transitions. [2024-06-27 19:08:55,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 194 transitions, 2773 flow [2024-06-27 19:08:55,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 194 transitions, 2631 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-27 19:08:55,302 INFO L231 Difference]: Finished difference. Result has 184 places, 170 transitions, 2298 flow [2024-06-27 19:08:55,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2105, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2298, PETRI_PLACES=184, PETRI_TRANSITIONS=170} [2024-06-27 19:08:55,302 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 145 predicate places. [2024-06-27 19:08:55,302 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 170 transitions, 2298 flow [2024-06-27 19:08:55,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 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:08:55,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:55,303 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:08:55,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 19:08:55,303 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:55,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2031008974, now seen corresponding path program 7 times [2024-06-27 19:08:55,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395745437] [2024-06-27 19:08:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:55,959 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:08:55,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:55,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395745437] [2024-06-27 19:08:55,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395745437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:55,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:55,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 19:08:55,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329614702] [2024-06-27 19:08:55,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:55,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 19:08:55,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:55,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 19:08:55,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 19:08:56,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 19:08:56,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 170 transitions, 2298 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 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:08:56,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:56,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 19:08:56,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:56,547 INFO L124 PetriNetUnfolderBase]: 1350/2548 cut-off events. [2024-06-27 19:08:56,547 INFO L125 PetriNetUnfolderBase]: For 20060/20060 co-relation queries the response was YES. [2024-06-27 19:08:56,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12419 conditions, 2548 events. 1350/2548 cut-off events. For 20060/20060 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16630 event pairs, 501 based on Foata normal form. 6/2473 useless extension candidates. Maximal degree in co-relation 12328. Up to 1913 conditions per place. [2024-06-27 19:08:56,569 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 120 selfloop transitions, 64 changer transitions 0/191 dead transitions. [2024-06-27 19:08:56,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 191 transitions, 2686 flow [2024-06-27 19:08:56,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 19:08:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 19:08:56,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-27 19:08:56,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45357142857142857 [2024-06-27 19:08:56,571 INFO L175 Difference]: Start difference. First operand has 184 places, 170 transitions, 2298 flow. Second operand 8 states and 127 transitions. [2024-06-27 19:08:56,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 191 transitions, 2686 flow [2024-06-27 19:08:56,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 191 transitions, 2314 flow, removed 48 selfloop flow, removed 25 redundant places. [2024-06-27 19:08:56,654 INFO L231 Difference]: Finished difference. Result has 165 places, 169 transitions, 1964 flow [2024-06-27 19:08:56,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1964, PETRI_PLACES=165, PETRI_TRANSITIONS=169} [2024-06-27 19:08:56,655 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 126 predicate places. [2024-06-27 19:08:56,655 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 169 transitions, 1964 flow [2024-06-27 19:08:56,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 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:08:56,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:56,656 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:08:56,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 19:08:56,656 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:56,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1236289910, now seen corresponding path program 1 times [2024-06-27 19:08:56,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:56,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656740320] [2024-06-27 19:08:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:56,741 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:08:56,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:56,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656740320] [2024-06-27 19:08:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656740320] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:56,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 19:08:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935351695] [2024-06-27 19:08:56,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:56,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 19:08:56,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:56,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 19:08:56,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 19:08:56,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-27 19:08:56,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 169 transitions, 1964 flow. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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:08:56,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:56,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-27 19:08:56,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:57,014 INFO L124 PetriNetUnfolderBase]: 908/1930 cut-off events. [2024-06-27 19:08:57,015 INFO L125 PetriNetUnfolderBase]: For 6309/6373 co-relation queries the response was YES. [2024-06-27 19:08:57,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7894 conditions, 1930 events. 908/1930 cut-off events. For 6309/6373 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 13464 event pairs, 196 based on Foata normal form. 156/2002 useless extension candidates. Maximal degree in co-relation 7823. Up to 641 conditions per place. [2024-06-27 19:08:57,027 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 72 selfloop transitions, 35 changer transitions 0/153 dead transitions. [2024-06-27 19:08:57,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 153 transitions, 1944 flow [2024-06-27 19:08:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:08:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:08:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-27 19:08:57,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-27 19:08:57,028 INFO L175 Difference]: Start difference. First operand has 165 places, 169 transitions, 1964 flow. Second operand 5 states and 106 transitions. [2024-06-27 19:08:57,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 153 transitions, 1944 flow [2024-06-27 19:08:57,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 153 transitions, 1435 flow, removed 48 selfloop flow, removed 34 redundant places. [2024-06-27 19:08:57,054 INFO L231 Difference]: Finished difference. Result has 137 places, 144 transitions, 1309 flow [2024-06-27 19:08:57,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1309, PETRI_PLACES=137, PETRI_TRANSITIONS=144} [2024-06-27 19:08:57,055 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 98 predicate places. [2024-06-27 19:08:57,055 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 144 transitions, 1309 flow [2024-06-27 19:08:57,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 0 states have call successors, (0), 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:08:57,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:57,055 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] [2024-06-27 19:08:57,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 19:08:57,056 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:57,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:57,056 INFO L85 PathProgramCache]: Analyzing trace with hash 953853342, now seen corresponding path program 1 times [2024-06-27 19:08:57,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:57,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127833637] [2024-06-27 19:08:57,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:57,431 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:08:57,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:57,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127833637] [2024-06-27 19:08:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127833637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-27 19:08:57,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972030812] [2024-06-27 19:08:57,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:57,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 19:08:57,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:57,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 19:08:57,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-06-27 19:08:57,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 19:08:57,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 144 transitions, 1309 flow. Second operand has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 0 states have call successors, (0), 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:08:57,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:57,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 19:08:57,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:57,950 INFO L124 PetriNetUnfolderBase]: 883/2050 cut-off events. [2024-06-27 19:08:57,950 INFO L125 PetriNetUnfolderBase]: For 4438/4441 co-relation queries the response was YES. [2024-06-27 19:08:57,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7444 conditions, 2050 events. 883/2050 cut-off events. For 4438/4441 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15274 event pairs, 190 based on Foata normal form. 11/1945 useless extension candidates. Maximal degree in co-relation 7398. Up to 580 conditions per place. [2024-06-27 19:08:57,979 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 30 selfloop transitions, 14 changer transitions 151/212 dead transitions. [2024-06-27 19:08:57,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 212 transitions, 1998 flow [2024-06-27 19:08:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-27 19:08:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-27 19:08:57,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 267 transitions. [2024-06-27 19:08:57,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4767857142857143 [2024-06-27 19:08:57,983 INFO L175 Difference]: Start difference. First operand has 137 places, 144 transitions, 1309 flow. Second operand 16 states and 267 transitions. [2024-06-27 19:08:57,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 212 transitions, 1998 flow [2024-06-27 19:08:57,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 212 transitions, 1928 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-27 19:08:57,998 INFO L231 Difference]: Finished difference. Result has 157 places, 53 transitions, 376 flow [2024-06-27 19:08:57,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=376, PETRI_PLACES=157, PETRI_TRANSITIONS=53} [2024-06-27 19:08:57,998 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 118 predicate places. [2024-06-27 19:08:57,998 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 53 transitions, 376 flow [2024-06-27 19:08:57,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 13 states have internal predecessors, (162), 0 states have call successors, (0), 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:08:57,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:57,999 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] [2024-06-27 19:08:57,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 19:08:58,000 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:58,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:58,000 INFO L85 PathProgramCache]: Analyzing trace with hash 767123892, now seen corresponding path program 2 times [2024-06-27 19:08:58,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:58,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509993490] [2024-06-27 19:08:58,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:58,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:08:58,634 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:08:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:08:58,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509993490] [2024-06-27 19:08:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509993490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:08:58,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:08:58,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 19:08:58,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962378015] [2024-06-27 19:08:58,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:08:58,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 19:08:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:08:58,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 19:08:58,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-06-27 19:08:58,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 19:08:58,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 53 transitions, 376 flow. Second operand has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 0 states have call successors, (0), 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:08:58,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:08:58,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 19:08:58,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:08:58,990 INFO L124 PetriNetUnfolderBase]: 220/538 cut-off events. [2024-06-27 19:08:58,990 INFO L125 PetriNetUnfolderBase]: For 1011/1011 co-relation queries the response was YES. [2024-06-27 19:08:58,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 538 events. 220/538 cut-off events. For 1011/1011 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2851 event pairs, 46 based on Foata normal form. 4/510 useless extension candidates. Maximal degree in co-relation 1869. Up to 188 conditions per place. [2024-06-27 19:08:58,993 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 23 selfloop transitions, 8 changer transitions 31/74 dead transitions. [2024-06-27 19:08:58,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 74 transitions, 575 flow [2024-06-27 19:08:58,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 19:08:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 19:08:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-06-27 19:08:58,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43896103896103894 [2024-06-27 19:08:58,994 INFO L175 Difference]: Start difference. First operand has 157 places, 53 transitions, 376 flow. Second operand 11 states and 169 transitions. [2024-06-27 19:08:58,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 74 transitions, 575 flow [2024-06-27 19:08:58,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 74 transitions, 463 flow, removed 23 selfloop flow, removed 27 redundant places. [2024-06-27 19:08:58,998 INFO L231 Difference]: Finished difference. Result has 91 places, 36 transitions, 190 flow [2024-06-27 19:08:58,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=190, PETRI_PLACES=91, PETRI_TRANSITIONS=36} [2024-06-27 19:08:58,998 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 52 predicate places. [2024-06-27 19:08:58,998 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 36 transitions, 190 flow [2024-06-27 19:08:58,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.583333333333334) internal successors, (151), 12 states have internal predecessors, (151), 0 states have call successors, (0), 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:08:58,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:08:58,999 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] [2024-06-27 19:08:58,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 19:08:58,999 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 19:08:58,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:08:58,999 INFO L85 PathProgramCache]: Analyzing trace with hash 382049776, now seen corresponding path program 3 times [2024-06-27 19:08:58,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:08:58,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224534660] [2024-06-27 19:08:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:08:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:08:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:08:59,010 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 19:08:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:08:59,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 19:08:59,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 19:08:59,042 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 19:08:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 19:08:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 19:08:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 19:08:59,043 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 19:08:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 19:08:59,044 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 19:08:59,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 19:08:59,044 INFO L445 BasicCegarLoop]: Path program histogram: [7, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:08:59,048 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 19:08:59,048 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 19:08:59,083 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 19:08:59,083 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 19:08:59,083 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 07:08:59 BasicIcfg [2024-06-27 19:08:59,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 19:08:59,084 INFO L158 Benchmark]: Toolchain (without parser) took 49524.50ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 145.9MB in the beginning and 809.3MB in the end (delta: -663.5MB). Peak memory consumption was 419.7MB. Max. memory is 16.1GB. [2024-06-27 19:08:59,084 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:08:59,084 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:08:59,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.67ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 114.5MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-06-27 19:08:59,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.82ms. Allocated memory is still 176.2MB. Free memory was 114.5MB in the beginning and 111.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 19:08:59,085 INFO L158 Benchmark]: Boogie Preprocessor took 118.11ms. Allocated memory is still 176.2MB. Free memory was 111.3MB in the beginning and 143.4MB in the end (delta: -32.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 19:08:59,085 INFO L158 Benchmark]: RCFGBuilder took 567.02ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 98.2MB in the end (delta: 45.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-06-27 19:08:59,085 INFO L158 Benchmark]: TraceAbstraction took 48136.74ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 98.2MB in the beginning and 809.3MB in the end (delta: -711.2MB). Peak memory consumption was 372.9MB. Max. memory is 16.1GB. [2024-06-27 19:08:59,086 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 176.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 94.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 611.67ms. Allocated memory is still 176.2MB. Free memory was 145.9MB in the beginning and 114.5MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.82ms. Allocated memory is still 176.2MB. Free memory was 114.5MB in the beginning and 111.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 118.11ms. Allocated memory is still 176.2MB. Free memory was 111.3MB in the beginning and 143.4MB in the end (delta: -32.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 567.02ms. Allocated memory is still 176.2MB. Free memory was 143.4MB in the beginning and 98.2MB in the end (delta: 45.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 48136.74ms. Allocated memory was 176.2MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 98.2MB in the beginning and 809.3MB in the end (delta: -711.2MB). Peak memory consumption was 372.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-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] [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-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] [L792] 0 pthread_t t2476; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-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] [L793] 0 //@ assert (((((((((((((!multithreaded || (x$r_buff0_thd1 == (_Bool) 0)) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))); [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=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] [L794] 0 //@ assert (((((((((((((!multithreaded || (x$r_buff0_thd1 == (_Bool) 0)) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (x$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (x$flush_delayed == (_Bool) 0))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-1, t2476=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] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 y = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 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) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 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 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 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=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 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 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 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, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-1, t2476=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: 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: 793]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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, 52 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: 48.0s, OverallIterations: 54, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 24.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2827 SdHoareTripleChecker+Valid, 9.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2427 mSDsluCounter, 2211 SdHoareTripleChecker+Invalid, 8.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1875 mSDsCounter, 673 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14390 IncrementalHoareTripleChecker+Invalid, 15063 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 673 mSolverCounterUnsat, 336 mSDtfsCounter, 14390 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 438 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3157occurred in iteration=31, InterpolantAutomatonStates: 401, 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.4s SatisfiabilityAnalysisTime, 22.7s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 717 ConstructedInterpolants, 0 QuantifiedInterpolants, 26406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 53 InterpolantComputations, 53 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:08:59,127 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