./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 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/weaver/bench-exp2x3.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.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-dev-3d25acf-m [2024-01-30 14:22:37,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:22:37,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:22:37,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:22:37,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:22:37,528 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:22:37,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:22:37,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:22:37,530 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:22:37,531 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:22:37,531 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:22:37,531 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:22:37,532 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:22:37,534 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:22:37,534 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:22:37,535 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:22:37,535 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:22:37,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:22:37,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:22:37,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:22:37,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:22:37,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:22:37,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:22:37,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:22:37,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:22:37,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:22:37,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:22:37,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:22:37,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:22:37,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:22:37,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:22:37,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:22:37,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:37,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:22:37,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:22:37,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:22:37,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:22:37,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:22:37,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:22:37,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:22:37,546 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:22:37,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:22:37,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:22:37,547 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-01-30 14:22:37,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:22:37,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:22:37,764 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:22:37,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:22:37,766 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:22:37,766 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-30 14:22:38,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:22:39,105 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:22:39,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-01-30 14:22:39,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b499de8d0/3916d1464bf84eaabbdf1e7020cbf0e1/FLAG25cc0264b [2024-01-30 14:22:39,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b499de8d0/3916d1464bf84eaabbdf1e7020cbf0e1 [2024-01-30 14:22:39,130 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:22:39,131 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:22:39,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/bench-exp2x3.wvr.yml/witness.yml [2024-01-30 14:22:39,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:22:39,217 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:22:39,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:39,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:22:39,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:22:39,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:39" (1/2) ... [2024-01-30 14:22:39,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97dc84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:39, skipping insertion in model container [2024-01-30 14:22:39,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:22:39" (1/2) ... [2024-01-30 14:22:39,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5717e425 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:22:39, skipping insertion in model container [2024-01-30 14:22:39,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:39" (2/2) ... [2024-01-30 14:22:39,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97dc84b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39, skipping insertion in model container [2024-01-30 14:22:39,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:39" (2/2) ... [2024-01-30 14:22:39,227 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:22:39,249 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:22:39,251 INFO L98 nessWitnessExtractor]: Location invariant before [L76-L76] (x4 == 0U) && (n == 0U) [2024-01-30 14:22:39,251 INFO L98 nessWitnessExtractor]: Location invariant before [L58-L58] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,251 INFO L98 nessWitnessExtractor]: Location invariant before [L77-L77] n == 0U [2024-01-30 14:22:39,251 INFO L98 nessWitnessExtractor]: Loop invariant at [L38-L40] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,251 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,252 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,252 INFO L98 nessWitnessExtractor]: Location invariant before [L55-L55] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,252 INFO L98 nessWitnessExtractor]: Location invariant after [L37-L43] n == 0U [2024-01-30 14:22:39,252 INFO L98 nessWitnessExtractor]: Location invariant before [L73-L73] (((((((((0LL - (long long )n) + (long long )x1 >= 0LL) && ((long long )n + (long long )x1 >= 0LL)) && ((0LL - (long long )n) - (long long )x1 >= 0LL)) && ((long long )n - (long long )x1 >= 0LL)) && (x1 == 0U)) && (x2 == 0U)) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Loop invariant at [L54-L56] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Loop invariant at [L46-L48] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Location invariant before [L39-L39] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Loop invariant at [L62-L64] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Location invariant before [L74-L74] (((x2 == 0U) && (x3 == 0U)) && (x4 == 0U)) && (n == 0U) [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,253 INFO L98 nessWitnessExtractor]: Location invariant before [L50-L50] (unsigned long )_argptr == 0UL [2024-01-30 14:22:39,254 INFO L98 nessWitnessExtractor]: Location invariant before [L75-L75] ((x3 == 0U) && (x4 == 0U)) && (n == 0U) [2024-01-30 14:22:39,272 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:22:39,439 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-01-30 14:22:39,449 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:39,460 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:22:39,504 WARN L424 MainDispatcher]: Unable to annotate void* thread1(void* _argptr) { while (x1 < n) { x1 = x1 + x1; } return 0; } with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:22:39,537 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2289,2302] [2024-01-30 14:22:39,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:22:39,559 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:22:39,560 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39 WrapperNode [2024-01-30 14:22:39,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:22:39,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:39,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:22:39,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:22:39,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,597 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2024-01-30 14:22:39,599 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:22:39,600 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:22:39,600 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:22:39,600 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:22:39,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,642 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-30 14:22:39,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:22:39,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:22:39,671 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:22:39,671 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:22:39,672 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (1/1) ... [2024-01-30 14:22:39,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:22:39,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:39,722 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-01-30 14:22:39,748 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-01-30 14:22:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:22:39,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:22:39,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:22:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:22:39,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:22:39,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-30 14:22:39,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-30 14:22:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-30 14:22:39,755 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-30 14:22:39,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:22:39,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:22:39,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:22:39,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:22:39,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-30 14:22:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:22:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:22:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:22:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:22:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:22:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-30 14:22:39,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:22:39,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:22:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:22:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:22:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:22:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:22:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-30 14:22:39,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:22:39,760 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:22:39,868 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:22:39,870 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:22:40,176 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:22:40,176 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:22:40,269 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:22:40,269 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-30 14:22:40,270 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:40 BoogieIcfgContainer [2024-01-30 14:22:40,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:22:40,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:22:40,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:22:40,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:22:40,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:22:39" (1/4) ... [2024-01-30 14:22:40,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a1b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:22:40, skipping insertion in model container [2024-01-30 14:22:40,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:22:39" (2/4) ... [2024-01-30 14:22:40,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a1b45 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:40, skipping insertion in model container [2024-01-30 14:22:40,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:22:39" (3/4) ... [2024-01-30 14:22:40,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7a1b45 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:22:40, skipping insertion in model container [2024-01-30 14:22:40,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:22:40" (4/4) ... [2024-01-30 14:22:40,276 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-01-30 14:22:40,294 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:22:40,294 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-01-30 14:22:40,294 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:22:40,344 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-01-30 14:22:40,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 77 transitions, 182 flow [2024-01-30 14:22:40,400 INFO L124 PetriNetUnfolderBase]: 4/73 cut-off events. [2024-01-30 14:22:40,400 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-01-30 14:22:40,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 4/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 193 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2024-01-30 14:22:40,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 77 transitions, 182 flow [2024-01-30 14:22:40,408 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 72 transitions, 168 flow [2024-01-30 14:22:40,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:22:40,420 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;@4e9ee3a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:22:40,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2024-01-30 14:22:40,423 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:22:40,423 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:22:40,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:40,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:40,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:22:40,424 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:40,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash 11859, now seen corresponding path program 1 times [2024-01-30 14:22:40,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:40,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484669387] [2024-01-30 14:22:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:40,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:41,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484669387] [2024-01-30 14:22:41,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484669387] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:41,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:41,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:22:41,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877108228] [2024-01-30 14:22:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:41,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:41,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:41,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 77 [2024-01-30 14:22:41,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:41,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:41,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 77 [2024-01-30 14:22:41,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:42,121 INFO L124 PetriNetUnfolderBase]: 7352/10601 cut-off events. [2024-01-30 14:22:42,122 INFO L125 PetriNetUnfolderBase]: For 414/414 co-relation queries the response was YES. [2024-01-30 14:22:42,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20221 conditions, 10601 events. 7352/10601 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64563 event pairs, 4752 based on Foata normal form. 0/7150 useless extension candidates. Maximal degree in co-relation 17346. Up to 9146 conditions per place. [2024-01-30 14:22:42,193 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 40 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2024-01-30 14:22:42,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 71 transitions, 250 flow [2024-01-30 14:22:42,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:42,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:42,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2024-01-30 14:22:42,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6147186147186147 [2024-01-30 14:22:42,204 INFO L175 Difference]: Start difference. First operand has 81 places, 72 transitions, 168 flow. Second operand 3 states and 142 transitions. [2024-01-30 14:22:42,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 71 transitions, 250 flow [2024-01-30 14:22:42,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 71 transitions, 234 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-01-30 14:22:42,221 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 154 flow [2024-01-30 14:22:42,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2024-01-30 14:22:42,240 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -7 predicate places. [2024-01-30 14:22:42,240 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 154 flow [2024-01-30 14:22:42,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:42,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:42,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-30 14:22:42,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:22:42,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:42,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:42,242 INFO L85 PathProgramCache]: Analyzing trace with hash 367971, now seen corresponding path program 1 times [2024-01-30 14:22:42,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939726332] [2024-01-30 14:22:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:42,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:42,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:42,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:42,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939726332] [2024-01-30 14:22:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939726332] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:42,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:42,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:42,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618512981] [2024-01-30 14:22:42,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:42,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:42,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:42,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 77 [2024-01-30 14:22:42,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:42,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:42,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 77 [2024-01-30 14:22:42,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:43,001 INFO L124 PetriNetUnfolderBase]: 7352/10600 cut-off events. [2024-01-30 14:22:43,002 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-30 14:22:43,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19906 conditions, 10600 events. 7352/10600 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64495 event pairs, 4752 based on Foata normal form. 0/7150 useless extension candidates. Maximal degree in co-relation 19897. Up to 9144 conditions per place. [2024-01-30 14:22:43,064 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 39 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2024-01-30 14:22:43,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 70 transitions, 234 flow [2024-01-30 14:22:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2024-01-30 14:22:43,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6233766233766234 [2024-01-30 14:22:43,067 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 154 flow. Second operand 3 states and 144 transitions. [2024-01-30 14:22:43,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 70 transitions, 234 flow [2024-01-30 14:22:43,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 70 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:43,069 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 152 flow [2024-01-30 14:22:43,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-01-30 14:22:43,070 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2024-01-30 14:22:43,070 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 152 flow [2024-01-30 14:22:43,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:43,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:43,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:22:43,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:22:43,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:43,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash 11407500, now seen corresponding path program 1 times [2024-01-30 14:22:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:43,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139018730] [2024-01-30 14:22:43,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139018730] [2024-01-30 14:22:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139018730] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:43,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:43,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817424790] [2024-01-30 14:22:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:43,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:43,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:43,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 77 [2024-01-30 14:22:43,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:43,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:43,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 77 [2024-01-30 14:22:43,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:43,746 INFO L124 PetriNetUnfolderBase]: 7352/10599 cut-off events. [2024-01-30 14:22:43,746 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-30 14:22:43,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19904 conditions, 10599 events. 7352/10599 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64506 event pairs, 4752 based on Foata normal form. 0/7150 useless extension candidates. Maximal degree in co-relation 19893. Up to 9142 conditions per place. [2024-01-30 14:22:43,802 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 38 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2024-01-30 14:22:43,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 230 flow [2024-01-30 14:22:43,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2024-01-30 14:22:43,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6320346320346321 [2024-01-30 14:22:43,805 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 152 flow. Second operand 3 states and 146 transitions. [2024-01-30 14:22:43,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 230 flow [2024-01-30 14:22:43,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:43,807 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 150 flow [2024-01-30 14:22:43,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-01-30 14:22:43,808 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -9 predicate places. [2024-01-30 14:22:43,808 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 150 flow [2024-01-30 14:22:43,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:43,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:43,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:22:43,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:22:43,809 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:43,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash 353632911, now seen corresponding path program 1 times [2024-01-30 14:22:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:43,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198655125] [2024-01-30 14:22:43,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:43,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:43,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:43,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198655125] [2024-01-30 14:22:43,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198655125] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:43,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:43,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:43,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451692658] [2024-01-30 14:22:43,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:43,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:43,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:43,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:43,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:43,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 77 [2024-01-30 14:22:43,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:43,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:43,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 77 [2024-01-30 14:22:43,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:44,407 INFO L124 PetriNetUnfolderBase]: 7352/10598 cut-off events. [2024-01-30 14:22:44,407 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-30 14:22:44,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19902 conditions, 10598 events. 7352/10598 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 64570 event pairs, 4752 based on Foata normal form. 0/7150 useless extension candidates. Maximal degree in co-relation 19889. Up to 9140 conditions per place. [2024-01-30 14:22:44,465 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 37 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2024-01-30 14:22:44,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 226 flow [2024-01-30 14:22:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2024-01-30 14:22:44,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6406926406926406 [2024-01-30 14:22:44,467 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 150 flow. Second operand 3 states and 148 transitions. [2024-01-30 14:22:44,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 226 flow [2024-01-30 14:22:44,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:44,469 INFO L231 Difference]: Finished difference. Result has 71 places, 68 transitions, 148 flow [2024-01-30 14:22:44,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=71, PETRI_TRANSITIONS=68} [2024-01-30 14:22:44,469 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -10 predicate places. [2024-01-30 14:22:44,470 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 68 transitions, 148 flow [2024-01-30 14:22:44,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:44,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:44,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:22:44,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:22:44,470 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:44,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:44,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1922281298, now seen corresponding path program 1 times [2024-01-30 14:22:44,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:44,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578130050] [2024-01-30 14:22:44,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578130050] [2024-01-30 14:22:44,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578130050] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:44,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:44,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:22:44,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144701953] [2024-01-30 14:22:44,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:44,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:44,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:44,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:44,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:44,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 77 [2024-01-30 14:22:44,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 68 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:44,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:44,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 77 [2024-01-30 14:22:44,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:45,002 INFO L124 PetriNetUnfolderBase]: 7352/10597 cut-off events. [2024-01-30 14:22:45,003 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2024-01-30 14:22:45,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19900 conditions, 10597 events. 7352/10597 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 653. Compared 64677 event pairs, 4752 based on Foata normal form. 0/7150 useless extension candidates. Maximal degree in co-relation 19885. Up to 9138 conditions per place. [2024-01-30 14:22:45,064 INFO L140 encePairwiseOnDemand]: 74/77 looper letters, 36 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2024-01-30 14:22:45,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 67 transitions, 222 flow [2024-01-30 14:22:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2024-01-30 14:22:45,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2024-01-30 14:22:45,066 INFO L175 Difference]: Start difference. First operand has 71 places, 68 transitions, 148 flow. Second operand 3 states and 150 transitions. [2024-01-30 14:22:45,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 67 transitions, 222 flow [2024-01-30 14:22:45,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:45,067 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 146 flow [2024-01-30 14:22:45,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-01-30 14:22:45,068 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -11 predicate places. [2024-01-30 14:22:45,068 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 146 flow [2024-01-30 14:22:45,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:45,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:45,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:45,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:22:45,069 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:45,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1882734943, now seen corresponding path program 1 times [2024-01-30 14:22:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683307206] [2024-01-30 14:22:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:45,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:45,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683307206] [2024-01-30 14:22:45,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683307206] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:45,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:45,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229467450] [2024-01-30 14:22:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:45,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:45,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:45,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:45,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 77 [2024-01-30 14:22:45,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:45,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:45,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 77 [2024-01-30 14:22:45,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:45,434 INFO L124 PetriNetUnfolderBase]: 2599/4078 cut-off events. [2024-01-30 14:22:45,434 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:22:45,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7628 conditions, 4078 events. 2599/4078 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 27919 event pairs, 279 based on Foata normal form. 340/4264 useless extension candidates. Maximal degree in co-relation 7611. Up to 2984 conditions per place. [2024-01-30 14:22:45,452 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 49 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2024-01-30 14:22:45,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 79 transitions, 275 flow [2024-01-30 14:22:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:45,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:45,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2024-01-30 14:22:45,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2024-01-30 14:22:45,454 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 146 flow. Second operand 4 states and 203 transitions. [2024-01-30 14:22:45,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 79 transitions, 275 flow [2024-01-30 14:22:45,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 79 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:45,456 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 138 flow [2024-01-30 14:22:45,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-01-30 14:22:45,456 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -14 predicate places. [2024-01-30 14:22:45,456 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 138 flow [2024-01-30 14:22:45,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.25) internal successors, (157), 4 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:45,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:45,457 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:45,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:22:45,457 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:45,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:45,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1128334341, now seen corresponding path program 1 times [2024-01-30 14:22:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:45,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068409087] [2024-01-30 14:22:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:45,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:45,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:45,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068409087] [2024-01-30 14:22:45,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068409087] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:45,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:45,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815358640] [2024-01-30 14:22:45,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:45,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:45,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:45,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:45,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:45,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 77 [2024-01-30 14:22:45,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:45,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:45,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 77 [2024-01-30 14:22:45,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:45,797 INFO L124 PetriNetUnfolderBase]: 3687/5924 cut-off events. [2024-01-30 14:22:45,798 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-01-30 14:22:45,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10741 conditions, 5924 events. 3687/5924 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 38265 event pairs, 1428 based on Foata normal form. 400/5997 useless extension candidates. Maximal degree in co-relation 10720. Up to 4076 conditions per place. [2024-01-30 14:22:45,831 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 52 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2024-01-30 14:22:45,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 279 flow [2024-01-30 14:22:45,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 206 transitions. [2024-01-30 14:22:45,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6688311688311688 [2024-01-30 14:22:45,832 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 138 flow. Second operand 4 states and 206 transitions. [2024-01-30 14:22:45,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 279 flow [2024-01-30 14:22:45,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:45,834 INFO L231 Difference]: Finished difference. Result has 64 places, 59 transitions, 131 flow [2024-01-30 14:22:45,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=64, PETRI_TRANSITIONS=59} [2024-01-30 14:22:45,835 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -17 predicate places. [2024-01-30 14:22:45,835 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 59 transitions, 131 flow [2024-01-30 14:22:45,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:45,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:45,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:45,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:22:45,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:45,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1997943410, now seen corresponding path program 1 times [2024-01-30 14:22:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899545618] [2024-01-30 14:22:45,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:45,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:45,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899545618] [2024-01-30 14:22:45,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899545618] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:45,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:45,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:45,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354425910] [2024-01-30 14:22:45,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:45,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:45,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:45,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:45,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:45,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 77 [2024-01-30 14:22:45,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 59 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:45,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 77 [2024-01-30 14:22:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:46,184 INFO L124 PetriNetUnfolderBase]: 2711/4292 cut-off events. [2024-01-30 14:22:46,184 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-01-30 14:22:46,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7951 conditions, 4292 events. 2711/4292 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 29425 event pairs, 117 based on Foata normal form. 400/4545 useless extension candidates. Maximal degree in co-relation 7931. Up to 2920 conditions per place. [2024-01-30 14:22:46,207 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 55 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2024-01-30 14:22:46,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 284 flow [2024-01-30 14:22:46,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:46,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2024-01-30 14:22:46,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-01-30 14:22:46,208 INFO L175 Difference]: Start difference. First operand has 64 places, 59 transitions, 131 flow. Second operand 4 states and 209 transitions. [2024-01-30 14:22:46,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 284 flow [2024-01-30 14:22:46,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:46,210 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 124 flow [2024-01-30 14:22:46,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-01-30 14:22:46,211 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -20 predicate places. [2024-01-30 14:22:46,211 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 124 flow [2024-01-30 14:22:46,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:46,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:46,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:46,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:22:46,212 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread4Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:46,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash -174297776, now seen corresponding path program 1 times [2024-01-30 14:22:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:46,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262312079] [2024-01-30 14:22:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:46,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262312079] [2024-01-30 14:22:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262312079] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:46,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:46,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:46,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182927003] [2024-01-30 14:22:46,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:46,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:46,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:46,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:46,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:46,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 77 [2024-01-30 14:22:46,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:46,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:46,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 77 [2024-01-30 14:22:46,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:46,589 INFO L124 PetriNetUnfolderBase]: 3016/4468 cut-off events. [2024-01-30 14:22:46,589 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-01-30 14:22:46,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8444 conditions, 4468 events. 3016/4468 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 27201 event pairs, 305 based on Foata normal form. 340/4724 useless extension candidates. Maximal degree in co-relation 8424. Up to 2810 conditions per place. [2024-01-30 14:22:46,614 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 58 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2024-01-30 14:22:46,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 289 flow [2024-01-30 14:22:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:22:46,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:22:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-01-30 14:22:46,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883116883116883 [2024-01-30 14:22:46,616 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 124 flow. Second operand 4 states and 212 transitions. [2024-01-30 14:22:46,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 289 flow [2024-01-30 14:22:46,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:46,618 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 117 flow [2024-01-30 14:22:46,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-01-30 14:22:46,619 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -23 predicate places. [2024-01-30 14:22:46,619 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 117 flow [2024-01-30 14:22:46,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:46,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:46,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:46,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:22:46,620 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:46,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:46,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1409059214, now seen corresponding path program 1 times [2024-01-30 14:22:46,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:46,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240792640] [2024-01-30 14:22:46,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:46,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240792640] [2024-01-30 14:22:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240792640] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:22:46,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865506963] [2024-01-30 14:22:46,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:46,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:22:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:22:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:22:46,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 77 [2024-01-30 14:22:46,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:46,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:46,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 77 [2024-01-30 14:22:46,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:47,174 INFO L124 PetriNetUnfolderBase]: 4381/6684 cut-off events. [2024-01-30 14:22:47,174 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-01-30 14:22:47,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12471 conditions, 6684 events. 4381/6684 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 39987 event pairs, 656 based on Foata normal form. 1/6559 useless extension candidates. Maximal degree in co-relation 12451. Up to 4604 conditions per place. [2024-01-30 14:22:47,206 INFO L140 encePairwiseOnDemand]: 69/77 looper letters, 52 selfloop transitions, 7 changer transitions 1/77 dead transitions. [2024-01-30 14:22:47,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 77 transitions, 298 flow [2024-01-30 14:22:47,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:22:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:22:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-01-30 14:22:47,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2024-01-30 14:22:47,208 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 117 flow. Second operand 3 states and 187 transitions. [2024-01-30 14:22:47,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 77 transitions, 298 flow [2024-01-30 14:22:47,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 77 transitions, 293 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:22:47,210 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 153 flow [2024-01-30 14:22:47,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2024-01-30 14:22:47,211 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -22 predicate places. [2024-01-30 14:22:47,211 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 153 flow [2024-01-30 14:22:47,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:47,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:47,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:47,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:22:47,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:47,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:47,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1558739569, now seen corresponding path program 1 times [2024-01-30 14:22:47,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:47,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737251083] [2024-01-30 14:22:47,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:47,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737251083] [2024-01-30 14:22:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737251083] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881322033] [2024-01-30 14:22:47,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:47,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:47,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:47,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:47,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:47,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:47,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:47,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:47,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:48,064 INFO L124 PetriNetUnfolderBase]: 8981/12491 cut-off events. [2024-01-30 14:22:48,064 INFO L125 PetriNetUnfolderBase]: For 2468/3064 co-relation queries the response was YES. [2024-01-30 14:22:48,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27727 conditions, 12491 events. 8981/12491 cut-off events. For 2468/3064 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 73641 event pairs, 1167 based on Foata normal form. 30/10994 useless extension candidates. Maximal degree in co-relation 27702. Up to 4261 conditions per place. [2024-01-30 14:22:48,115 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 93 selfloop transitions, 15 changer transitions 0/123 dead transitions. [2024-01-30 14:22:48,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 123 transitions, 554 flow [2024-01-30 14:22:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:48,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 301 transitions. [2024-01-30 14:22:48,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2024-01-30 14:22:48,117 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 153 flow. Second operand 5 states and 301 transitions. [2024-01-30 14:22:48,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 123 transitions, 554 flow [2024-01-30 14:22:48,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 123 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:48,118 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 244 flow [2024-01-30 14:22:48,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-01-30 14:22:48,119 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -16 predicate places. [2024-01-30 14:22:48,119 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 244 flow [2024-01-30 14:22:48,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:48,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:48,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:48,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-30 14:22:48,120 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:48,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash -311053775, now seen corresponding path program 2 times [2024-01-30 14:22:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437331431] [2024-01-30 14:22:48,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:48,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:48,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437331431] [2024-01-30 14:22:48,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437331431] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:48,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:48,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655723046] [2024-01-30 14:22:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:48,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:48,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:48,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:48,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:48,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:48,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:48,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:48,802 INFO L124 PetriNetUnfolderBase]: 8625/12192 cut-off events. [2024-01-30 14:22:48,802 INFO L125 PetriNetUnfolderBase]: For 7830/7922 co-relation queries the response was YES. [2024-01-30 14:22:48,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31085 conditions, 12192 events. 8625/12192 cut-off events. For 7830/7922 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 73685 event pairs, 1751 based on Foata normal form. 262/12129 useless extension candidates. Maximal degree in co-relation 31053. Up to 4120 conditions per place. [2024-01-30 14:22:48,863 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 99 selfloop transitions, 17 changer transitions 0/131 dead transitions. [2024-01-30 14:22:48,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 131 transitions, 671 flow [2024-01-30 14:22:48,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:48,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:48,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 304 transitions. [2024-01-30 14:22:48,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7896103896103897 [2024-01-30 14:22:48,865 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 244 flow. Second operand 5 states and 304 transitions. [2024-01-30 14:22:48,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 131 transitions, 671 flow [2024-01-30 14:22:48,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 131 transitions, 671 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-30 14:22:48,870 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 353 flow [2024-01-30 14:22:48,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=353, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-01-30 14:22:48,870 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -8 predicate places. [2024-01-30 14:22:48,870 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 353 flow [2024-01-30 14:22:48,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:48,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:48,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:48,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-30 14:22:48,871 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:48,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash -156189926, now seen corresponding path program 1 times [2024-01-30 14:22:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196795220] [2024-01-30 14:22:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:48,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:48,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:48,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196795220] [2024-01-30 14:22:48,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196795220] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:48,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:48,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733393271] [2024-01-30 14:22:48,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:48,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:48,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:48,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 353 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:48,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:48,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:48,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:49,713 INFO L124 PetriNetUnfolderBase]: 8981/12445 cut-off events. [2024-01-30 14:22:49,713 INFO L125 PetriNetUnfolderBase]: For 22225/22788 co-relation queries the response was YES. [2024-01-30 14:22:49,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37098 conditions, 12445 events. 8981/12445 cut-off events. For 22225/22788 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 73936 event pairs, 967 based on Foata normal form. 201/12410 useless extension candidates. Maximal degree in co-relation 37056. Up to 4759 conditions per place. [2024-01-30 14:22:49,786 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 101 selfloop transitions, 14 changer transitions 0/130 dead transitions. [2024-01-30 14:22:49,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 130 transitions, 777 flow [2024-01-30 14:22:49,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 300 transitions. [2024-01-30 14:22:49,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7792207792207793 [2024-01-30 14:22:49,803 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 353 flow. Second operand 5 states and 300 transitions. [2024-01-30 14:22:49,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 130 transitions, 777 flow [2024-01-30 14:22:49,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 130 transitions, 773 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-30 14:22:49,861 INFO L231 Difference]: Finished difference. Result has 80 places, 74 transitions, 440 flow [2024-01-30 14:22:49,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=80, PETRI_TRANSITIONS=74} [2024-01-30 14:22:49,867 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, -1 predicate places. [2024-01-30 14:22:49,868 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 74 transitions, 440 flow [2024-01-30 14:22:49,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:49,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:49,868 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:49,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-30 14:22:49,869 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:49,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 150395356, now seen corresponding path program 2 times [2024-01-30 14:22:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480785976] [2024-01-30 14:22:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:49,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:49,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:49,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480785976] [2024-01-30 14:22:49,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480785976] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:49,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:49,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:49,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460025919] [2024-01-30 14:22:49,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:49,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:49,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:49,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:49,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:49,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:49,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 74 transitions, 440 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:49,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:49,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:49,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:50,724 INFO L124 PetriNetUnfolderBase]: 8549/11872 cut-off events. [2024-01-30 14:22:50,725 INFO L125 PetriNetUnfolderBase]: For 25984/26079 co-relation queries the response was YES. [2024-01-30 14:22:50,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36974 conditions, 11872 events. 8549/11872 cut-off events. For 25984/26079 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 69463 event pairs, 2391 based on Foata normal form. 230/11748 useless extension candidates. Maximal degree in co-relation 36923. Up to 5167 conditions per place. [2024-01-30 14:22:50,795 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 104 selfloop transitions, 16 changer transitions 0/135 dead transitions. [2024-01-30 14:22:50,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 875 flow [2024-01-30 14:22:50,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 301 transitions. [2024-01-30 14:22:50,798 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2024-01-30 14:22:50,799 INFO L175 Difference]: Start difference. First operand has 80 places, 74 transitions, 440 flow. Second operand 5 states and 301 transitions. [2024-01-30 14:22:50,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 875 flow [2024-01-30 14:22:50,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 866 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:50,859 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 520 flow [2024-01-30 14:22:50,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=520, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2024-01-30 14:22:50,860 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 5 predicate places. [2024-01-30 14:22:50,861 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 520 flow [2024-01-30 14:22:50,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:50,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:50,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:50,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-01-30 14:22:50,863 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:50,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:50,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1020192915, now seen corresponding path program 1 times [2024-01-30 14:22:50,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:50,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165357863] [2024-01-30 14:22:50,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:50,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:51,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165357863] [2024-01-30 14:22:51,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165357863] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:51,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470072207] [2024-01-30 14:22:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:51,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:51,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:51,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:51,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-01-30 14:22:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:51,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-30 14:22:51,198 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:22:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:51,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:22:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470072207] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:22:51,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:22:51,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-01-30 14:22:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627571786] [2024-01-30 14:22:51,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:22:51,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:22:51,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:51,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:22:51,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:22:51,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:51,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 520 flow. Second operand has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:51,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:51,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:51,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:53,024 INFO L124 PetriNetUnfolderBase]: 15260/21243 cut-off events. [2024-01-30 14:22:53,024 INFO L125 PetriNetUnfolderBase]: For 97732/103005 co-relation queries the response was YES. [2024-01-30 14:22:53,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72573 conditions, 21243 events. 15260/21243 cut-off events. For 97732/103005 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 134839 event pairs, 1803 based on Foata normal form. 1148/19591 useless extension candidates. Maximal degree in co-relation 72515. Up to 6152 conditions per place. [2024-01-30 14:22:53,163 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 234 selfloop transitions, 16 changer transitions 0/273 dead transitions. [2024-01-30 14:22:53,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 273 transitions, 2514 flow [2024-01-30 14:22:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-30 14:22:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-30 14:22:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 514 transitions. [2024-01-30 14:22:53,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7417027417027418 [2024-01-30 14:22:53,165 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 520 flow. Second operand 9 states and 514 transitions. [2024-01-30 14:22:53,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 273 transitions, 2514 flow [2024-01-30 14:22:53,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 273 transitions, 2453 flow, removed 28 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:53,198 INFO L231 Difference]: Finished difference. Result has 99 places, 87 transitions, 617 flow [2024-01-30 14:22:53,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=617, PETRI_PLACES=99, PETRI_TRANSITIONS=87} [2024-01-30 14:22:53,199 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 18 predicate places. [2024-01-30 14:22:53,199 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 87 transitions, 617 flow [2024-01-30 14:22:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.0) internal successors, (288), 6 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:53,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:53,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:53,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-30 14:22:53,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-30 14:22:53,410 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:53,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:53,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1715935233, now seen corresponding path program 2 times [2024-01-30 14:22:53,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:53,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41665646] [2024-01-30 14:22:53,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:53,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:53,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:53,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41665646] [2024-01-30 14:22:53,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41665646] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:53,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21955408] [2024-01-30 14:22:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:53,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:53,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:53,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:53,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 617 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:53,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:53,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:53,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:54,938 INFO L124 PetriNetUnfolderBase]: 13356/18589 cut-off events. [2024-01-30 14:22:54,939 INFO L125 PetriNetUnfolderBase]: For 95819/100659 co-relation queries the response was YES. [2024-01-30 14:22:54,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74333 conditions, 18589 events. 13356/18589 cut-off events. For 95819/100659 co-relation queries the response was YES. Maximal size of possible extension queue 1034. Compared 115943 event pairs, 1205 based on Foata normal form. 1205/18984 useless extension candidates. Maximal degree in co-relation 74266. Up to 6257 conditions per place. [2024-01-30 14:22:55,068 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 148 selfloop transitions, 18 changer transitions 0/189 dead transitions. [2024-01-30 14:22:55,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 189 transitions, 1760 flow [2024-01-30 14:22:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2024-01-30 14:22:55,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7688311688311689 [2024-01-30 14:22:55,070 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 617 flow. Second operand 5 states and 296 transitions. [2024-01-30 14:22:55,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 189 transitions, 1760 flow [2024-01-30 14:22:55,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 189 transitions, 1758 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:55,155 INFO L231 Difference]: Finished difference. Result has 105 places, 96 transitions, 761 flow [2024-01-30 14:22:55,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=761, PETRI_PLACES=105, PETRI_TRANSITIONS=96} [2024-01-30 14:22:55,156 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 24 predicate places. [2024-01-30 14:22:55,156 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 761 flow [2024-01-30 14:22:55,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:55,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:55,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:55,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-01-30 14:22:55,157 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:55,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:55,157 INFO L85 PathProgramCache]: Analyzing trace with hash -980062506, now seen corresponding path program 1 times [2024-01-30 14:22:55,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:55,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846096308] [2024-01-30 14:22:55,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:55,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:55,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:55,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:55,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846096308] [2024-01-30 14:22:55,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846096308] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:55,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:55,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:55,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105439137] [2024-01-30 14:22:55,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:55,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:55,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:55,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:55,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:55,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 761 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:55,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:55,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:55,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:56,733 INFO L124 PetriNetUnfolderBase]: 13188/18119 cut-off events. [2024-01-30 14:22:56,734 INFO L125 PetriNetUnfolderBase]: For 110175/115260 co-relation queries the response was YES. [2024-01-30 14:22:56,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78323 conditions, 18119 events. 13188/18119 cut-off events. For 110175/115260 co-relation queries the response was YES. Maximal size of possible extension queue 1000. Compared 108417 event pairs, 1177 based on Foata normal form. 1261/18574 useless extension candidates. Maximal degree in co-relation 78248. Up to 8801 conditions per place. [2024-01-30 14:22:56,881 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 154 selfloop transitions, 12 changer transitions 0/189 dead transitions. [2024-01-30 14:22:56,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 189 transitions, 1829 flow [2024-01-30 14:22:56,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:56,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 295 transitions. [2024-01-30 14:22:56,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7662337662337663 [2024-01-30 14:22:56,883 INFO L175 Difference]: Start difference. First operand has 105 places, 96 transitions, 761 flow. Second operand 5 states and 295 transitions. [2024-01-30 14:22:56,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 189 transitions, 1829 flow [2024-01-30 14:22:57,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 189 transitions, 1819 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-01-30 14:22:57,038 INFO L231 Difference]: Finished difference. Result has 112 places, 97 transitions, 796 flow [2024-01-30 14:22:57,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=796, PETRI_PLACES=112, PETRI_TRANSITIONS=97} [2024-01-30 14:22:57,039 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 31 predicate places. [2024-01-30 14:22:57,039 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 97 transitions, 796 flow [2024-01-30 14:22:57,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:57,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:57,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:57,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-01-30 14:22:57,040 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:57,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1000293666, now seen corresponding path program 2 times [2024-01-30 14:22:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:57,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932851753] [2024-01-30 14:22:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:57,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:57,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:57,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932851753] [2024-01-30 14:22:57,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932851753] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:22:57,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:22:57,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-30 14:22:57,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941767781] [2024-01-30 14:22:57,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:22:57,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:22:57,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:22:57,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:22:57,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:22:57,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:22:57,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 97 transitions, 796 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:57,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:22:57,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:22:57,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:22:58,778 INFO L124 PetriNetUnfolderBase]: 13304/18683 cut-off events. [2024-01-30 14:22:58,778 INFO L125 PetriNetUnfolderBase]: For 124359/129104 co-relation queries the response was YES. [2024-01-30 14:22:58,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82744 conditions, 18683 events. 13304/18683 cut-off events. For 124359/129104 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 116669 event pairs, 2143 based on Foata normal form. 1348/19176 useless extension candidates. Maximal degree in co-relation 82660. Up to 8589 conditions per place. [2024-01-30 14:22:58,965 INFO L140 encePairwiseOnDemand]: 68/77 looper letters, 158 selfloop transitions, 16 changer transitions 0/197 dead transitions. [2024-01-30 14:22:58,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 197 transitions, 1951 flow [2024-01-30 14:22:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-30 14:22:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-30 14:22:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 297 transitions. [2024-01-30 14:22:58,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2024-01-30 14:22:58,967 INFO L175 Difference]: Start difference. First operand has 112 places, 97 transitions, 796 flow. Second operand 5 states and 297 transitions. [2024-01-30 14:22:58,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 197 transitions, 1951 flow [2024-01-30 14:22:59,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 197 transitions, 1934 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-30 14:22:59,200 INFO L231 Difference]: Finished difference. Result has 118 places, 102 transitions, 896 flow [2024-01-30 14:22:59,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=896, PETRI_PLACES=118, PETRI_TRANSITIONS=102} [2024-01-30 14:22:59,200 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 37 predicate places. [2024-01-30 14:22:59,200 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 102 transitions, 896 flow [2024-01-30 14:22:59,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:22:59,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:22:59,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:22:59,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-01-30 14:22:59,201 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:22:59,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:22:59,202 INFO L85 PathProgramCache]: Analyzing trace with hash -786817993, now seen corresponding path program 1 times [2024-01-30 14:22:59,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:22:59,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655776330] [2024-01-30 14:22:59,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:22:59,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:22:59,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:22:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655776330] [2024-01-30 14:22:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655776330] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:22:59,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414111432] [2024-01-30 14:22:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:22:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:22:59,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:22:59,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:22:59,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-01-30 14:22:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:22:59,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:22:59,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:23:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:22,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:23:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414111432] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:23:23,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:23:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-30 14:23:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888473133] [2024-01-30 14:23:23,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:23:23,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-30 14:23:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:23,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-30 14:23:23,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2024-01-30 14:23:24,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:32,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:37,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:41,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:41,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 77 [2024-01-30 14:23:41,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 102 transitions, 896 flow. Second operand has 19 states, 19 states have (on average 42.578947368421055) internal successors, (809), 19 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:41,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:41,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 77 [2024-01-30 14:23:41,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:51,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:54,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:23:56,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:00,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:05,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:10,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:15,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:24:15,392 INFO L124 PetriNetUnfolderBase]: 29934/42356 cut-off events. [2024-01-30 14:24:15,393 INFO L125 PetriNetUnfolderBase]: For 302130/312421 co-relation queries the response was YES. [2024-01-30 14:24:15,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199610 conditions, 42356 events. 29934/42356 cut-off events. For 302130/312421 co-relation queries the response was YES. Maximal size of possible extension queue 2025. Compared 286544 event pairs, 3228 based on Foata normal form. 1423/42446 useless extension candidates. Maximal degree in co-relation 199519. Up to 19554 conditions per place. [2024-01-30 14:24:15,764 INFO L140 encePairwiseOnDemand]: 64/77 looper letters, 378 selfloop transitions, 197 changer transitions 29/627 dead transitions. [2024-01-30 14:24:15,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 627 transitions, 6103 flow [2024-01-30 14:24:15,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-30 14:24:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-30 14:24:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1283 transitions. [2024-01-30 14:24:15,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7244494635798984 [2024-01-30 14:24:15,768 INFO L175 Difference]: Start difference. First operand has 118 places, 102 transitions, 896 flow. Second operand 23 states and 1283 transitions. [2024-01-30 14:24:15,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 627 transitions, 6103 flow [2024-01-30 14:24:16,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 627 transitions, 6044 flow, removed 26 selfloop flow, removed 1 redundant places. [2024-01-30 14:24:16,435 INFO L231 Difference]: Finished difference. Result has 149 places, 295 transitions, 3969 flow [2024-01-30 14:24:16,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3969, PETRI_PLACES=149, PETRI_TRANSITIONS=295} [2024-01-30 14:24:16,435 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 68 predicate places. [2024-01-30 14:24:16,435 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 295 transitions, 3969 flow [2024-01-30 14:24:16,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 42.578947368421055) internal successors, (809), 19 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:24:16,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:24:16,436 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:24:16,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-30 14:24:16,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:24:16,647 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:24:16,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:24:16,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2004511291, now seen corresponding path program 2 times [2024-01-30 14:24:16,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:24:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192511113] [2024-01-30 14:24:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:24:16,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:24:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:24:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:24:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:24:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192511113] [2024-01-30 14:24:17,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192511113] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:24:17,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690351503] [2024-01-30 14:24:17,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-30 14:24:17,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:24:17,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:24:17,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:24:17,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-30 14:24:17,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-30 14:24:17,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:24:17,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:24:17,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:25:36,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:36,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:25:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:25:38,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690351503] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:25:38,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:25:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-30 14:25:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805647144] [2024-01-30 14:25:38,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:25:38,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-30 14:25:38,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:25:38,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-30 14:25:38,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=245, Unknown=5, NotChecked=0, Total=342 [2024-01-30 14:25:42,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:25:46,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:25:49,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:25:53,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:25:57,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:00,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:04,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:04,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 77 [2024-01-30 14:26:04,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 295 transitions, 3969 flow. Second operand has 19 states, 19 states have (on average 37.578947368421055) internal successors, (714), 19 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:26:04,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:26:04,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 77 [2024-01-30 14:26:04,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:26:12,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:17,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:27,199 WARN L293 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 62 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:26:33,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:36,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:42,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:48,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:52,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:55,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:26:59,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:07,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:12,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:20,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:23,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:27:26,209 INFO L124 PetriNetUnfolderBase]: 56845/79059 cut-off events. [2024-01-30 14:27:26,209 INFO L125 PetriNetUnfolderBase]: For 723124/723248 co-relation queries the response was YES. [2024-01-30 14:27:27,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428255 conditions, 79059 events. 56845/79059 cut-off events. For 723124/723248 co-relation queries the response was YES. Maximal size of possible extension queue 4119. Compared 556690 event pairs, 6133 based on Foata normal form. 85/78982 useless extension candidates. Maximal degree in co-relation 428150. Up to 40958 conditions per place. [2024-01-30 14:27:27,410 INFO L140 encePairwiseOnDemand]: 64/77 looper letters, 573 selfloop transitions, 355 changer transitions 27/968 dead transitions. [2024-01-30 14:27:27,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 968 transitions, 12516 flow [2024-01-30 14:27:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-30 14:27:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-30 14:27:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1179 transitions. [2024-01-30 14:27:27,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6959858323494688 [2024-01-30 14:27:27,413 INFO L175 Difference]: Start difference. First operand has 149 places, 295 transitions, 3969 flow. Second operand 22 states and 1179 transitions. [2024-01-30 14:27:27,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 968 transitions, 12516 flow [2024-01-30 14:27:32,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 968 transitions, 11797 flow, removed 354 selfloop flow, removed 2 redundant places. [2024-01-30 14:27:32,157 INFO L231 Difference]: Finished difference. Result has 178 places, 539 transitions, 8667 flow [2024-01-30 14:27:32,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=3634, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=145, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=8667, PETRI_PLACES=178, PETRI_TRANSITIONS=539} [2024-01-30 14:27:32,158 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 97 predicate places. [2024-01-30 14:27:32,158 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 539 transitions, 8667 flow [2024-01-30 14:27:32,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 37.578947368421055) internal successors, (714), 19 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:27:32,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:27:32,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:27:32,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-30 14:27:32,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:27:32,371 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:27:32,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:27:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -280555077, now seen corresponding path program 1 times [2024-01-30 14:27:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:27:32,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899899512] [2024-01-30 14:27:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:27:32,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:27:32,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:27:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:27:32,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:27:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899899512] [2024-01-30 14:27:32,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899899512] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:27:32,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459536004] [2024-01-30 14:27:32,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:27:32,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:27:32,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:27:32,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:27:32,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-30 14:27:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:27:32,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:27:32,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:29:06,909 WARN L293 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:30:21,098 WARN L293 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:31:07,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:31:07,426 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:31:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:31:49,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459536004] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:31:49,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:31:49,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 20 [2024-01-30 14:31:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635087481] [2024-01-30 14:31:49,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:31:49,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-30 14:31:49,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:31:49,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-30 14:31:49,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=268, Unknown=28, NotChecked=0, Total=380 [2024-01-30 14:31:52,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:31:56,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:00,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:04,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:08,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:12,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:16,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:20,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:20,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 77 [2024-01-30 14:32:20,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 539 transitions, 8667 flow. Second operand has 20 states, 20 states have (on average 37.15) internal successors, (743), 20 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:32:20,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:32:20,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 77 [2024-01-30 14:32:20,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:32:31,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:35,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:32:50,869 WARN L293 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 61 DAG size of output: 30 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:32:56,797 WARN L293 SmtUtils]: Spent 5.32s on a formula simplification. DAG size of input: 82 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:33:09,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:11,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:13,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:17,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:33,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:34,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:37,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:39,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:43,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:47,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:50,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:54,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:33:57,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:08,200 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 40 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-30 14:34:12,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:14,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:18,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:23,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:32,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:50,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:34:58,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-30 14:35:23,642 INFO L124 PetriNetUnfolderBase]: 103672/141778 cut-off events. [2024-01-30 14:35:23,642 INFO L125 PetriNetUnfolderBase]: For 1904433/1904703 co-relation queries the response was YES. [2024-01-30 14:35:25,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 881608 conditions, 141778 events. 103672/141778 cut-off events. For 1904433/1904703 co-relation queries the response was YES. Maximal size of possible extension queue 7434. Compared 1018399 event pairs, 7863 based on Foata normal form. 182/141843 useless extension candidates. Maximal degree in co-relation 881490. Up to 84644 conditions per place. [2024-01-30 14:35:26,492 INFO L140 encePairwiseOnDemand]: 64/77 looper letters, 1265 selfloop transitions, 1277 changer transitions 19/2574 dead transitions. [2024-01-30 14:35:26,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 2574 transitions, 44368 flow [2024-01-30 14:35:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-01-30 14:35:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-01-30 14:35:26,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1220 transitions. [2024-01-30 14:35:26,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6888763410502541 [2024-01-30 14:35:26,495 INFO L175 Difference]: Start difference. First operand has 178 places, 539 transitions, 8667 flow. Second operand 23 states and 1220 transitions. [2024-01-30 14:35:26,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 2574 transitions, 44368 flow [2024-01-30 14:35:55,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 2574 transitions, 43747 flow, removed 302 selfloop flow, removed 2 redundant places. [2024-01-30 14:35:55,085 INFO L231 Difference]: Finished difference. Result has 208 places, 1782 transitions, 35367 flow [2024-01-30 14:35:55,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=77, PETRI_DIFFERENCE_MINUEND_FLOW=8500, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=35367, PETRI_PLACES=208, PETRI_TRANSITIONS=1782} [2024-01-30 14:35:55,086 INFO L281 CegarLoopForPetriNet]: 81 programPoint places, 127 predicate places. [2024-01-30 14:35:55,086 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 1782 transitions, 35367 flow [2024-01-30 14:35:55,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 37.15) internal successors, (743), 20 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:35:55,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:35:55,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:35:55,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-30 14:35:55,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:35:55,301 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 39 more)] === [2024-01-30 14:35:55,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:35:55,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1545626109, now seen corresponding path program 2 times [2024-01-30 14:35:55,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:35:55,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580864034] [2024-01-30 14:35:55,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:35:55,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:35:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:35:55,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:35:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:35:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580864034] [2024-01-30 14:35:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580864034] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-30 14:35:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436737773] [2024-01-30 14:35:55,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-30 14:35:55,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-30 14:35:55,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:35:55,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-30 14:35:55,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-30 14:35:55,899 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-30 14:35:55,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-30 14:35:55,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-30 14:35:55,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-30 14:35:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:35:59,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-30 14:36:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:36:00,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436737773] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-30 14:36:00,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-30 14:36:00,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-01-30 14:36:00,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151719250] [2024-01-30 14:36:00,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-30 14:36:00,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-01-30 14:36:00,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:36:00,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-01-30 14:36:00,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-01-30 14:36:01,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 77 [2024-01-30 14:36:01,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 1782 transitions, 35367 flow. Second operand has 19 states, 19 states have (on average 44.36842105263158) internal successors, (843), 19 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:36:01,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:36:01,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 77 [2024-01-30 14:36:01,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand