./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe029_power.oepc_pso.oepc_rmo.oepc.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.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:11:29,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:11:30,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:11:30,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:11:30,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:11:30,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:11:30,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:11:30,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:11:30,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:11:30,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:11:30,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:11:30,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:11:30,061 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:11:30,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:11:30,061 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:11:30,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:11:30,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:11:30,062 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:11:30,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:11:30,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:11:30,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:11:30,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:11:30,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:11:30,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:11:30,064 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:11:30,064 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:11:30,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:11:30,065 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:11:30,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:11:30,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:11:30,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:11:30,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:11:30,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:11:30,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:11:30,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:11:30,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:11:30,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:11:30,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:11:30,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:11:30,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:11:30,068 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:11:30,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:11:30,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:11:30,068 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 02:11:30,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:11:30,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:11:30,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:11:30,243 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:11:30,244 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:11:30,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-28 02:11:30,336 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:11:30,337 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:11:30,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 02:11:31,498 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:11:31,786 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:11:31,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 02:11:31,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790b394a8/d471bde01d154adf9f526520cec2c358/FLAG90e6f3c5b [2024-06-28 02:11:32,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/790b394a8/d471bde01d154adf9f526520cec2c358 [2024-06-28 02:11:32,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:11:32,095 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:11:32,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:11:32,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:11:32,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:11:32,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:11:30" (1/2) ... [2024-06-28 02:11:32,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fadeddf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:11:32, skipping insertion in model container [2024-06-28 02:11:32,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:11:30" (1/2) ... [2024-06-28 02:11:32,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@709f7623 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:11:32, skipping insertion in model container [2024-06-28 02:11:32,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:11:32" (2/2) ... [2024-06-28 02:11:32,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fadeddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32, skipping insertion in model container [2024-06-28 02:11:32,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:11:32" (2/2) ... [2024-06-28 02:11:32,105 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:11:32,161 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:11:32,163 INFO L97 edCorrectnessWitness]: Location invariant before [L794-L794] ((((((((((((! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 02:11:32,163 INFO L97 edCorrectnessWitness]: Location invariant before [L793-L793] ((((((((((((! multithreaded || (y$w_buff1 == 0 || y$w_buff1 == 2)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || ((((((((((((0 <= __unbuffered_cnt && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || (y$w_buff0 == 0 || y$w_buff0 == 2))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-06-28 02:11:32,163 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:11:32,163 INFO L106 edCorrectnessWitness]: ghost_update [L791-L791] multithreaded = 1; [2024-06-28 02:11:32,204 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:11:32,339 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.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-06-28 02:11:32,469 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:11:32,477 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:11:32,504 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.oepc_pso.oepc_rmo.oepc.i[970,983] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:11:32,590 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:11:32,632 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:11:32,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32 WrapperNode [2024-06-28 02:11:32,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:11:32,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:11:32,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:11:32,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:11:32,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,711 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2024-06-28 02:11:32,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:11:32,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:11:32,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:11:32,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:11:32,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,759 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-28 02:11:32,763 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:11:32,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:11:32,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:11:32,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:11:32,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (1/1) ... [2024-06-28 02:11:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:11:32,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:11:32,808 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-28 02:11:32,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-28 02:11:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:11:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:11:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:11:32,851 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:11:32,851 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:11:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:11:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:11:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:11:32,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:11:32,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:11:32,853 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:11:32,956 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:11:32,958 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:11:33,202 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:11:33,202 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:11:33,338 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:11:33,338 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:11:33,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:11:33 BoogieIcfgContainer [2024-06-28 02:11:33,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:11:33,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:11:33,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:11:33,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:11:33,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:11:30" (1/4) ... [2024-06-28 02:11:33,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685ccdf1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:11:33, skipping insertion in model container [2024-06-28 02:11:33,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:11:32" (2/4) ... [2024-06-28 02:11:33,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685ccdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:11:33, skipping insertion in model container [2024-06-28 02:11:33,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:11:32" (3/4) ... [2024-06-28 02:11:33,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@685ccdf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:11:33, skipping insertion in model container [2024-06-28 02:11:33,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:11:33" (4/4) ... [2024-06-28 02:11:33,347 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-06-28 02:11:33,360 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:11:33,360 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-28 02:11:33,360 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:11:33,397 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:11:33,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 02:11:33,453 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-28 02:11:33,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:11:33,456 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 4. Compared 44 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-28 02:11:33,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-28 02:11:33,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 33 transitions, 72 flow [2024-06-28 02:11:33,469 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:11:33,484 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;@20406f8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:11:33,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-28 02:11:33,487 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:11:33,487 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:11:33,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:11:33,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:33,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:11:33,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:33,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 304230639, now seen corresponding path program 1 times [2024-06-28 02:11:33,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:33,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306762318] [2024-06-28 02:11:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306762318] [2024-06-28 02:11:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306762318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:34,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:11:34,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708103846] [2024-06-28 02:11:34,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:34,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:11:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:34,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:11:34,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:11:34,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:34,187 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-28 02:11:34,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:34,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:34,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:34,381 INFO L124 PetriNetUnfolderBase]: 546/1040 cut-off events. [2024-06-28 02:11:34,382 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-06-28 02:11:34,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1969 conditions, 1040 events. 546/1040 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5481 event pairs, 392 based on Foata normal form. 43/982 useless extension candidates. Maximal degree in co-relation 1958. Up to 899 conditions per place. [2024-06-28 02:11:34,389 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 32 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2024-06-28 02:11:34,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 169 flow [2024-06-28 02:11:34,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:11:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:11:34,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-28 02:11:34,398 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-28 02:11:34,399 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 72 flow. Second operand 3 states and 70 transitions. [2024-06-28 02:11:34,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 169 flow [2024-06-28 02:11:34,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:34,403 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 96 flow [2024-06-28 02:11:34,405 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-28 02:11:34,408 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-28 02:11:34,408 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 96 flow [2024-06-28 02:11:34,408 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-28 02:11:34,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:34,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:11:34,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:11:34,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:34,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash 304231193, now seen corresponding path program 1 times [2024-06-28 02:11:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:34,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342797547] [2024-06-28 02:11:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:34,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342797547] [2024-06-28 02:11:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342797547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:11:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224368323] [2024-06-28 02:11:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:34,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:11:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:34,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:11:34,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:11:34,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2024-06-28 02:11:34,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:34,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:34,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2024-06-28 02:11:34,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:34,535 INFO L124 PetriNetUnfolderBase]: 129/318 cut-off events. [2024-06-28 02:11:34,536 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-28 02:11:34,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 318 events. 129/318 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1620 event pairs, 41 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 612. Up to 195 conditions per place. [2024-06-28 02:11:34,538 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 23 selfloop transitions, 3 changer transitions 2/44 dead transitions. [2024-06-28 02:11:34,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 167 flow [2024-06-28 02:11:34,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:11:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:11:34,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-06-28 02:11:34,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2024-06-28 02:11:34,540 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 96 flow. Second operand 3 states and 79 transitions. [2024-06-28 02:11:34,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 167 flow [2024-06-28 02:11:34,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:11:34,541 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 88 flow [2024-06-28 02:11:34,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2024-06-28 02:11:34,542 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-06-28 02:11:34,542 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 88 flow [2024-06-28 02:11:34,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:34,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:34,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:34,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:11:34,543 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:34,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 307902317, now seen corresponding path program 1 times [2024-06-28 02:11:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208404922] [2024-06-28 02:11:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:34,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:34,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:34,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:34,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208404922] [2024-06-28 02:11:34,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208404922] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:34,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:34,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:11:34,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110914960] [2024-06-28 02:11:34,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:34,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:11:34,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:34,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:11:34,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:11:34,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:34,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 88 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-28 02:11:34,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:34,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:34,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:34,985 INFO L124 PetriNetUnfolderBase]: 404/796 cut-off events. [2024-06-28 02:11:34,985 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2024-06-28 02:11:34,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 796 events. 404/796 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3947 event pairs, 265 based on Foata normal form. 2/760 useless extension candidates. Maximal degree in co-relation 1652. Up to 660 conditions per place. [2024-06-28 02:11:34,990 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 36 selfloop transitions, 6 changer transitions 0/50 dead transitions. [2024-06-28 02:11:34,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 220 flow [2024-06-28 02:11:34,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:11:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:11:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-06-28 02:11:34,994 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5857142857142857 [2024-06-28 02:11:34,994 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 88 flow. Second operand 4 states and 82 transitions. [2024-06-28 02:11:34,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 220 flow [2024-06-28 02:11:34,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:34,997 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 131 flow [2024-06-28 02:11:34,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-28 02:11:34,998 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2024-06-28 02:11:34,998 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 131 flow [2024-06-28 02:11:34,998 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-28 02:11:34,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:34,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:34,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:11:34,999 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:34,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:34,999 INFO L85 PathProgramCache]: Analyzing trace with hash 955038400, now seen corresponding path program 1 times [2024-06-28 02:11:34,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811189610] [2024-06-28 02:11:35,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:35,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:35,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:35,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811189610] [2024-06-28 02:11:35,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811189610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:35,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:35,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:11:35,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419637616] [2024-06-28 02:11:35,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:35,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:11:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:11:35,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:11:35,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:35,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 131 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-28 02:11:35,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:35,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:35,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:35,531 INFO L124 PetriNetUnfolderBase]: 428/842 cut-off events. [2024-06-28 02:11:35,532 INFO L125 PetriNetUnfolderBase]: For 343/343 co-relation queries the response was YES. [2024-06-28 02:11:35,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1909 conditions, 842 events. 428/842 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4402 event pairs, 168 based on Foata normal form. 3/805 useless extension candidates. Maximal degree in co-relation 1894. Up to 635 conditions per place. [2024-06-28 02:11:35,536 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 48 selfloop transitions, 13 changer transitions 0/69 dead transitions. [2024-06-28 02:11:35,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 345 flow [2024-06-28 02:11:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:11:35,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:11:35,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2024-06-28 02:11:35,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2024-06-28 02:11:35,538 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 131 flow. Second operand 5 states and 108 transitions. [2024-06-28 02:11:35,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 345 flow [2024-06-28 02:11:35,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 338 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 02:11:35,540 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 212 flow [2024-06-28 02:11:35,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-06-28 02:11:35,541 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2024-06-28 02:11:35,541 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 212 flow [2024-06-28 02:11:35,541 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-28 02:11:35,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:35,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:35,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:11:35,542 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:35,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:35,542 INFO L85 PathProgramCache]: Analyzing trace with hash -458579476, now seen corresponding path program 1 times [2024-06-28 02:11:35,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:35,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071368563] [2024-06-28 02:11:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:35,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:35,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:35,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071368563] [2024-06-28 02:11:35,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071368563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:35,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:11:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383753538] [2024-06-28 02:11:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:35,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:11:35,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:35,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:11:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:11:36,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:36,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-28 02:11:36,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:36,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:36,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:36,211 INFO L124 PetriNetUnfolderBase]: 474/918 cut-off events. [2024-06-28 02:11:36,211 INFO L125 PetriNetUnfolderBase]: For 893/893 co-relation queries the response was YES. [2024-06-28 02:11:36,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2449 conditions, 918 events. 474/918 cut-off events. For 893/893 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4840 event pairs, 106 based on Foata normal form. 5/880 useless extension candidates. Maximal degree in co-relation 2430. Up to 575 conditions per place. [2024-06-28 02:11:36,216 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 74 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2024-06-28 02:11:36,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 107 transitions, 654 flow [2024-06-28 02:11:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:36,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-28 02:11:36,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2024-06-28 02:11:36,218 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 212 flow. Second operand 6 states and 136 transitions. [2024-06-28 02:11:36,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 107 transitions, 654 flow [2024-06-28 02:11:36,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 107 transitions, 646 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-28 02:11:36,222 INFO L231 Difference]: Finished difference. Result has 57 places, 68 transitions, 424 flow [2024-06-28 02:11:36,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=57, PETRI_TRANSITIONS=68} [2024-06-28 02:11:36,223 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2024-06-28 02:11:36,223 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 68 transitions, 424 flow [2024-06-28 02:11:36,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 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-28 02:11:36,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:36,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:36,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:11:36,224 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:36,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:36,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1331060641, now seen corresponding path program 1 times [2024-06-28 02:11:36,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:36,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007409134] [2024-06-28 02:11:36,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:36,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:36,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:36,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007409134] [2024-06-28 02:11:36,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007409134] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:36,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:36,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:36,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204584925] [2024-06-28 02:11:36,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:36,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:36,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:36,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:36,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:36,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:11:36,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 68 transitions, 424 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-28 02:11:36,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:36,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:11:36,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:37,086 INFO L124 PetriNetUnfolderBase]: 504/970 cut-off events. [2024-06-28 02:11:37,086 INFO L125 PetriNetUnfolderBase]: For 1800/1800 co-relation queries the response was YES. [2024-06-28 02:11:37,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 970 events. 504/970 cut-off events. For 1800/1800 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5183 event pairs, 67 based on Foata normal form. 6/934 useless extension candidates. Maximal degree in co-relation 3212. Up to 676 conditions per place. [2024-06-28 02:11:37,092 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 76 selfloop transitions, 28 changer transitions 0/112 dead transitions. [2024-06-28 02:11:37,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 112 transitions, 810 flow [2024-06-28 02:11:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:37,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 146 transitions. [2024-06-28 02:11:37,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5959183673469388 [2024-06-28 02:11:37,094 INFO L175 Difference]: Start difference. First operand has 57 places, 68 transitions, 424 flow. Second operand 7 states and 146 transitions. [2024-06-28 02:11:37,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 112 transitions, 810 flow [2024-06-28 02:11:37,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 112 transitions, 794 flow, removed 8 selfloop flow, removed 0 redundant places. [2024-06-28 02:11:37,101 INFO L231 Difference]: Finished difference. Result has 64 places, 77 transitions, 558 flow [2024-06-28 02:11:37,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=558, PETRI_PLACES=64, PETRI_TRANSITIONS=77} [2024-06-28 02:11:37,103 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2024-06-28 02:11:37,103 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 77 transitions, 558 flow [2024-06-28 02:11:37,103 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-28 02:11:37,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:37,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:37,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:11:37,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:37,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2033738082, now seen corresponding path program 1 times [2024-06-28 02:11:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:37,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596429227] [2024-06-28 02:11:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:37,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:37,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:37,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596429227] [2024-06-28 02:11:37,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596429227] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:37,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:37,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:11:37,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959280138] [2024-06-28 02:11:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:37,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:11:37,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:11:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:11:37,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:37,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 77 transitions, 558 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-28 02:11:37,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:37,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:37,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:37,698 INFO L124 PetriNetUnfolderBase]: 577/1083 cut-off events. [2024-06-28 02:11:37,699 INFO L125 PetriNetUnfolderBase]: For 2613/2613 co-relation queries the response was YES. [2024-06-28 02:11:37,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3975 conditions, 1083 events. 577/1083 cut-off events. For 2613/2613 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5576 event pairs, 161 based on Foata normal form. 1/1042 useless extension candidates. Maximal degree in co-relation 3945. Up to 933 conditions per place. [2024-06-28 02:11:37,706 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 75 selfloop transitions, 12 changer transitions 0/93 dead transitions. [2024-06-28 02:11:37,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 93 transitions, 792 flow [2024-06-28 02:11:37,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:11:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:11:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2024-06-28 02:11:37,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2024-06-28 02:11:37,708 INFO L175 Difference]: Start difference. First operand has 64 places, 77 transitions, 558 flow. Second operand 5 states and 83 transitions. [2024-06-28 02:11:37,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 93 transitions, 792 flow [2024-06-28 02:11:37,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 740 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:37,713 INFO L231 Difference]: Finished difference. Result has 66 places, 80 transitions, 571 flow [2024-06-28 02:11:37,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=571, PETRI_PLACES=66, PETRI_TRANSITIONS=80} [2024-06-28 02:11:37,714 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 27 predicate places. [2024-06-28 02:11:37,714 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 80 transitions, 571 flow [2024-06-28 02:11:37,714 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-28 02:11:37,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:37,714 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:37,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:11:37,714 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:37,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1377620479, now seen corresponding path program 1 times [2024-06-28 02:11:37,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:37,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340259354] [2024-06-28 02:11:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:37,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:38,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:38,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340259354] [2024-06-28 02:11:38,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340259354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:38,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:38,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:38,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053634700] [2024-06-28 02:11:38,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:38,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:38,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:38,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:38,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:38,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:38,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 80 transitions, 571 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-28 02:11:38,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:38,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:38,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:38,370 INFO L124 PetriNetUnfolderBase]: 573/1077 cut-off events. [2024-06-28 02:11:38,371 INFO L125 PetriNetUnfolderBase]: For 2575/2575 co-relation queries the response was YES. [2024-06-28 02:11:38,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3929 conditions, 1077 events. 573/1077 cut-off events. For 2575/2575 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5534 event pairs, 163 based on Foata normal form. 2/1037 useless extension candidates. Maximal degree in co-relation 3896. Up to 915 conditions per place. [2024-06-28 02:11:38,375 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 77 selfloop transitions, 15 changer transitions 0/98 dead transitions. [2024-06-28 02:11:38,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 98 transitions, 819 flow [2024-06-28 02:11:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:11:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:11:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-28 02:11:38,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-28 02:11:38,378 INFO L175 Difference]: Start difference. First operand has 66 places, 80 transitions, 571 flow. Second operand 6 states and 97 transitions. [2024-06-28 02:11:38,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 98 transitions, 819 flow [2024-06-28 02:11:38,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 98 transitions, 790 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:38,386 INFO L231 Difference]: Finished difference. Result has 71 places, 84 transitions, 626 flow [2024-06-28 02:11:38,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=626, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2024-06-28 02:11:38,388 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 32 predicate places. [2024-06-28 02:11:38,388 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 84 transitions, 626 flow [2024-06-28 02:11:38,388 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-28 02:11:38,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:38,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:38,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:11:38,389 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:38,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:38,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1618242380, now seen corresponding path program 1 times [2024-06-28 02:11:38,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:38,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210158860] [2024-06-28 02:11:38,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:38,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:38,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210158860] [2024-06-28 02:11:38,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210158860] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:38,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:38,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328053350] [2024-06-28 02:11:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:38,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:38,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:38,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:38,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:38,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:38,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 84 transitions, 626 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-28 02:11:38,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:38,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:38,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:39,066 INFO L124 PetriNetUnfolderBase]: 656/1234 cut-off events. [2024-06-28 02:11:39,067 INFO L125 PetriNetUnfolderBase]: For 3259/3259 co-relation queries the response was YES. [2024-06-28 02:11:39,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4677 conditions, 1234 events. 656/1234 cut-off events. For 3259/3259 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6618 event pairs, 142 based on Foata normal form. 2/1187 useless extension candidates. Maximal degree in co-relation 4641. Up to 980 conditions per place. [2024-06-28 02:11:39,074 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 95 selfloop transitions, 21 changer transitions 0/122 dead transitions. [2024-06-28 02:11:39,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 1097 flow [2024-06-28 02:11:39,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:39,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-28 02:11:39,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-28 02:11:39,076 INFO L175 Difference]: Start difference. First operand has 71 places, 84 transitions, 626 flow. Second operand 7 states and 112 transitions. [2024-06-28 02:11:39,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 1097 flow [2024-06-28 02:11:39,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 1069 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:39,083 INFO L231 Difference]: Finished difference. Result has 77 places, 98 transitions, 808 flow [2024-06-28 02:11:39,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=77, PETRI_TRANSITIONS=98} [2024-06-28 02:11:39,086 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 38 predicate places. [2024-06-28 02:11:39,086 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 98 transitions, 808 flow [2024-06-28 02:11:39,086 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-28 02:11:39,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:39,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:39,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:11:39,087 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:39,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:39,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1586696780, now seen corresponding path program 2 times [2024-06-28 02:11:39,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:39,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004390872] [2024-06-28 02:11:39,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:39,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:39,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004390872] [2024-06-28 02:11:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004390872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063894955] [2024-06-28 02:11:39,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:39,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:39,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:39,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:39,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:39,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 98 transitions, 808 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-28 02:11:39,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:39,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:39,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:39,806 INFO L124 PetriNetUnfolderBase]: 653/1225 cut-off events. [2024-06-28 02:11:39,806 INFO L125 PetriNetUnfolderBase]: For 3758/3758 co-relation queries the response was YES. [2024-06-28 02:11:39,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 1225 events. 653/1225 cut-off events. For 3758/3758 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6506 event pairs, 183 based on Foata normal form. 1/1178 useless extension candidates. Maximal degree in co-relation 4828. Up to 1050 conditions per place. [2024-06-28 02:11:39,813 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 13 changer transitions 0/114 dead transitions. [2024-06-28 02:11:39,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 114 transitions, 1087 flow [2024-06-28 02:11:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:39,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2024-06-28 02:11:39,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42448979591836733 [2024-06-28 02:11:39,815 INFO L175 Difference]: Start difference. First operand has 77 places, 98 transitions, 808 flow. Second operand 7 states and 104 transitions. [2024-06-28 02:11:39,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 114 transitions, 1087 flow [2024-06-28 02:11:39,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 114 transitions, 1074 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:39,823 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 857 flow [2024-06-28 02:11:39,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=857, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2024-06-28 02:11:39,823 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 43 predicate places. [2024-06-28 02:11:39,824 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 857 flow [2024-06-28 02:11:39,824 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-28 02:11:39,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:39,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:39,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:11:39,824 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:39,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:39,825 INFO L85 PathProgramCache]: Analyzing trace with hash -39455008, now seen corresponding path program 3 times [2024-06-28 02:11:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:39,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178838031] [2024-06-28 02:11:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:39,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178838031] [2024-06-28 02:11:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178838031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:40,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:40,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:11:40,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019070684] [2024-06-28 02:11:40,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:40,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:11:40,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:40,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:11:40,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:11:40,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:40,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 857 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-28 02:11:40,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:40,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:40,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:40,418 INFO L124 PetriNetUnfolderBase]: 718/1348 cut-off events. [2024-06-28 02:11:40,418 INFO L125 PetriNetUnfolderBase]: For 4802/4802 co-relation queries the response was YES. [2024-06-28 02:11:40,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5594 conditions, 1348 events. 718/1348 cut-off events. For 4802/4802 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7366 event pairs, 148 based on Foata normal form. 2/1296 useless extension candidates. Maximal degree in co-relation 5553. Up to 978 conditions per place. [2024-06-28 02:11:40,427 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 109 selfloop transitions, 43 changer transitions 0/158 dead transitions. [2024-06-28 02:11:40,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 158 transitions, 1627 flow [2024-06-28 02:11:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:40,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-28 02:11:40,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49387755102040815 [2024-06-28 02:11:40,428 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 857 flow. Second operand 7 states and 121 transitions. [2024-06-28 02:11:40,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 158 transitions, 1627 flow [2024-06-28 02:11:40,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 158 transitions, 1575 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:40,468 INFO L231 Difference]: Finished difference. Result has 86 places, 124 transitions, 1240 flow [2024-06-28 02:11:40,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1240, PETRI_PLACES=86, PETRI_TRANSITIONS=124} [2024-06-28 02:11:40,468 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 47 predicate places. [2024-06-28 02:11:40,469 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 124 transitions, 1240 flow [2024-06-28 02:11:40,469 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-28 02:11:40,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:40,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:40,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:11:40,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:40,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1374094403, now seen corresponding path program 1 times [2024-06-28 02:11:40,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:40,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071751478] [2024-06-28 02:11:40,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:40,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:40,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071751478] [2024-06-28 02:11:40,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071751478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:40,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:40,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070108777] [2024-06-28 02:11:40,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:40,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:40,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:40,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:40,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:40,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:40,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 124 transitions, 1240 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-28 02:11:40,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:40,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:40,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:41,181 INFO L124 PetriNetUnfolderBase]: 782/1451 cut-off events. [2024-06-28 02:11:41,181 INFO L125 PetriNetUnfolderBase]: For 6207/6207 co-relation queries the response was YES. [2024-06-28 02:11:41,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6417 conditions, 1451 events. 782/1451 cut-off events. For 6207/6207 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8014 event pairs, 126 based on Foata normal form. 6/1400 useless extension candidates. Maximal degree in co-relation 6374. Up to 770 conditions per place. [2024-06-28 02:11:41,190 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 122 selfloop transitions, 55 changer transitions 0/183 dead transitions. [2024-06-28 02:11:41,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 183 transitions, 2006 flow [2024-06-28 02:11:41,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:41,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-28 02:11:41,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2024-06-28 02:11:41,192 INFO L175 Difference]: Start difference. First operand has 86 places, 124 transitions, 1240 flow. Second operand 7 states and 131 transitions. [2024-06-28 02:11:41,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 183 transitions, 2006 flow [2024-06-28 02:11:41,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 183 transitions, 1937 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:41,206 INFO L231 Difference]: Finished difference. Result has 92 places, 148 transitions, 1580 flow [2024-06-28 02:11:41,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1580, PETRI_PLACES=92, PETRI_TRANSITIONS=148} [2024-06-28 02:11:41,206 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 53 predicate places. [2024-06-28 02:11:41,207 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 148 transitions, 1580 flow [2024-06-28 02:11:41,207 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-28 02:11:41,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:41,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:41,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:11:41,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:41,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2013061527, now seen corresponding path program 2 times [2024-06-28 02:11:41,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:41,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635762889] [2024-06-28 02:11:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:41,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:41,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635762889] [2024-06-28 02:11:41,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635762889] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:41,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:41,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:41,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755217245] [2024-06-28 02:11:41,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:41,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:41,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:41,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:41,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:41,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:41,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 148 transitions, 1580 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-28 02:11:41,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:41,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:41,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:41,959 INFO L124 PetriNetUnfolderBase]: 804/1483 cut-off events. [2024-06-28 02:11:41,959 INFO L125 PetriNetUnfolderBase]: For 7417/7417 co-relation queries the response was YES. [2024-06-28 02:11:41,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7267 conditions, 1483 events. 804/1483 cut-off events. For 7417/7417 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8186 event pairs, 179 based on Foata normal form. 2/1429 useless extension candidates. Maximal degree in co-relation 7220. Up to 1249 conditions per place. [2024-06-28 02:11:41,969 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 144 selfloop transitions, 23 changer transitions 0/173 dead transitions. [2024-06-28 02:11:41,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 173 transitions, 2030 flow [2024-06-28 02:11:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-28 02:11:41,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46530612244897956 [2024-06-28 02:11:41,971 INFO L175 Difference]: Start difference. First operand has 92 places, 148 transitions, 1580 flow. Second operand 7 states and 114 transitions. [2024-06-28 02:11:41,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 173 transitions, 2030 flow [2024-06-28 02:11:41,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 173 transitions, 2001 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-28 02:11:41,989 INFO L231 Difference]: Finished difference. Result has 98 places, 155 transitions, 1677 flow [2024-06-28 02:11:41,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1677, PETRI_PLACES=98, PETRI_TRANSITIONS=155} [2024-06-28 02:11:41,990 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 59 predicate places. [2024-06-28 02:11:41,990 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 155 transitions, 1677 flow [2024-06-28 02:11:41,990 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-28 02:11:41,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:41,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:41,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:11:41,991 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:41,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:41,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1906135549, now seen corresponding path program 3 times [2024-06-28 02:11:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:41,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463937753] [2024-06-28 02:11:41,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:41,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463937753] [2024-06-28 02:11:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463937753] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:42,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:42,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:42,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948940891] [2024-06-28 02:11:42,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:42,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:42,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:42,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:42,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 155 transitions, 1677 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-28 02:11:42,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:42,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:42,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:42,747 INFO L124 PetriNetUnfolderBase]: 814/1489 cut-off events. [2024-06-28 02:11:42,747 INFO L125 PetriNetUnfolderBase]: For 7866/7866 co-relation queries the response was YES. [2024-06-28 02:11:42,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7560 conditions, 1489 events. 814/1489 cut-off events. For 7866/7866 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8118 event pairs, 181 based on Foata normal form. 2/1438 useless extension candidates. Maximal degree in co-relation 7510. Up to 1219 conditions per place. [2024-06-28 02:11:42,761 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 150 selfloop transitions, 30 changer transitions 0/186 dead transitions. [2024-06-28 02:11:42,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 186 transitions, 2249 flow [2024-06-28 02:11:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 02:11:42,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-28 02:11:42,762 INFO L175 Difference]: Start difference. First operand has 98 places, 155 transitions, 1677 flow. Second operand 7 states and 117 transitions. [2024-06-28 02:11:42,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 186 transitions, 2249 flow [2024-06-28 02:11:42,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 186 transitions, 2213 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:42,781 INFO L231 Difference]: Finished difference. Result has 103 places, 163 transitions, 1830 flow [2024-06-28 02:11:42,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1830, PETRI_PLACES=103, PETRI_TRANSITIONS=163} [2024-06-28 02:11:42,782 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 64 predicate places. [2024-06-28 02:11:42,782 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 163 transitions, 1830 flow [2024-06-28 02:11:42,782 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-28 02:11:42,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:42,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:42,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:11:42,783 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:42,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:42,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1906411418, now seen corresponding path program 1 times [2024-06-28 02:11:42,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:42,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111076598] [2024-06-28 02:11:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:42,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111076598] [2024-06-28 02:11:43,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111076598] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:43,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:43,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127570308] [2024-06-28 02:11:43,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:43,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:43,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:43,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:43,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:43,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 163 transitions, 1830 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-28 02:11:43,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:43,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:43,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:43,772 INFO L124 PetriNetUnfolderBase]: 811/1487 cut-off events. [2024-06-28 02:11:43,773 INFO L125 PetriNetUnfolderBase]: For 8453/8453 co-relation queries the response was YES. [2024-06-28 02:11:43,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7675 conditions, 1487 events. 811/1487 cut-off events. For 8453/8453 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8174 event pairs, 176 based on Foata normal form. 2/1435 useless extension candidates. Maximal degree in co-relation 7623. Up to 1259 conditions per place. [2024-06-28 02:11:43,782 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 157 selfloop transitions, 20 changer transitions 0/183 dead transitions. [2024-06-28 02:11:43,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 183 transitions, 2266 flow [2024-06-28 02:11:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:43,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-28 02:11:43,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-28 02:11:43,783 INFO L175 Difference]: Start difference. First operand has 103 places, 163 transitions, 1830 flow. Second operand 7 states and 112 transitions. [2024-06-28 02:11:43,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 183 transitions, 2266 flow [2024-06-28 02:11:43,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 183 transitions, 2231 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:43,804 INFO L231 Difference]: Finished difference. Result has 107 places, 165 transitions, 1862 flow [2024-06-28 02:11:43,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1862, PETRI_PLACES=107, PETRI_TRANSITIONS=165} [2024-06-28 02:11:43,805 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 68 predicate places. [2024-06-28 02:11:43,805 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 165 transitions, 1862 flow [2024-06-28 02:11:43,806 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-28 02:11:43,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:43,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:43,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:11:43,806 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:43,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash -356561037, now seen corresponding path program 1 times [2024-06-28 02:11:43,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:43,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539713561] [2024-06-28 02:11:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:43,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539713561] [2024-06-28 02:11:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539713561] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091958970] [2024-06-28 02:11:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:44,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:44,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:44,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:44,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:44,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 165 transitions, 1862 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-28 02:11:44,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:44,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:44,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:44,642 INFO L124 PetriNetUnfolderBase]: 821/1506 cut-off events. [2024-06-28 02:11:44,642 INFO L125 PetriNetUnfolderBase]: For 8808/8808 co-relation queries the response was YES. [2024-06-28 02:11:44,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 1506 events. 821/1506 cut-off events. For 8808/8808 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8336 event pairs, 140 based on Foata normal form. 1/1451 useless extension candidates. Maximal degree in co-relation 7768. Up to 833 conditions per place. [2024-06-28 02:11:44,652 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 140 selfloop transitions, 55 changer transitions 0/201 dead transitions. [2024-06-28 02:11:44,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 201 transitions, 2512 flow [2024-06-28 02:11:44,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-28 02:11:44,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2024-06-28 02:11:44,653 INFO L175 Difference]: Start difference. First operand has 107 places, 165 transitions, 1862 flow. Second operand 7 states and 129 transitions. [2024-06-28 02:11:44,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 201 transitions, 2512 flow [2024-06-28 02:11:44,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 201 transitions, 2463 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:44,678 INFO L231 Difference]: Finished difference. Result has 109 places, 169 transitions, 1976 flow [2024-06-28 02:11:44,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1813, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1976, PETRI_PLACES=109, PETRI_TRANSITIONS=169} [2024-06-28 02:11:44,679 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 70 predicate places. [2024-06-28 02:11:44,679 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 169 transitions, 1976 flow [2024-06-28 02:11:44,679 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-28 02:11:44,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:44,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:44,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:11:44,679 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:44,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1169212827, now seen corresponding path program 2 times [2024-06-28 02:11:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379922696] [2024-06-28 02:11:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379922696] [2024-06-28 02:11:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379922696] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:45,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:45,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:45,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023892269] [2024-06-28 02:11:45,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:45,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:45,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:45,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:45,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 169 transitions, 1976 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-28 02:11:45,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:45,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:45,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:45,454 INFO L124 PetriNetUnfolderBase]: 822/1513 cut-off events. [2024-06-28 02:11:45,454 INFO L125 PetriNetUnfolderBase]: For 9415/9415 co-relation queries the response was YES. [2024-06-28 02:11:45,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8050 conditions, 1513 events. 822/1513 cut-off events. For 9415/9415 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8325 event pairs, 163 based on Foata normal form. 1/1457 useless extension candidates. Maximal degree in co-relation 7995. Up to 1072 conditions per place. [2024-06-28 02:11:45,464 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 130 selfloop transitions, 66 changer transitions 0/202 dead transitions. [2024-06-28 02:11:45,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 202 transitions, 2566 flow [2024-06-28 02:11:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-28 02:11:45,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-28 02:11:45,466 INFO L175 Difference]: Start difference. First operand has 109 places, 169 transitions, 1976 flow. Second operand 7 states and 120 transitions. [2024-06-28 02:11:45,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 202 transitions, 2566 flow [2024-06-28 02:11:45,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 202 transitions, 2494 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:45,492 INFO L231 Difference]: Finished difference. Result has 113 places, 174 transitions, 2124 flow [2024-06-28 02:11:45,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2124, PETRI_PLACES=113, PETRI_TRANSITIONS=174} [2024-06-28 02:11:45,492 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2024-06-28 02:11:45,493 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 174 transitions, 2124 flow [2024-06-28 02:11:45,493 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-28 02:11:45,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:45,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:45,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 02:11:45,493 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:45,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1172937632, now seen corresponding path program 1 times [2024-06-28 02:11:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781243730] [2024-06-28 02:11:45,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:45,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:45,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:45,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781243730] [2024-06-28 02:11:45,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781243730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:45,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:45,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:45,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136750864] [2024-06-28 02:11:45,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:45,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:45,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:45,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:45,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:45,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:45,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 174 transitions, 2124 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-28 02:11:45,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:45,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:45,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:46,197 INFO L124 PetriNetUnfolderBase]: 866/1573 cut-off events. [2024-06-28 02:11:46,198 INFO L125 PetriNetUnfolderBase]: For 11543/11543 co-relation queries the response was YES. [2024-06-28 02:11:46,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8527 conditions, 1573 events. 866/1573 cut-off events. For 11543/11543 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8684 event pairs, 139 based on Foata normal form. 2/1519 useless extension candidates. Maximal degree in co-relation 8471. Up to 804 conditions per place. [2024-06-28 02:11:46,207 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 132 selfloop transitions, 73 changer transitions 0/211 dead transitions. [2024-06-28 02:11:46,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 211 transitions, 2820 flow [2024-06-28 02:11:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-28 02:11:46,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224489795918368 [2024-06-28 02:11:46,209 INFO L175 Difference]: Start difference. First operand has 113 places, 174 transitions, 2124 flow. Second operand 7 states and 128 transitions. [2024-06-28 02:11:46,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 211 transitions, 2820 flow [2024-06-28 02:11:46,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 211 transitions, 2670 flow, removed 13 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:46,236 INFO L231 Difference]: Finished difference. Result has 116 places, 184 transitions, 2299 flow [2024-06-28 02:11:46,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1980, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2299, PETRI_PLACES=116, PETRI_TRANSITIONS=184} [2024-06-28 02:11:46,237 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 77 predicate places. [2024-06-28 02:11:46,237 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 184 transitions, 2299 flow [2024-06-28 02:11:46,237 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-28 02:11:46,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:46,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:46,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-28 02:11:46,237 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:46,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:46,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1172932052, now seen corresponding path program 2 times [2024-06-28 02:11:46,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:46,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898555569] [2024-06-28 02:11:46,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:46,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:46,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898555569] [2024-06-28 02:11:46,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898555569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:46,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:46,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:46,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240756400] [2024-06-28 02:11:46,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:46,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:46,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:46,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:46,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:46,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:46,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 184 transitions, 2299 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-28 02:11:46,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:46,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:46,931 INFO L124 PetriNetUnfolderBase]: 858/1552 cut-off events. [2024-06-28 02:11:46,931 INFO L125 PetriNetUnfolderBase]: For 11599/11605 co-relation queries the response was YES. [2024-06-28 02:11:46,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8779 conditions, 1552 events. 858/1552 cut-off events. For 11599/11605 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8547 event pairs, 125 based on Foata normal form. 10/1508 useless extension candidates. Maximal degree in co-relation 8721. Up to 800 conditions per place. [2024-06-28 02:11:46,940 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 137 selfloop transitions, 73 changer transitions 0/216 dead transitions. [2024-06-28 02:11:46,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 216 transitions, 2920 flow [2024-06-28 02:11:46,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:46,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 02:11:46,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-28 02:11:46,945 INFO L175 Difference]: Start difference. First operand has 116 places, 184 transitions, 2299 flow. Second operand 7 states and 133 transitions. [2024-06-28 02:11:46,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 216 transitions, 2920 flow [2024-06-28 02:11:46,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 216 transitions, 2855 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:46,978 INFO L231 Difference]: Finished difference. Result has 120 places, 184 transitions, 2395 flow [2024-06-28 02:11:46,978 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2234, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2395, PETRI_PLACES=120, PETRI_TRANSITIONS=184} [2024-06-28 02:11:46,979 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 81 predicate places. [2024-06-28 02:11:46,979 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 184 transitions, 2395 flow [2024-06-28 02:11:46,979 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-28 02:11:46,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:46,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:46,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 02:11:46,979 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:46,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:46,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2019601658, now seen corresponding path program 3 times [2024-06-28 02:11:46,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:46,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739339840] [2024-06-28 02:11:46,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:47,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739339840] [2024-06-28 02:11:47,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739339840] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:47,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:47,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:47,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462746061] [2024-06-28 02:11:47,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:47,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:47,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:47,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:47,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:47,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 184 transitions, 2395 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-28 02:11:47,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:47,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:47,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:47,692 INFO L124 PetriNetUnfolderBase]: 867/1568 cut-off events. [2024-06-28 02:11:47,692 INFO L125 PetriNetUnfolderBase]: For 13370/13370 co-relation queries the response was YES. [2024-06-28 02:11:47,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9023 conditions, 1568 events. 867/1568 cut-off events. For 13370/13370 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8581 event pairs, 186 based on Foata normal form. 2/1517 useless extension candidates. Maximal degree in co-relation 8964. Up to 1319 conditions per place. [2024-06-28 02:11:47,702 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 177 selfloop transitions, 24 changer transitions 0/207 dead transitions. [2024-06-28 02:11:47,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 207 transitions, 2915 flow [2024-06-28 02:11:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2024-06-28 02:11:47,705 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47346938775510206 [2024-06-28 02:11:47,705 INFO L175 Difference]: Start difference. First operand has 120 places, 184 transitions, 2395 flow. Second operand 7 states and 116 transitions. [2024-06-28 02:11:47,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 207 transitions, 2915 flow [2024-06-28 02:11:47,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 207 transitions, 2774 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:47,741 INFO L231 Difference]: Finished difference. Result has 122 places, 187 transitions, 2352 flow [2024-06-28 02:11:47,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2256, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2352, PETRI_PLACES=122, PETRI_TRANSITIONS=187} [2024-06-28 02:11:47,742 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 83 predicate places. [2024-06-28 02:11:47,742 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 187 transitions, 2352 flow [2024-06-28 02:11:47,742 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-28 02:11:47,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:47,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:47,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-28 02:11:47,742 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:47,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash -2019305701, now seen corresponding path program 1 times [2024-06-28 02:11:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:47,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578783617] [2024-06-28 02:11:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:48,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:48,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:48,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578783617] [2024-06-28 02:11:48,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578783617] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:48,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:48,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800394033] [2024-06-28 02:11:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:48,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:48,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:48,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:48,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:48,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 187 transitions, 2352 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-28 02:11:48,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:48,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:48,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:48,745 INFO L124 PetriNetUnfolderBase]: 869/1570 cut-off events. [2024-06-28 02:11:48,746 INFO L125 PetriNetUnfolderBase]: For 12572/12572 co-relation queries the response was YES. [2024-06-28 02:11:48,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8855 conditions, 1570 events. 869/1570 cut-off events. For 12572/12572 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8564 event pairs, 179 based on Foata normal form. 1/1518 useless extension candidates. Maximal degree in co-relation 8795. Up to 1336 conditions per place. [2024-06-28 02:11:48,776 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 176 selfloop transitions, 29 changer transitions 0/211 dead transitions. [2024-06-28 02:11:48,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 211 transitions, 2919 flow [2024-06-28 02:11:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:48,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-28 02:11:48,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46938775510204084 [2024-06-28 02:11:48,778 INFO L175 Difference]: Start difference. First operand has 122 places, 187 transitions, 2352 flow. Second operand 7 states and 115 transitions. [2024-06-28 02:11:48,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 211 transitions, 2919 flow [2024-06-28 02:11:48,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 211 transitions, 2857 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:48,810 INFO L231 Difference]: Finished difference. Result has 125 places, 194 transitions, 2476 flow [2024-06-28 02:11:48,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2298, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2476, PETRI_PLACES=125, PETRI_TRANSITIONS=194} [2024-06-28 02:11:48,811 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 86 predicate places. [2024-06-28 02:11:48,811 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 194 transitions, 2476 flow [2024-06-28 02:11:48,811 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-28 02:11:48,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:48,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:48,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-28 02:11:48,812 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:48,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:48,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1883002816, now seen corresponding path program 1 times [2024-06-28 02:11:48,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:48,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782011730] [2024-06-28 02:11:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:48,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:49,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:49,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782011730] [2024-06-28 02:11:49,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782011730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:49,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:49,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:49,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143442266] [2024-06-28 02:11:49,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:49,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:49,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:49,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:49,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:49,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:49,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 194 transitions, 2476 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-28 02:11:49,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:49,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:49,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:49,807 INFO L124 PetriNetUnfolderBase]: 962/1734 cut-off events. [2024-06-28 02:11:49,807 INFO L125 PetriNetUnfolderBase]: For 16181/16181 co-relation queries the response was YES. [2024-06-28 02:11:49,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9781 conditions, 1734 events. 962/1734 cut-off events. For 16181/16181 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 9772 event pairs, 124 based on Foata normal form. 2/1682 useless extension candidates. Maximal degree in co-relation 9719. Up to 749 conditions per place. [2024-06-28 02:11:49,819 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 155 selfloop transitions, 78 changer transitions 0/239 dead transitions. [2024-06-28 02:11:49,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 239 transitions, 3300 flow [2024-06-28 02:11:49,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-28 02:11:49,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-28 02:11:49,821 INFO L175 Difference]: Start difference. First operand has 125 places, 194 transitions, 2476 flow. Second operand 8 states and 150 transitions. [2024-06-28 02:11:49,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 239 transitions, 3300 flow [2024-06-28 02:11:49,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 239 transitions, 3263 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-28 02:11:49,873 INFO L231 Difference]: Finished difference. Result has 131 places, 201 transitions, 2706 flow [2024-06-28 02:11:49,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2439, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2706, PETRI_PLACES=131, PETRI_TRANSITIONS=201} [2024-06-28 02:11:49,874 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 92 predicate places. [2024-06-28 02:11:49,874 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 201 transitions, 2706 flow [2024-06-28 02:11:49,874 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-28 02:11:49,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:49,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:49,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-28 02:11:49,875 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:49,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash 561708650, now seen corresponding path program 2 times [2024-06-28 02:11:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861307130] [2024-06-28 02:11:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:50,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:50,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861307130] [2024-06-28 02:11:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861307130] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:50,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425815366] [2024-06-28 02:11:50,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:50,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:50,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:50,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:50,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:50,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 201 transitions, 2706 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-28 02:11:50,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:50,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:50,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:51,029 INFO L124 PetriNetUnfolderBase]: 971/1765 cut-off events. [2024-06-28 02:11:51,030 INFO L125 PetriNetUnfolderBase]: For 18270/18270 co-relation queries the response was YES. [2024-06-28 02:11:51,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10322 conditions, 1765 events. 971/1765 cut-off events. For 18270/18270 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10037 event pairs, 182 based on Foata normal form. 2/1709 useless extension candidates. Maximal degree in co-relation 10258. Up to 1223 conditions per place. [2024-06-28 02:11:51,041 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 161 selfloop transitions, 84 changer transitions 0/251 dead transitions. [2024-06-28 02:11:51,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 251 transitions, 3536 flow [2024-06-28 02:11:51,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:11:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:11:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2024-06-28 02:11:51,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2024-06-28 02:11:51,042 INFO L175 Difference]: Start difference. First operand has 131 places, 201 transitions, 2706 flow. Second operand 9 states and 156 transitions. [2024-06-28 02:11:51,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 251 transitions, 3536 flow [2024-06-28 02:11:51,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 251 transitions, 3388 flow, removed 23 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:51,094 INFO L231 Difference]: Finished difference. Result has 137 places, 209 transitions, 2893 flow [2024-06-28 02:11:51,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2573, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2893, PETRI_PLACES=137, PETRI_TRANSITIONS=209} [2024-06-28 02:11:51,095 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 98 predicate places. [2024-06-28 02:11:51,095 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 209 transitions, 2893 flow [2024-06-28 02:11:51,095 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-28 02:11:51,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:51,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:51,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-28 02:11:51,096 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:51,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:51,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1834311532, now seen corresponding path program 1 times [2024-06-28 02:11:51,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:51,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178787935] [2024-06-28 02:11:51,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:51,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178787935] [2024-06-28 02:11:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178787935] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:51,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:51,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:11:51,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233427394] [2024-06-28 02:11:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:51,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:11:51,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:51,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:11:51,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:11:51,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:51,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 209 transitions, 2893 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:51,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:51,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:51,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:51,961 INFO L124 PetriNetUnfolderBase]: 967/1744 cut-off events. [2024-06-28 02:11:51,961 INFO L125 PetriNetUnfolderBase]: For 18097/18097 co-relation queries the response was YES. [2024-06-28 02:11:51,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10414 conditions, 1744 events. 967/1744 cut-off events. For 18097/18097 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9845 event pairs, 174 based on Foata normal form. 2/1692 useless extension candidates. Maximal degree in co-relation 10347. Up to 1131 conditions per place. [2024-06-28 02:11:51,972 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 156 selfloop transitions, 73 changer transitions 0/235 dead transitions. [2024-06-28 02:11:51,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 235 transitions, 3504 flow [2024-06-28 02:11:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:51,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:51,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2024-06-28 02:11:51,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5183673469387755 [2024-06-28 02:11:51,974 INFO L175 Difference]: Start difference. First operand has 137 places, 209 transitions, 2893 flow. Second operand 7 states and 127 transitions. [2024-06-28 02:11:51,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 235 transitions, 3504 flow [2024-06-28 02:11:52,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 235 transitions, 3343 flow, removed 30 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:52,032 INFO L231 Difference]: Finished difference. Result has 139 places, 209 transitions, 2894 flow [2024-06-28 02:11:52,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2732, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2894, PETRI_PLACES=139, PETRI_TRANSITIONS=209} [2024-06-28 02:11:52,033 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 100 predicate places. [2024-06-28 02:11:52,033 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 209 transitions, 2894 flow [2024-06-28 02:11:52,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:11:52,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:52,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:52,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-28 02:11:52,034 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:52,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:52,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2001335644, now seen corresponding path program 1 times [2024-06-28 02:11:52,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:52,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803320384] [2024-06-28 02:11:52,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:52,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803320384] [2024-06-28 02:11:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803320384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:52,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:52,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081482436] [2024-06-28 02:11:52,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:52,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:52,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:52,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:52,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:52,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 209 transitions, 2894 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-28 02:11:52,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:52,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:52,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:53,149 INFO L124 PetriNetUnfolderBase]: 1062/1912 cut-off events. [2024-06-28 02:11:53,149 INFO L125 PetriNetUnfolderBase]: For 22605/22605 co-relation queries the response was YES. [2024-06-28 02:11:53,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11169 conditions, 1912 events. 1062/1912 cut-off events. For 22605/22605 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11088 event pairs, 156 based on Foata normal form. 14/1871 useless extension candidates. Maximal degree in co-relation 11100. Up to 993 conditions per place. [2024-06-28 02:11:53,161 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 156 selfloop transitions, 86 changer transitions 0/248 dead transitions. [2024-06-28 02:11:53,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 248 transitions, 3611 flow [2024-06-28 02:11:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:53,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 150 transitions. [2024-06-28 02:11:53,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-06-28 02:11:53,164 INFO L175 Difference]: Start difference. First operand has 139 places, 209 transitions, 2894 flow. Second operand 8 states and 150 transitions. [2024-06-28 02:11:53,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 248 transitions, 3611 flow [2024-06-28 02:11:53,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 248 transitions, 3511 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:53,254 INFO L231 Difference]: Finished difference. Result has 143 places, 212 transitions, 3006 flow [2024-06-28 02:11:53,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2794, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3006, PETRI_PLACES=143, PETRI_TRANSITIONS=212} [2024-06-28 02:11:53,254 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 104 predicate places. [2024-06-28 02:11:53,255 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 212 transitions, 3006 flow [2024-06-28 02:11:53,255 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-28 02:11:53,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:53,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:53,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-28 02:11:53,255 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:53,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1826033402, now seen corresponding path program 2 times [2024-06-28 02:11:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801433380] [2024-06-28 02:11:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:53,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801433380] [2024-06-28 02:11:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801433380] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:53,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:53,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:53,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628485702] [2024-06-28 02:11:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:53,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:53,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:53,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 212 transitions, 3006 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-28 02:11:53,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:53,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:53,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:54,274 INFO L124 PetriNetUnfolderBase]: 1077/1936 cut-off events. [2024-06-28 02:11:54,274 INFO L125 PetriNetUnfolderBase]: For 21975/21975 co-relation queries the response was YES. [2024-06-28 02:11:54,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11480 conditions, 1936 events. 1077/1936 cut-off events. For 21975/21975 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11201 event pairs, 255 based on Foata normal form. 2/1884 useless extension candidates. Maximal degree in co-relation 11410. Up to 1676 conditions per place. [2024-06-28 02:11:54,288 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 199 selfloop transitions, 31 changer transitions 0/236 dead transitions. [2024-06-28 02:11:54,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 236 transitions, 3570 flow [2024-06-28 02:11:54,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:54,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-28 02:11:54,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-28 02:11:54,290 INFO L175 Difference]: Start difference. First operand has 143 places, 212 transitions, 3006 flow. Second operand 8 states and 130 transitions. [2024-06-28 02:11:54,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 236 transitions, 3570 flow [2024-06-28 02:11:54,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 236 transitions, 3390 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:54,352 INFO L231 Difference]: Finished difference. Result has 145 places, 214 transitions, 2922 flow [2024-06-28 02:11:54,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2826, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2922, PETRI_PLACES=145, PETRI_TRANSITIONS=214} [2024-06-28 02:11:54,353 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 106 predicate places. [2024-06-28 02:11:54,353 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 214 transitions, 2922 flow [2024-06-28 02:11:54,353 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-28 02:11:54,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:54,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:54,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-28 02:11:54,354 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:54,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1690296864, now seen corresponding path program 3 times [2024-06-28 02:11:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:54,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824616008] [2024-06-28 02:11:54,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:54,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:54,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824616008] [2024-06-28 02:11:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824616008] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:54,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:54,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:54,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106307231] [2024-06-28 02:11:54,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:54,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:54,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:54,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:54,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:54,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:54,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 214 transitions, 2922 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-28 02:11:54,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:54,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:54,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:55,388 INFO L124 PetriNetUnfolderBase]: 1092/1961 cut-off events. [2024-06-28 02:11:55,389 INFO L125 PetriNetUnfolderBase]: For 21479/21479 co-relation queries the response was YES. [2024-06-28 02:11:55,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11330 conditions, 1961 events. 1092/1961 cut-off events. For 21479/21479 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11352 event pairs, 261 based on Foata normal form. 2/1909 useless extension candidates. Maximal degree in co-relation 11259. Up to 1670 conditions per place. [2024-06-28 02:11:55,402 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 198 selfloop transitions, 38 changer transitions 0/242 dead transitions. [2024-06-28 02:11:55,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 242 transitions, 3529 flow [2024-06-28 02:11:55,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:55,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-28 02:11:55,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2024-06-28 02:11:55,404 INFO L175 Difference]: Start difference. First operand has 145 places, 214 transitions, 2922 flow. Second operand 8 states and 131 transitions. [2024-06-28 02:11:55,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 242 transitions, 3529 flow [2024-06-28 02:11:55,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 242 transitions, 3451 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:55,465 INFO L231 Difference]: Finished difference. Result has 147 places, 216 transitions, 2957 flow [2024-06-28 02:11:55,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2844, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2957, PETRI_PLACES=147, PETRI_TRANSITIONS=216} [2024-06-28 02:11:55,465 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 108 predicate places. [2024-06-28 02:11:55,466 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 216 transitions, 2957 flow [2024-06-28 02:11:55,466 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-28 02:11:55,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:55,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:55,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-28 02:11:55,466 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:55,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:55,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1889651368, now seen corresponding path program 4 times [2024-06-28 02:11:55,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:55,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454368968] [2024-06-28 02:11:55,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:55,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:55,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454368968] [2024-06-28 02:11:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454368968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:55,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:11:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692062705] [2024-06-28 02:11:55,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:55,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:11:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:55,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:11:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:11:56,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:56,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 216 transitions, 2957 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-28 02:11:56,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:56,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:56,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:56,442 INFO L124 PetriNetUnfolderBase]: 1095/1966 cut-off events. [2024-06-28 02:11:56,442 INFO L125 PetriNetUnfolderBase]: For 21747/21747 co-relation queries the response was YES. [2024-06-28 02:11:56,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11380 conditions, 1966 events. 1095/1966 cut-off events. For 21747/21747 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11375 event pairs, 260 based on Foata normal form. 2/1914 useless extension candidates. Maximal degree in co-relation 11308. Up to 1717 conditions per place. [2024-06-28 02:11:56,455 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 208 selfloop transitions, 28 changer transitions 0/242 dead transitions. [2024-06-28 02:11:56,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 242 transitions, 3549 flow [2024-06-28 02:11:56,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-28 02:11:56,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-28 02:11:56,457 INFO L175 Difference]: Start difference. First operand has 147 places, 216 transitions, 2957 flow. Second operand 8 states and 129 transitions. [2024-06-28 02:11:56,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 242 transitions, 3549 flow [2024-06-28 02:11:56,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 242 transitions, 3452 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-28 02:11:56,515 INFO L231 Difference]: Finished difference. Result has 150 places, 221 transitions, 2989 flow [2024-06-28 02:11:56,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2860, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2989, PETRI_PLACES=150, PETRI_TRANSITIONS=221} [2024-06-28 02:11:56,516 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-28 02:11:56,516 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 221 transitions, 2989 flow [2024-06-28 02:11:56,516 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-28 02:11:56,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:56,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:56,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-28 02:11:56,517 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:56,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1889977116, now seen corresponding path program 1 times [2024-06-28 02:11:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141339728] [2024-06-28 02:11:56,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:56,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:56,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141339728] [2024-06-28 02:11:56,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141339728] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:56,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:56,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:56,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224989233] [2024-06-28 02:11:56,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:56,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:56,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:56,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:56,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:56,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:56,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 221 transitions, 2989 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-28 02:11:56,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:56,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:56,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:57,322 INFO L124 PetriNetUnfolderBase]: 1094/1965 cut-off events. [2024-06-28 02:11:57,322 INFO L125 PetriNetUnfolderBase]: For 22255/22255 co-relation queries the response was YES. [2024-06-28 02:11:57,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11409 conditions, 1965 events. 1094/1965 cut-off events. For 22255/22255 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11454 event pairs, 263 based on Foata normal form. 1/1912 useless extension candidates. Maximal degree in co-relation 11335. Up to 1695 conditions per place. [2024-06-28 02:11:57,335 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 204 selfloop transitions, 33 changer transitions 0/243 dead transitions. [2024-06-28 02:11:57,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 243 transitions, 3587 flow [2024-06-28 02:11:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:11:57,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:11:57,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-06-28 02:11:57,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2024-06-28 02:11:57,337 INFO L175 Difference]: Start difference. First operand has 150 places, 221 transitions, 2989 flow. Second operand 7 states and 117 transitions. [2024-06-28 02:11:57,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 243 transitions, 3587 flow [2024-06-28 02:11:57,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 243 transitions, 3490 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-28 02:11:57,401 INFO L231 Difference]: Finished difference. Result has 152 places, 224 transitions, 3020 flow [2024-06-28 02:11:57,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=2892, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3020, PETRI_PLACES=152, PETRI_TRANSITIONS=224} [2024-06-28 02:11:57,402 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 113 predicate places. [2024-06-28 02:11:57,402 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 224 transitions, 3020 flow [2024-06-28 02:11:57,402 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-28 02:11:57,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:57,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:57,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-28 02:11:57,403 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:57,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1722823421, now seen corresponding path program 1 times [2024-06-28 02:11:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032368607] [2024-06-28 02:11:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:57,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:57,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032368607] [2024-06-28 02:11:57,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032368607] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:57,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:57,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:11:57,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013070148] [2024-06-28 02:11:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:57,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:11:57,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:57,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:11:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:11:57,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 02:11:57,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 224 transitions, 3020 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-28 02:11:57,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:57,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 02:11:57,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:57,627 INFO L124 PetriNetUnfolderBase]: 529/1087 cut-off events. [2024-06-28 02:11:57,627 INFO L125 PetriNetUnfolderBase]: For 9542/9639 co-relation queries the response was YES. [2024-06-28 02:11:57,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5197 conditions, 1087 events. 529/1087 cut-off events. For 9542/9639 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6305 event pairs, 86 based on Foata normal form. 138/1172 useless extension candidates. Maximal degree in co-relation 5123. Up to 426 conditions per place. [2024-06-28 02:11:57,654 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 64 selfloop transitions, 22 changer transitions 0/136 dead transitions. [2024-06-28 02:11:57,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 136 transitions, 1854 flow [2024-06-28 02:11:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:11:57,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:11:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-06-28 02:11:57,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2024-06-28 02:11:57,655 INFO L175 Difference]: Start difference. First operand has 152 places, 224 transitions, 3020 flow. Second operand 4 states and 93 transitions. [2024-06-28 02:11:57,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 136 transitions, 1854 flow [2024-06-28 02:11:57,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 136 transitions, 1385 flow, removed 20 selfloop flow, removed 32 redundant places. [2024-06-28 02:11:57,683 INFO L231 Difference]: Finished difference. Result has 125 places, 123 transitions, 1243 flow [2024-06-28 02:11:57,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1243, PETRI_PLACES=125, PETRI_TRANSITIONS=123} [2024-06-28 02:11:57,684 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 86 predicate places. [2024-06-28 02:11:57,684 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 123 transitions, 1243 flow [2024-06-28 02:11:57,684 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-28 02:11:57,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:57,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:57,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-28 02:11:57,685 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:57,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1806607981, now seen corresponding path program 1 times [2024-06-28 02:11:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:57,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393211587] [2024-06-28 02:11:57,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393211587] [2024-06-28 02:11:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393211587] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:58,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:58,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730995246] [2024-06-28 02:11:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:58,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:58,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:58,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:58,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:58,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:58,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 123 transitions, 1243 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-28 02:11:58,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:58,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:58,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:58,507 INFO L124 PetriNetUnfolderBase]: 829/1558 cut-off events. [2024-06-28 02:11:58,507 INFO L125 PetriNetUnfolderBase]: For 17243/17243 co-relation queries the response was YES. [2024-06-28 02:11:58,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7246 conditions, 1558 events. 829/1558 cut-off events. For 17243/17243 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8753 event pairs, 237 based on Foata normal form. 8/1510 useless extension candidates. Maximal degree in co-relation 7185. Up to 713 conditions per place. [2024-06-28 02:11:58,515 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 114 selfloop transitions, 38 changer transitions 0/159 dead transitions. [2024-06-28 02:11:58,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 159 transitions, 1775 flow [2024-06-28 02:11:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:58,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 02:11:58,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-28 02:11:58,517 INFO L175 Difference]: Start difference. First operand has 125 places, 123 transitions, 1243 flow. Second operand 8 states and 141 transitions. [2024-06-28 02:11:58,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 159 transitions, 1775 flow [2024-06-28 02:11:58,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 159 transitions, 1742 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:58,557 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 1332 flow [2024-06-28 02:11:58,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1332, PETRI_PLACES=129, PETRI_TRANSITIONS=125} [2024-06-28 02:11:58,557 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 90 predicate places. [2024-06-28 02:11:58,557 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 1332 flow [2024-06-28 02:11:58,558 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-28 02:11:58,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:58,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:58,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-28 02:11:58,558 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:58,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1754580267, now seen corresponding path program 2 times [2024-06-28 02:11:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:58,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404957819] [2024-06-28 02:11:58,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:58,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:59,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:59,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404957819] [2024-06-28 02:11:59,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404957819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:59,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:59,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778338782] [2024-06-28 02:11:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:59,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:59,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:59,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:11:59,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:11:59,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 1332 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-28 02:11:59,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:11:59,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:11:59,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:11:59,413 INFO L124 PetriNetUnfolderBase]: 1005/1898 cut-off events. [2024-06-28 02:11:59,413 INFO L125 PetriNetUnfolderBase]: For 25737/25737 co-relation queries the response was YES. [2024-06-28 02:11:59,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9077 conditions, 1898 events. 1005/1898 cut-off events. For 25737/25737 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 11385 event pairs, 362 based on Foata normal form. 8/1844 useless extension candidates. Maximal degree in co-relation 9015. Up to 959 conditions per place. [2024-06-28 02:11:59,424 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 108 selfloop transitions, 45 changer transitions 0/160 dead transitions. [2024-06-28 02:11:59,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 160 transitions, 1877 flow [2024-06-28 02:11:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:11:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:11:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 02:11:59,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-28 02:11:59,425 INFO L175 Difference]: Start difference. First operand has 129 places, 125 transitions, 1332 flow. Second operand 8 states and 141 transitions. [2024-06-28 02:11:59,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 160 transitions, 1877 flow [2024-06-28 02:11:59,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 160 transitions, 1827 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 02:11:59,483 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 1454 flow [2024-06-28 02:11:59,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1282, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1454, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2024-06-28 02:11:59,483 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 95 predicate places. [2024-06-28 02:11:59,484 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 1454 flow [2024-06-28 02:11:59,484 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-28 02:11:59,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:11:59,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:11:59,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-28 02:11:59,484 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:11:59,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:11:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1029083151, now seen corresponding path program 3 times [2024-06-28 02:11:59,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:11:59,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869846078] [2024-06-28 02:11:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:11:59,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:11:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:11:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:11:59,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:11:59,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869846078] [2024-06-28 02:11:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869846078] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:11:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:11:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:11:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817980372] [2024-06-28 02:11:59,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:11:59,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:11:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:11:59,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:11:59,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:00,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:00,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 1454 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-28 02:12:00,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:00,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:00,394 INFO L124 PetriNetUnfolderBase]: 1008/1904 cut-off events. [2024-06-28 02:12:00,395 INFO L125 PetriNetUnfolderBase]: For 24515/24515 co-relation queries the response was YES. [2024-06-28 02:12:00,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9148 conditions, 1904 events. 1008/1904 cut-off events. For 24515/24515 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11401 event pairs, 407 based on Foata normal form. 10/1847 useless extension candidates. Maximal degree in co-relation 9083. Up to 1433 conditions per place. [2024-06-28 02:12:00,405 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 102 selfloop transitions, 46 changer transitions 0/155 dead transitions. [2024-06-28 02:12:00,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 1867 flow [2024-06-28 02:12:00,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 133 transitions. [2024-06-28 02:12:00,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-06-28 02:12:00,407 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 1454 flow. Second operand 8 states and 133 transitions. [2024-06-28 02:12:00,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 1867 flow [2024-06-28 02:12:00,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 155 transitions, 1798 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:00,459 INFO L231 Difference]: Finished difference. Result has 138 places, 130 transitions, 1512 flow [2024-06-28 02:12:00,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1385, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1512, PETRI_PLACES=138, PETRI_TRANSITIONS=130} [2024-06-28 02:12:00,459 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 99 predicate places. [2024-06-28 02:12:00,460 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 130 transitions, 1512 flow [2024-06-28 02:12:00,460 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-28 02:12:00,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:00,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:00,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-28 02:12:00,460 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:00,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1743071701, now seen corresponding path program 4 times [2024-06-28 02:12:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936186433] [2024-06-28 02:12:00,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:00,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:00,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:00,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936186433] [2024-06-28 02:12:00,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936186433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:00,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:00,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:00,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079372952] [2024-06-28 02:12:00,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:00,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:00,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:00,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:00,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:00,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 130 transitions, 1512 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-28 02:12:00,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:00,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:00,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:01,243 INFO L124 PetriNetUnfolderBase]: 1122/2121 cut-off events. [2024-06-28 02:12:01,243 INFO L125 PetriNetUnfolderBase]: For 28985/28987 co-relation queries the response was YES. [2024-06-28 02:12:01,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10344 conditions, 2121 events. 1122/2121 cut-off events. For 28985/28987 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 13236 event pairs, 362 based on Foata normal form. 10/2064 useless extension candidates. Maximal degree in co-relation 10277. Up to 1213 conditions per place. [2024-06-28 02:12:01,254 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 115 selfloop transitions, 46 changer transitions 0/168 dead transitions. [2024-06-28 02:12:01,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 168 transitions, 2084 flow [2024-06-28 02:12:01,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-28 02:12:01,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-28 02:12:01,268 INFO L175 Difference]: Start difference. First operand has 138 places, 130 transitions, 1512 flow. Second operand 8 states and 144 transitions. [2024-06-28 02:12:01,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 168 transitions, 2084 flow [2024-06-28 02:12:01,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 168 transitions, 1994 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:01,328 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 1568 flow [2024-06-28 02:12:01,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1568, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2024-06-28 02:12:01,328 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 101 predicate places. [2024-06-28 02:12:01,328 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 1568 flow [2024-06-28 02:12:01,328 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-28 02:12:01,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:01,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:01,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-28 02:12:01,329 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:01,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:01,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1906141533, now seen corresponding path program 5 times [2024-06-28 02:12:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:01,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468824959] [2024-06-28 02:12:01,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:01,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:01,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468824959] [2024-06-28 02:12:01,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468824959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:01,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:01,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473350587] [2024-06-28 02:12:01,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:01,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:01,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:01,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:01,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:01,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:01,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 1568 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-28 02:12:01,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:01,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:01,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:02,172 INFO L124 PetriNetUnfolderBase]: 1168/2212 cut-off events. [2024-06-28 02:12:02,172 INFO L125 PetriNetUnfolderBase]: For 31517/31519 co-relation queries the response was YES. [2024-06-28 02:12:02,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10720 conditions, 2212 events. 1168/2212 cut-off events. For 31517/31519 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 13971 event pairs, 486 based on Foata normal form. 14/2159 useless extension candidates. Maximal degree in co-relation 10652. Up to 1660 conditions per place. [2024-06-28 02:12:02,184 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 109 selfloop transitions, 47 changer transitions 0/163 dead transitions. [2024-06-28 02:12:02,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 163 transitions, 2026 flow [2024-06-28 02:12:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:02,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:02,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-28 02:12:02,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2024-06-28 02:12:02,185 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 1568 flow. Second operand 8 states and 138 transitions. [2024-06-28 02:12:02,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 163 transitions, 2026 flow [2024-06-28 02:12:02,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 163 transitions, 1930 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 02:12:02,251 INFO L231 Difference]: Finished difference. Result has 143 places, 134 transitions, 1611 flow [2024-06-28 02:12:02,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1611, PETRI_PLACES=143, PETRI_TRANSITIONS=134} [2024-06-28 02:12:02,252 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 104 predicate places. [2024-06-28 02:12:02,252 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 134 transitions, 1611 flow [2024-06-28 02:12:02,252 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-28 02:12:02,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:02,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:02,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-28 02:12:02,253 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:02,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1906285683, now seen corresponding path program 6 times [2024-06-28 02:12:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:02,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69823099] [2024-06-28 02:12:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69823099] [2024-06-28 02:12:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69823099] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958453532] [2024-06-28 02:12:02,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:02,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:02,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:02,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:02,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:02,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 134 transitions, 1611 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-28 02:12:02,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:02,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:02,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:03,193 INFO L124 PetriNetUnfolderBase]: 1155/2188 cut-off events. [2024-06-28 02:12:03,193 INFO L125 PetriNetUnfolderBase]: For 26556/26558 co-relation queries the response was YES. [2024-06-28 02:12:03,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10452 conditions, 2188 events. 1155/2188 cut-off events. For 26556/26558 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 13817 event pairs, 406 based on Foata normal form. 12/2130 useless extension candidates. Maximal degree in co-relation 10383. Up to 1658 conditions per place. [2024-06-28 02:12:03,206 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 108 selfloop transitions, 50 changer transitions 0/165 dead transitions. [2024-06-28 02:12:03,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 165 transitions, 2045 flow [2024-06-28 02:12:03,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 02:12:03,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035714285714286 [2024-06-28 02:12:03,208 INFO L175 Difference]: Start difference. First operand has 143 places, 134 transitions, 1611 flow. Second operand 8 states and 141 transitions. [2024-06-28 02:12:03,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 165 transitions, 2045 flow [2024-06-28 02:12:03,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 165 transitions, 1936 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:03,285 INFO L231 Difference]: Finished difference. Result has 145 places, 134 transitions, 1611 flow [2024-06-28 02:12:03,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1611, PETRI_PLACES=145, PETRI_TRANSITIONS=134} [2024-06-28 02:12:03,285 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 106 predicate places. [2024-06-28 02:12:03,285 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 134 transitions, 1611 flow [2024-06-28 02:12:03,286 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-28 02:12:03,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:03,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:03,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-28 02:12:03,286 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:03,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1911855825, now seen corresponding path program 1 times [2024-06-28 02:12:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:03,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278914117] [2024-06-28 02:12:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:03,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278914117] [2024-06-28 02:12:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278914117] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:03,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950431647] [2024-06-28 02:12:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:03,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:03,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:03,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:03,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:03,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 1611 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-28 02:12:03,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:03,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:03,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:04,286 INFO L124 PetriNetUnfolderBase]: 1171/2221 cut-off events. [2024-06-28 02:12:04,286 INFO L125 PetriNetUnfolderBase]: For 23437/23437 co-relation queries the response was YES. [2024-06-28 02:12:04,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10576 conditions, 2221 events. 1171/2221 cut-off events. For 23437/23437 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 14061 event pairs, 487 based on Foata normal form. 2/2152 useless extension candidates. Maximal degree in co-relation 10506. Up to 1795 conditions per place. [2024-06-28 02:12:04,297 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 104 selfloop transitions, 46 changer transitions 0/157 dead transitions. [2024-06-28 02:12:04,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 157 transitions, 2021 flow [2024-06-28 02:12:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-28 02:12:04,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4607142857142857 [2024-06-28 02:12:04,299 INFO L175 Difference]: Start difference. First operand has 145 places, 134 transitions, 1611 flow. Second operand 8 states and 129 transitions. [2024-06-28 02:12:04,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 157 transitions, 2021 flow [2024-06-28 02:12:04,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 157 transitions, 1910 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:04,362 INFO L231 Difference]: Finished difference. Result has 146 places, 136 transitions, 1637 flow [2024-06-28 02:12:04,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1637, PETRI_PLACES=146, PETRI_TRANSITIONS=136} [2024-06-28 02:12:04,362 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-06-28 02:12:04,363 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 136 transitions, 1637 flow [2024-06-28 02:12:04,363 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-28 02:12:04,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:04,363 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:04,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-28 02:12:04,363 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:04,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:04,364 INFO L85 PathProgramCache]: Analyzing trace with hash 313719707, now seen corresponding path program 2 times [2024-06-28 02:12:04,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:04,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443506042] [2024-06-28 02:12:04,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:04,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:04,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:04,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:04,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443506042] [2024-06-28 02:12:04,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443506042] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:04,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:04,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:04,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69111680] [2024-06-28 02:12:04,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:04,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:04,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:04,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:04,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:04,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 136 transitions, 1637 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-28 02:12:04,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:04,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:04,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:05,425 INFO L124 PetriNetUnfolderBase]: 1187/2249 cut-off events. [2024-06-28 02:12:05,426 INFO L125 PetriNetUnfolderBase]: For 24722/24722 co-relation queries the response was YES. [2024-06-28 02:12:05,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10771 conditions, 2249 events. 1187/2249 cut-off events. For 24722/24722 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14304 event pairs, 469 based on Foata normal form. 2/2190 useless extension candidates. Maximal degree in co-relation 10700. Up to 1453 conditions per place. [2024-06-28 02:12:05,440 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 105 selfloop transitions, 53 changer transitions 0/165 dead transitions. [2024-06-28 02:12:05,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 165 transitions, 2095 flow [2024-06-28 02:12:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-28 02:12:05,441 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-28 02:12:05,441 INFO L175 Difference]: Start difference. First operand has 146 places, 136 transitions, 1637 flow. Second operand 8 states and 136 transitions. [2024-06-28 02:12:05,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 165 transitions, 2095 flow [2024-06-28 02:12:05,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 165 transitions, 1978 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:05,518 INFO L231 Difference]: Finished difference. Result has 148 places, 138 transitions, 1674 flow [2024-06-28 02:12:05,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1674, PETRI_PLACES=148, PETRI_TRANSITIONS=138} [2024-06-28 02:12:05,519 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 109 predicate places. [2024-06-28 02:12:05,519 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 138 transitions, 1674 flow [2024-06-28 02:12:05,519 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-28 02:12:05,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:05,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:05,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-28 02:12:05,520 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:05,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash 782551559, now seen corresponding path program 3 times [2024-06-28 02:12:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:05,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510835408] [2024-06-28 02:12:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:06,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:06,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510835408] [2024-06-28 02:12:06,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510835408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:06,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:06,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:06,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849833680] [2024-06-28 02:12:06,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:06,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:06,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:06,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:06,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:06,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:06,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 138 transitions, 1674 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-28 02:12:06,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:06,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:06,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:06,660 INFO L124 PetriNetUnfolderBase]: 1187/2249 cut-off events. [2024-06-28 02:12:06,661 INFO L125 PetriNetUnfolderBase]: For 24747/24747 co-relation queries the response was YES. [2024-06-28 02:12:06,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10836 conditions, 2249 events. 1187/2249 cut-off events. For 24747/24747 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14257 event pairs, 506 based on Foata normal form. 2/2190 useless extension candidates. Maximal degree in co-relation 10764. Up to 2063 conditions per place. [2024-06-28 02:12:06,679 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 138 selfloop transitions, 15 changer transitions 0/160 dead transitions. [2024-06-28 02:12:06,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 160 transitions, 2088 flow [2024-06-28 02:12:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:06,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:06,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-28 02:12:06,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43214285714285716 [2024-06-28 02:12:06,681 INFO L175 Difference]: Start difference. First operand has 148 places, 138 transitions, 1674 flow. Second operand 8 states and 121 transitions. [2024-06-28 02:12:06,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 160 transitions, 2088 flow [2024-06-28 02:12:06,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 160 transitions, 1954 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:06,798 INFO L231 Difference]: Finished difference. Result has 150 places, 140 transitions, 1615 flow [2024-06-28 02:12:06,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1615, PETRI_PLACES=150, PETRI_TRANSITIONS=140} [2024-06-28 02:12:06,798 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 111 predicate places. [2024-06-28 02:12:06,798 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 140 transitions, 1615 flow [2024-06-28 02:12:06,798 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-28 02:12:06,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:06,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:06,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-28 02:12:06,799 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:06,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:06,799 INFO L85 PathProgramCache]: Analyzing trace with hash 772461059, now seen corresponding path program 4 times [2024-06-28 02:12:06,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:06,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479323239] [2024-06-28 02:12:06,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:06,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:07,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:07,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479323239] [2024-06-28 02:12:07,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479323239] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:07,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:07,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:07,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55770607] [2024-06-28 02:12:07,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:07,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:07,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:07,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:07,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:07,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:07,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 140 transitions, 1615 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-28 02:12:07,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:07,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:07,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:07,819 INFO L124 PetriNetUnfolderBase]: 1184/2244 cut-off events. [2024-06-28 02:12:07,820 INFO L125 PetriNetUnfolderBase]: For 24201/24201 co-relation queries the response was YES. [2024-06-28 02:12:07,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10553 conditions, 2244 events. 1184/2244 cut-off events. For 24201/24201 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14263 event pairs, 543 based on Foata normal form. 2/2176 useless extension candidates. Maximal degree in co-relation 10480. Up to 2017 conditions per place. [2024-06-28 02:12:07,833 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 136 selfloop transitions, 21 changer transitions 0/164 dead transitions. [2024-06-28 02:12:07,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 164 transitions, 2157 flow [2024-06-28 02:12:07,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-28 02:12:07,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4392857142857143 [2024-06-28 02:12:07,834 INFO L175 Difference]: Start difference. First operand has 150 places, 140 transitions, 1615 flow. Second operand 8 states and 123 transitions. [2024-06-28 02:12:07,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 164 transitions, 2157 flow [2024-06-28 02:12:07,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 164 transitions, 2098 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:07,923 INFO L231 Difference]: Finished difference. Result has 153 places, 144 transitions, 1705 flow [2024-06-28 02:12:07,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1705, PETRI_PLACES=153, PETRI_TRANSITIONS=144} [2024-06-28 02:12:07,924 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 114 predicate places. [2024-06-28 02:12:07,924 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 144 transitions, 1705 flow [2024-06-28 02:12:07,924 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-28 02:12:07,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:07,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:07,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-28 02:12:07,924 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:07,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash 772453619, now seen corresponding path program 5 times [2024-06-28 02:12:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939910564] [2024-06-28 02:12:07,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:07,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:08,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:08,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:08,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939910564] [2024-06-28 02:12:08,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939910564] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:08,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-28 02:12:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850871290] [2024-06-28 02:12:08,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:08,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 02:12:08,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 02:12:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-28 02:12:08,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:08,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 144 transitions, 1705 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-28 02:12:08,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:08,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:08,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:08,841 INFO L124 PetriNetUnfolderBase]: 1181/2239 cut-off events. [2024-06-28 02:12:08,841 INFO L125 PetriNetUnfolderBase]: For 24272/24272 co-relation queries the response was YES. [2024-06-28 02:12:08,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10492 conditions, 2239 events. 1181/2239 cut-off events. For 24272/24272 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14220 event pairs, 549 based on Foata normal form. 2/2170 useless extension candidates. Maximal degree in co-relation 10417. Up to 2063 conditions per place. [2024-06-28 02:12:08,857 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 135 selfloop transitions, 19 changer transitions 0/161 dead transitions. [2024-06-28 02:12:08,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 161 transitions, 2071 flow [2024-06-28 02:12:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:08,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 118 transitions. [2024-06-28 02:12:08,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2024-06-28 02:12:08,858 INFO L175 Difference]: Start difference. First operand has 153 places, 144 transitions, 1705 flow. Second operand 8 states and 118 transitions. [2024-06-28 02:12:08,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 161 transitions, 2071 flow [2024-06-28 02:12:08,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 161 transitions, 1980 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-28 02:12:08,958 INFO L231 Difference]: Finished difference. Result has 157 places, 144 transitions, 1658 flow [2024-06-28 02:12:08,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1658, PETRI_PLACES=157, PETRI_TRANSITIONS=144} [2024-06-28 02:12:08,960 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 118 predicate places. [2024-06-28 02:12:08,961 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 144 transitions, 1658 flow [2024-06-28 02:12:08,961 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-28 02:12:08,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:08,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:08,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-28 02:12:08,961 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:08,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash -160165657, now seen corresponding path program 1 times [2024-06-28 02:12:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:08,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280980062] [2024-06-28 02:12:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280980062] [2024-06-28 02:12:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280980062] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:09,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:09,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:09,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260646187] [2024-06-28 02:12:09,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:09,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:09,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:09,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:09,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:09,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:09,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 144 transitions, 1658 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:09,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:09,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:09,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:10,082 INFO L124 PetriNetUnfolderBase]: 1174/2225 cut-off events. [2024-06-28 02:12:10,082 INFO L125 PetriNetUnfolderBase]: For 22838/22838 co-relation queries the response was YES. [2024-06-28 02:12:10,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10125 conditions, 2225 events. 1174/2225 cut-off events. For 22838/22838 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14112 event pairs, 471 based on Foata normal form. 6/2161 useless extension candidates. Maximal degree in co-relation 10048. Up to 1808 conditions per place. [2024-06-28 02:12:10,094 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 120 selfloop transitions, 43 changer transitions 0/170 dead transitions. [2024-06-28 02:12:10,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 170 transitions, 2090 flow [2024-06-28 02:12:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:10,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 132 transitions. [2024-06-28 02:12:10,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-06-28 02:12:10,096 INFO L175 Difference]: Start difference. First operand has 157 places, 144 transitions, 1658 flow. Second operand 8 states and 132 transitions. [2024-06-28 02:12:10,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 170 transitions, 2090 flow [2024-06-28 02:12:10,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 170 transitions, 2036 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:10,196 INFO L231 Difference]: Finished difference. Result has 159 places, 145 transitions, 1712 flow [2024-06-28 02:12:10,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1712, PETRI_PLACES=159, PETRI_TRANSITIONS=145} [2024-06-28 02:12:10,198 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 120 predicate places. [2024-06-28 02:12:10,198 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 145 transitions, 1712 flow [2024-06-28 02:12:10,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:10,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:10,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:10,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-28 02:12:10,199 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:10,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:10,199 INFO L85 PathProgramCache]: Analyzing trace with hash -862011093, now seen corresponding path program 2 times [2024-06-28 02:12:10,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:10,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899762864] [2024-06-28 02:12:10,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:10,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:10,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899762864] [2024-06-28 02:12:10,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899762864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:10,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:10,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:10,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666592136] [2024-06-28 02:12:10,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:10,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:10,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:10,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:10,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 145 transitions, 1712 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:10,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:10,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:10,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:11,288 INFO L124 PetriNetUnfolderBase]: 1167/2209 cut-off events. [2024-06-28 02:12:11,289 INFO L125 PetriNetUnfolderBase]: For 19634/19636 co-relation queries the response was YES. [2024-06-28 02:12:11,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9984 conditions, 2209 events. 1167/2209 cut-off events. For 19634/19636 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13973 event pairs, 468 based on Foata normal form. 8/2148 useless extension candidates. Maximal degree in co-relation 9905. Up to 1749 conditions per place. [2024-06-28 02:12:11,303 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 119 selfloop transitions, 48 changer transitions 0/174 dead transitions. [2024-06-28 02:12:11,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 174 transitions, 2164 flow [2024-06-28 02:12:11,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:11,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-28 02:12:11,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2024-06-28 02:12:11,305 INFO L175 Difference]: Start difference. First operand has 159 places, 145 transitions, 1712 flow. Second operand 8 states and 134 transitions. [2024-06-28 02:12:11,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 174 transitions, 2164 flow [2024-06-28 02:12:11,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 174 transitions, 2046 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-28 02:12:11,382 INFO L231 Difference]: Finished difference. Result has 162 places, 146 transitions, 1720 flow [2024-06-28 02:12:11,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1720, PETRI_PLACES=162, PETRI_TRANSITIONS=146} [2024-06-28 02:12:11,383 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 123 predicate places. [2024-06-28 02:12:11,383 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 146 transitions, 1720 flow [2024-06-28 02:12:11,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:11,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:11,383 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:11,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-28 02:12:11,384 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:11,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1135376801, now seen corresponding path program 3 times [2024-06-28 02:12:11,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:11,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498091266] [2024-06-28 02:12:11,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:11,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:12,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:12,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:12,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498091266] [2024-06-28 02:12:12,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498091266] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:12,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:12:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169213884] [2024-06-28 02:12:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:12,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:12:12,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:12,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:12:12,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:12:12,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:12,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 146 transitions, 1720 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-28 02:12:12,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:12,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:12,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:12,754 INFO L124 PetriNetUnfolderBase]: 1203/2285 cut-off events. [2024-06-28 02:12:12,754 INFO L125 PetriNetUnfolderBase]: For 20913/20913 co-relation queries the response was YES. [2024-06-28 02:12:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10306 conditions, 2285 events. 1203/2285 cut-off events. For 20913/20913 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 14643 event pairs, 459 based on Foata normal form. 6/2230 useless extension candidates. Maximal degree in co-relation 10225. Up to 1411 conditions per place. [2024-06-28 02:12:12,767 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 118 selfloop transitions, 56 changer transitions 0/181 dead transitions. [2024-06-28 02:12:12,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 181 transitions, 2232 flow [2024-06-28 02:12:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 02:12:12,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48253968253968255 [2024-06-28 02:12:12,768 INFO L175 Difference]: Start difference. First operand has 162 places, 146 transitions, 1720 flow. Second operand 9 states and 152 transitions. [2024-06-28 02:12:12,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 181 transitions, 2232 flow [2024-06-28 02:12:12,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 181 transitions, 2106 flow, removed 9 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:12,837 INFO L231 Difference]: Finished difference. Result has 164 places, 147 transitions, 1742 flow [2024-06-28 02:12:12,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1742, PETRI_PLACES=164, PETRI_TRANSITIONS=147} [2024-06-28 02:12:12,838 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 125 predicate places. [2024-06-28 02:12:12,838 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 147 transitions, 1742 flow [2024-06-28 02:12:12,838 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-28 02:12:12,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:12,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:12,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-28 02:12:12,839 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:12,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1510704971, now seen corresponding path program 4 times [2024-06-28 02:12:12,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:12,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066586257] [2024-06-28 02:12:12,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:12,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:13,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066586257] [2024-06-28 02:12:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066586257] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-28 02:12:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350809449] [2024-06-28 02:12:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:13,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-28 02:12:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-28 02:12:13,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-28 02:12:13,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:13,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 147 transitions, 1742 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-28 02:12:13,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:13,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:13,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:14,010 INFO L124 PetriNetUnfolderBase]: 1203/2285 cut-off events. [2024-06-28 02:12:14,010 INFO L125 PetriNetUnfolderBase]: For 17020/17020 co-relation queries the response was YES. [2024-06-28 02:12:14,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10156 conditions, 2285 events. 1203/2285 cut-off events. For 17020/17020 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 14582 event pairs, 508 based on Foata normal form. 6/2230 useless extension candidates. Maximal degree in co-relation 10075. Up to 2021 conditions per place. [2024-06-28 02:12:14,024 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 152 selfloop transitions, 16 changer transitions 0/175 dead transitions. [2024-06-28 02:12:14,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 175 transitions, 2204 flow [2024-06-28 02:12:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 02:12:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 02:12:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 137 transitions. [2024-06-28 02:12:14,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43492063492063493 [2024-06-28 02:12:14,028 INFO L175 Difference]: Start difference. First operand has 164 places, 147 transitions, 1742 flow. Second operand 9 states and 137 transitions. [2024-06-28 02:12:14,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 175 transitions, 2204 flow [2024-06-28 02:12:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 175 transitions, 2066 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-28 02:12:14,103 INFO L231 Difference]: Finished difference. Result has 166 places, 148 transitions, 1666 flow [2024-06-28 02:12:14,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1666, PETRI_PLACES=166, PETRI_TRANSITIONS=148} [2024-06-28 02:12:14,105 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 127 predicate places. [2024-06-28 02:12:14,105 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 148 transitions, 1666 flow [2024-06-28 02:12:14,105 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-28 02:12:14,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:14,105 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:14,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-28 02:12:14,105 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:14,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1823510471, now seen corresponding path program 5 times [2024-06-28 02:12:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:14,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561251804] [2024-06-28 02:12:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:14,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561251804] [2024-06-28 02:12:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561251804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:14,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:14,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-28 02:12:14,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788913527] [2024-06-28 02:12:14,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:14,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-28 02:12:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:14,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-28 02:12:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-28 02:12:14,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-28 02:12:14,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 148 transitions, 1666 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:14,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:14,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-28 02:12:14,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:15,085 INFO L124 PetriNetUnfolderBase]: 1196/2271 cut-off events. [2024-06-28 02:12:15,085 INFO L125 PetriNetUnfolderBase]: For 11370/11370 co-relation queries the response was YES. [2024-06-28 02:12:15,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9605 conditions, 2271 events. 1196/2271 cut-off events. For 11370/11370 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 14504 event pairs, 433 based on Foata normal form. 6/2212 useless extension candidates. Maximal degree in co-relation 9523. Up to 1614 conditions per place. [2024-06-28 02:12:15,101 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 118 selfloop transitions, 48 changer transitions 0/173 dead transitions. [2024-06-28 02:12:15,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 173 transitions, 2012 flow [2024-06-28 02:12:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:12:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:12:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-28 02:12:15,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2024-06-28 02:12:15,102 INFO L175 Difference]: Start difference. First operand has 166 places, 148 transitions, 1666 flow. Second operand 8 states and 131 transitions. [2024-06-28 02:12:15,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 173 transitions, 2012 flow [2024-06-28 02:12:15,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 173 transitions, 1855 flow, removed 13 selfloop flow, removed 26 redundant places. [2024-06-28 02:12:15,150 INFO L231 Difference]: Finished difference. Result has 146 places, 147 transitions, 1521 flow [2024-06-28 02:12:15,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1521, PETRI_PLACES=146, PETRI_TRANSITIONS=147} [2024-06-28 02:12:15,150 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 107 predicate places. [2024-06-28 02:12:15,150 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 147 transitions, 1521 flow [2024-06-28 02:12:15,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:15,151 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:15,151 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-28 02:12:15,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-28 02:12:15,151 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:15,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 346755375, now seen corresponding path program 1 times [2024-06-28 02:12:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:15,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210008563] [2024-06-28 02:12:15,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:15,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210008563] [2024-06-28 02:12:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210008563] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:15,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:12:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145159141] [2024-06-28 02:12:15,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:15,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:12:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:15,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:12:15,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:12:15,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-06-28 02:12:15,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 147 transitions, 1521 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:15,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:15,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-06-28 02:12:15,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:15,415 INFO L124 PetriNetUnfolderBase]: 687/1479 cut-off events. [2024-06-28 02:12:15,415 INFO L125 PetriNetUnfolderBase]: For 3751/3796 co-relation queries the response was YES. [2024-06-28 02:12:15,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5741 conditions, 1479 events. 687/1479 cut-off events. For 3751/3796 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9833 event pairs, 133 based on Foata normal form. 140/1570 useless extension candidates. Maximal degree in co-relation 5679. Up to 474 conditions per place. [2024-06-28 02:12:15,423 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 64 selfloop transitions, 24 changer transitions 0/135 dead transitions. [2024-06-28 02:12:15,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 135 transitions, 1495 flow [2024-06-28 02:12:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:12:15,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:12:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-28 02:12:15,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2024-06-28 02:12:15,424 INFO L175 Difference]: Start difference. First operand has 146 places, 147 transitions, 1521 flow. Second operand 5 states and 106 transitions. [2024-06-28 02:12:15,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 135 transitions, 1495 flow [2024-06-28 02:12:15,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 135 transitions, 1048 flow, removed 37 selfloop flow, removed 39 redundant places. [2024-06-28 02:12:15,440 INFO L231 Difference]: Finished difference. Result has 113 places, 125 transitions, 923 flow [2024-06-28 02:12:15,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=923, PETRI_PLACES=113, PETRI_TRANSITIONS=125} [2024-06-28 02:12:15,440 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 74 predicate places. [2024-06-28 02:12:15,441 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 125 transitions, 923 flow [2024-06-28 02:12:15,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:15,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:15,441 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-28 02:12:15,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-28 02:12:15,441 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:15,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:15,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1526140228, now seen corresponding path program 1 times [2024-06-28 02:12:15,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:15,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161814489] [2024-06-28 02:12:15,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:15,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:12:15,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:12:15,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:12:15,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161814489] [2024-06-28 02:12:15,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161814489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:12:15,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:12:15,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-06-28 02:12:15,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790666479] [2024-06-28 02:12:15,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:12:15,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-28 02:12:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:12:15,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-28 02:12:15,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-28 02:12:15,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-28 02:12:15,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 125 transitions, 923 flow. Second operand has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:15,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:12:15,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-28 02:12:15,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:12:16,329 INFO L124 PetriNetUnfolderBase]: 502/1243 cut-off events. [2024-06-28 02:12:16,330 INFO L125 PetriNetUnfolderBase]: For 1578/1589 co-relation queries the response was YES. [2024-06-28 02:12:16,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4047 conditions, 1243 events. 502/1243 cut-off events. For 1578/1589 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8673 event pairs, 117 based on Foata normal form. 11/1186 useless extension candidates. Maximal degree in co-relation 4014. Up to 447 conditions per place. [2024-06-28 02:12:16,334 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 41 selfloop transitions, 44 changer transitions 43/152 dead transitions. [2024-06-28 02:12:16,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 152 transitions, 1239 flow [2024-06-28 02:12:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 02:12:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 02:12:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-28 02:12:16,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2024-06-28 02:12:16,335 INFO L175 Difference]: Start difference. First operand has 113 places, 125 transitions, 923 flow. Second operand 12 states and 182 transitions. [2024-06-28 02:12:16,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 152 transitions, 1239 flow [2024-06-28 02:12:16,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 152 transitions, 1191 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 02:12:16,341 INFO L231 Difference]: Finished difference. Result has 123 places, 95 transitions, 728 flow [2024-06-28 02:12:16,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=728, PETRI_PLACES=123, PETRI_TRANSITIONS=95} [2024-06-28 02:12:16,342 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 84 predicate places. [2024-06-28 02:12:16,342 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 95 transitions, 728 flow [2024-06-28 02:12:16,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.461538461538462) internal successors, (149), 13 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:12:16,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:12:16,342 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-28 02:12:16,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-28 02:12:16,342 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-28 02:12:16,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:12:16,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1551845636, now seen corresponding path program 2 times [2024-06-28 02:12:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:12:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477165132] [2024-06-28 02:12:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:12:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:12:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:12:16,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 02:12:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 02:12:16,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 02:12:16,386 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 02:12:16,387 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-28 02:12:16,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-28 02:12:16,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-28 02:12:16,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-28 02:12:16,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-28 02:12:16,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-28 02:12:16,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-28 02:12:16,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-28 02:12:16,389 INFO L445 BasicCegarLoop]: Path program histogram: [6, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:12:16,393 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 02:12:16,393 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 02:12:16,431 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 02:12:16,431 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 02:12:16,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 02:12:16 BasicIcfg [2024-06-28 02:12:16,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 02:12:16,432 INFO L158 Benchmark]: Toolchain (without parser) took 44337.14ms. Allocated memory was 157.3MB in the beginning and 826.3MB in the end (delta: 669.0MB). Free memory was 130.2MB in the beginning and 437.5MB in the end (delta: -307.3MB). Peak memory consumption was 361.6MB. Max. memory is 16.1GB. [2024-06-28 02:12:16,433 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:12:16,433 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 02:12:16,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.52ms. Allocated memory is still 157.3MB. Free memory was 130.0MB in the beginning and 99.7MB in the end (delta: 30.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2024-06-28 02:12:16,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.36ms. Allocated memory is still 157.3MB. Free memory was 99.7MB in the beginning and 97.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-28 02:12:16,433 INFO L158 Benchmark]: Boogie Preprocessor took 57.47ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 93.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 02:12:16,433 INFO L158 Benchmark]: RCFGBuilder took 559.96ms. Allocated memory is still 157.3MB. Free memory was 93.6MB in the beginning and 96.5MB in the end (delta: -2.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-06-28 02:12:16,433 INFO L158 Benchmark]: TraceAbstraction took 43089.87ms. Allocated memory was 157.3MB in the beginning and 826.3MB in the end (delta: 669.0MB). Free memory was 96.5MB in the beginning and 437.5MB in the end (delta: -341.0MB). Peak memory consumption was 330.1MB. Max. memory is 16.1GB. [2024-06-28 02:12:16,434 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 70.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 536.52ms. Allocated memory is still 157.3MB. Free memory was 130.0MB in the beginning and 99.7MB in the end (delta: 30.3MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.36ms. Allocated memory is still 157.3MB. Free memory was 99.7MB in the beginning and 97.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.47ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 93.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 559.96ms. Allocated memory is still 157.3MB. Free memory was 93.6MB in the beginning and 96.5MB in the end (delta: -2.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 43089.87ms. Allocated memory was 157.3MB in the beginning and 826.3MB in the end (delta: 669.0MB). Free memory was 96.5MB in the beginning and 437.5MB in the end (delta: -341.0MB). Peak memory consumption was 330.1MB. 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; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L793] 0 //@ assert (((((((((((((!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (!multithreaded || (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2)))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 2)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 x = 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 x = 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 y = 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L775] 2 __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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L794] 0 //@ assert (((((((((((((!multithreaded || ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (!multithreaded || (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2)))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$read_delayed == (_Bool) 0))) && (!multithreaded || (((((((((((((0 <= __unbuffered_cnt) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))))) && (!multithreaded || ((y$w_buff0 == 0) || (y$w_buff0 == 2)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((y == 0) || (y == 1)) || (y == 2)))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, 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: 43.0s, OverallIterations: 49, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2551 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2145 mSDsluCounter, 1848 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1586 mSDsCounter, 618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11922 IncrementalHoareTripleChecker+Invalid, 12540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 618 mSolverCounterUnsat, 262 mSDtfsCounter, 11922 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 373 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3020occurred in iteration=29, InterpolantAutomatonStates: 344, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 20.7s InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 23803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 48 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-28 02:12:16,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE