./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe020_rmo.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe020_rmo.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:51:20,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:51:20,368 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:51:20,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:51:20,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:51:20,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:51:20,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:51:20,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:51:20,389 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:51:20,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:51:20,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:51:20,390 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:51:20,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:51:20,391 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:51:20,391 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:51:20,392 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:51:20,392 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:51:20,392 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:51:20,392 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:51:20,392 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:51:20,393 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:51:20,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:51:20,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:51:20,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:51:20,394 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:51:20,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:51:20,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:51:20,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:51:20,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:51:20,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:51:20,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:51:20,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:51:20,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:51:20,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:51:20,396 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:51:20,396 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:51:20,396 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:51:20,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:51:20,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:51:20,397 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:51:20,397 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:51:20,397 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:51:20,397 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:51:20,398 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:51:20,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:51:20,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:51:20,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:51:20,625 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:51:20,625 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:51:20,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe020_rmo.yml/witness.yml [2024-06-27 22:51:20,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:51:20,716 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:51:20,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2024-06-27 22:51:21,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:51:21,911 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:51:21,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i [2024-06-27 22:51:21,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cc829c0/ab413c52ede842658f2158aafc82636e/FLAG73cb593be [2024-06-27 22:51:22,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05cc829c0/ab413c52ede842658f2158aafc82636e [2024-06-27 22:51:22,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:51:22,292 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:51:22,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:51:22,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:51:22,296 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:51:22,297 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:51:20" (1/2) ... [2024-06-27 22:51:22,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f89e936 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:51:22, skipping insertion in model container [2024-06-27 22:51:22,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:51:20" (1/2) ... [2024-06-27 22:51:22,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@331e9dc3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:51:22, skipping insertion in model container [2024-06-27 22:51:22,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:51:22" (2/2) ... [2024-06-27 22:51:22,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f89e936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22, skipping insertion in model container [2024-06-27 22:51:22,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:51:22" (2/2) ... [2024-06-27 22:51:22,300 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:51:22,348 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:51:22,349 INFO L97 edCorrectnessWitness]: Location invariant before [L852-L852] ! multithreaded || (((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) [2024-06-27 22:51:22,349 INFO L97 edCorrectnessWitness]: Location invariant before [L854-L854] ! multithreaded || (((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) [2024-06-27 22:51:22,349 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] ! multithreaded || (((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p0_EAX) + (long long )x$mem_tmp >= 0LL) && (long long )x - (long long )x$mem_tmp >= 0LL) [2024-06-27 22:51:22,349 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:51:22,349 INFO L106 edCorrectnessWitness]: ghost_update [L850-L850] multithreaded = 1; [2024-06-27 22:51:22,405 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:51:22,542 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i[988,1001] [2024-06-27 22:51:22,699 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:51:22,712 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:51:22,740 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe020_rmo.i[988,1001] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:51:22,803 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:51:22,840 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:51:22,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22 WrapperNode [2024-06-27 22:51:22,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:51:22,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:51:22,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:51:22,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:51:22,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,880 INFO L138 Inliner]: procedures = 175, calls = 69, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2024-06-27 22:51:22,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:51:22,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:51:22,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:51:22,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:51:22,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,922 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 8 writes are split as follows [0, 8]. [2024-06-27 22:51:22,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,934 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:51:22,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:51:22,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:51:22,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:51:22,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (1/1) ... [2024-06-27 22:51:22,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:51:22,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:51:22,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:51:22,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:51:23,009 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 22:51:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 22:51:23,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 22:51:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 22:51:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:51:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:51:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:51:23,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:51:23,011 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:51:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:51:23,012 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:51:23,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:51:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:51:23,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 22:51:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:51:23,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:51:23,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:51:23,017 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:51:23,166 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:51:23,167 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:51:23,487 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:51:23,488 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:51:23,736 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:51:23,736 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:51:23,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:51:23 BoogieIcfgContainer [2024-06-27 22:51:23,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:51:23,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:51:23,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:51:23,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:51:23,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:51:20" (1/4) ... [2024-06-27 22:51:23,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a3c11f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:51:23, skipping insertion in model container [2024-06-27 22:51:23,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:51:22" (2/4) ... [2024-06-27 22:51:23,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a3c11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:51:23, skipping insertion in model container [2024-06-27 22:51:23,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:51:22" (3/4) ... [2024-06-27 22:51:23,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61a3c11f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:51:23, skipping insertion in model container [2024-06-27 22:51:23,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:51:23" (4/4) ... [2024-06-27 22:51:23,746 INFO L112 eAbstractionObserver]: Analyzing ICFG safe020_rmo.i [2024-06-27 22:51:23,760 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:51:23,761 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:51:23,761 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:51:23,807 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:51:23,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:51:23,864 INFO L124 PetriNetUnfolderBase]: 1/44 cut-off events. [2024-06-27 22:51:23,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:51:23,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 44 events. 1/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-06-27 22:51:23,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 47 transitions, 106 flow [2024-06-27 22:51:23,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 41 transitions, 91 flow [2024-06-27 22:51:23,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:51:23,896 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;@5ac7aa69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:51:23,896 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:51:23,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:51:23,899 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:51:23,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:51:23,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:23,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:51:23,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:23,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:23,905 INFO L85 PathProgramCache]: Analyzing trace with hash 644149960, now seen corresponding path program 1 times [2024-06-27 22:51:23,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:23,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213441767] [2024-06-27 22:51:23,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:23,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:24,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213441767] [2024-06-27 22:51:24,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213441767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:51:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105943862] [2024-06-27 22:51:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:24,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:51:24,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:51:24,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:51:24,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:24,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:24,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:24,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:24,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:24,756 INFO L124 PetriNetUnfolderBase]: 978/1760 cut-off events. [2024-06-27 22:51:24,756 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-06-27 22:51:24,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 1760 events. 978/1760 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11217 event pairs, 552 based on Foata normal form. 0/1679 useless extension candidates. Maximal degree in co-relation 3268. Up to 1470 conditions per place. [2024-06-27 22:51:24,774 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 39 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 22:51:24,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 217 flow [2024-06-27 22:51:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:51:24,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:51:24,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-06-27 22:51:24,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6950354609929078 [2024-06-27 22:51:24,785 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 91 flow. Second operand 3 states and 98 transitions. [2024-06-27 22:51:24,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 217 flow [2024-06-27 22:51:24,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 212 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:51:24,792 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 125 flow [2024-06-27 22:51:24,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-06-27 22:51:24,795 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2024-06-27 22:51:24,796 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 125 flow [2024-06-27 22:51:24,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:24,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:24,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:24,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:51:24,796 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:24,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash -978167088, now seen corresponding path program 1 times [2024-06-27 22:51:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:24,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490208140] [2024-06-27 22:51:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:25,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490208140] [2024-06-27 22:51:25,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490208140] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:25,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:25,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:51:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384905663] [2024-06-27 22:51:25,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:25,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:51:25,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:25,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:51:25,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:51:25,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:25,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:25,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:25,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:25,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:25,432 INFO L124 PetriNetUnfolderBase]: 969/1727 cut-off events. [2024-06-27 22:51:25,433 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2024-06-27 22:51:25,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3750 conditions, 1727 events. 969/1727 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11036 event pairs, 348 based on Foata normal form. 6/1708 useless extension candidates. Maximal degree in co-relation 3738. Up to 1405 conditions per place. [2024-06-27 22:51:25,443 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 36 selfloop transitions, 7 changer transitions 0/56 dead transitions. [2024-06-27 22:51:25,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 239 flow [2024-06-27 22:51:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:51:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:51:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-06-27 22:51:25,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-06-27 22:51:25,445 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 125 flow. Second operand 3 states and 94 transitions. [2024-06-27 22:51:25,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 56 transitions, 239 flow [2024-06-27 22:51:25,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:25,449 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 159 flow [2024-06-27 22:51:25,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2024-06-27 22:51:25,452 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2024-06-27 22:51:25,452 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 159 flow [2024-06-27 22:51:25,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:25,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:25,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:25,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:51:25,459 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:25,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1193770193, now seen corresponding path program 1 times [2024-06-27 22:51:25,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:25,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731248338] [2024-06-27 22:51:25,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:25,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:25,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731248338] [2024-06-27 22:51:25,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731248338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:25,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:25,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:51:25,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882282643] [2024-06-27 22:51:25,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:51:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:51:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:51:25,542 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:25,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:25,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:25,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:25,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:25,841 INFO L124 PetriNetUnfolderBase]: 972/1749 cut-off events. [2024-06-27 22:51:25,842 INFO L125 PetriNetUnfolderBase]: For 712/712 co-relation queries the response was YES. [2024-06-27 22:51:25,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 1749 events. 972/1749 cut-off events. For 712/712 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11083 event pairs, 414 based on Foata normal form. 2/1737 useless extension candidates. Maximal degree in co-relation 4106. Up to 1376 conditions per place. [2024-06-27 22:51:25,851 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 59 selfloop transitions, 11 changer transitions 0/83 dead transitions. [2024-06-27 22:51:25,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 83 transitions, 409 flow [2024-06-27 22:51:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:51:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:51:25,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2024-06-27 22:51:25,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7074468085106383 [2024-06-27 22:51:25,853 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 159 flow. Second operand 4 states and 133 transitions. [2024-06-27 22:51:25,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 83 transitions, 409 flow [2024-06-27 22:51:25,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 83 transitions, 402 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:25,855 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 237 flow [2024-06-27 22:51:25,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-06-27 22:51:25,856 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2024-06-27 22:51:25,856 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 237 flow [2024-06-27 22:51:25,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:25,857 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:25,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:25,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:51:25,857 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:25,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:25,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1633021741, now seen corresponding path program 1 times [2024-06-27 22:51:25,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:25,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688384478] [2024-06-27 22:51:25,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:25,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:26,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:26,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688384478] [2024-06-27 22:51:26,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688384478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:26,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:26,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:51:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544908585] [2024-06-27 22:51:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:26,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:51:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:26,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:51:26,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:51:26,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:26,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:26,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:26,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:26,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:26,364 INFO L124 PetriNetUnfolderBase]: 977/1769 cut-off events. [2024-06-27 22:51:26,364 INFO L125 PetriNetUnfolderBase]: For 1706/1706 co-relation queries the response was YES. [2024-06-27 22:51:26,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 1769 events. 977/1769 cut-off events. For 1706/1706 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11238 event pairs, 401 based on Foata normal form. 4/1762 useless extension candidates. Maximal degree in co-relation 4803. Up to 1382 conditions per place. [2024-06-27 22:51:26,374 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 58 selfloop transitions, 13 changer transitions 0/84 dead transitions. [2024-06-27 22:51:26,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 465 flow [2024-06-27 22:51:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:51:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:51:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-06-27 22:51:26,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7021276595744681 [2024-06-27 22:51:26,377 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 237 flow. Second operand 4 states and 132 transitions. [2024-06-27 22:51:26,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 465 flow [2024-06-27 22:51:26,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 455 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:26,383 INFO L231 Difference]: Finished difference. Result has 60 places, 57 transitions, 291 flow [2024-06-27 22:51:26,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=60, PETRI_TRANSITIONS=57} [2024-06-27 22:51:26,384 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2024-06-27 22:51:26,384 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 57 transitions, 291 flow [2024-06-27 22:51:26,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:26,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:26,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:26,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:51:26,385 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:26,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -981147, now seen corresponding path program 1 times [2024-06-27 22:51:26,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:26,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356196901] [2024-06-27 22:51:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:26,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:26,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:26,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356196901] [2024-06-27 22:51:26,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356196901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:26,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:26,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:51:26,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959546016] [2024-06-27 22:51:26,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:26,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:51:26,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:26,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:51:26,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:51:26,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:26,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 57 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:26,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:26,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:26,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:27,001 INFO L124 PetriNetUnfolderBase]: 1677/2932 cut-off events. [2024-06-27 22:51:27,002 INFO L125 PetriNetUnfolderBase]: For 3547/3547 co-relation queries the response was YES. [2024-06-27 22:51:27,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8064 conditions, 2932 events. 1677/2932 cut-off events. For 3547/3547 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20146 event pairs, 239 based on Foata normal form. 22/2926 useless extension candidates. Maximal degree in co-relation 8044. Up to 1168 conditions per place. [2024-06-27 22:51:27,020 INFO L140 encePairwiseOnDemand]: 38/47 looper letters, 79 selfloop transitions, 20 changer transitions 0/112 dead transitions. [2024-06-27 22:51:27,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 112 transitions, 695 flow [2024-06-27 22:51:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:27,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2024-06-27 22:51:27,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7148936170212766 [2024-06-27 22:51:27,026 INFO L175 Difference]: Start difference. First operand has 60 places, 57 transitions, 291 flow. Second operand 5 states and 168 transitions. [2024-06-27 22:51:27,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 112 transitions, 695 flow [2024-06-27 22:51:27,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 112 transitions, 674 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:27,033 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 427 flow [2024-06-27 22:51:27,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-06-27 22:51:27,035 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2024-06-27 22:51:27,035 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 427 flow [2024-06-27 22:51:27,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:27,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:27,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:27,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:51:27,036 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:27,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1017015119, now seen corresponding path program 2 times [2024-06-27 22:51:27,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:27,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814723027] [2024-06-27 22:51:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:27,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:27,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:27,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814723027] [2024-06-27 22:51:27,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814723027] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:51:27,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963502260] [2024-06-27 22:51:27,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:27,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:51:27,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:27,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:51:27,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:51:27,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:27,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 427 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:27,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:27,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:27,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:27,771 INFO L124 PetriNetUnfolderBase]: 1804/3109 cut-off events. [2024-06-27 22:51:27,771 INFO L125 PetriNetUnfolderBase]: For 7187/7187 co-relation queries the response was YES. [2024-06-27 22:51:27,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10321 conditions, 3109 events. 1804/3109 cut-off events. For 7187/7187 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21625 event pairs, 963 based on Foata normal form. 10/3072 useless extension candidates. Maximal degree in co-relation 10297. Up to 2265 conditions per place. [2024-06-27 22:51:27,793 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 67 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2024-06-27 22:51:27,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 99 transitions, 731 flow [2024-06-27 22:51:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 148 transitions. [2024-06-27 22:51:27,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6297872340425532 [2024-06-27 22:51:27,795 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 427 flow. Second operand 5 states and 148 transitions. [2024-06-27 22:51:27,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 99 transitions, 731 flow [2024-06-27 22:51:27,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 705 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-27 22:51:27,808 INFO L231 Difference]: Finished difference. Result has 70 places, 73 transitions, 526 flow [2024-06-27 22:51:27,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=526, PETRI_PLACES=70, PETRI_TRANSITIONS=73} [2024-06-27 22:51:27,811 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2024-06-27 22:51:27,811 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 73 transitions, 526 flow [2024-06-27 22:51:27,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:27,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:27,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:27,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:51:27,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:27,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:27,812 INFO L85 PathProgramCache]: Analyzing trace with hash 943860561, now seen corresponding path program 1 times [2024-06-27 22:51:27,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:27,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503581290] [2024-06-27 22:51:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:28,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503581290] [2024-06-27 22:51:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503581290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357609067] [2024-06-27 22:51:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:28,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:28,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:28,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:28,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:51:28,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 73 transitions, 526 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:28,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:28,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:51:28,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:28,802 INFO L124 PetriNetUnfolderBase]: 2400/4321 cut-off events. [2024-06-27 22:51:28,802 INFO L125 PetriNetUnfolderBase]: For 11517/11517 co-relation queries the response was YES. [2024-06-27 22:51:28,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14755 conditions, 4321 events. 2400/4321 cut-off events. For 11517/11517 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 32285 event pairs, 274 based on Foata normal form. 26/4324 useless extension candidates. Maximal degree in co-relation 14728. Up to 2089 conditions per place. [2024-06-27 22:51:28,831 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 82 selfloop transitions, 32 changer transitions 0/126 dead transitions. [2024-06-27 22:51:28,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 126 transitions, 1053 flow [2024-06-27 22:51:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:28,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-06-27 22:51:28,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6723404255319149 [2024-06-27 22:51:28,833 INFO L175 Difference]: Start difference. First operand has 70 places, 73 transitions, 526 flow. Second operand 5 states and 158 transitions. [2024-06-27 22:51:28,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 126 transitions, 1053 flow [2024-06-27 22:51:28,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 126 transitions, 1044 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 22:51:28,861 INFO L231 Difference]: Finished difference. Result has 76 places, 89 transitions, 824 flow [2024-06-27 22:51:28,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=824, PETRI_PLACES=76, PETRI_TRANSITIONS=89} [2024-06-27 22:51:28,862 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2024-06-27 22:51:28,863 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 89 transitions, 824 flow [2024-06-27 22:51:28,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:28,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:28,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:28,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:51:28,863 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:28,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1462699027, now seen corresponding path program 2 times [2024-06-27 22:51:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569734295] [2024-06-27 22:51:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:28,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:29,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569734295] [2024-06-27 22:51:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569734295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:29,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:29,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:51:29,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89995354] [2024-06-27 22:51:29,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:29,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:51:29,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:29,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:51:29,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:51:29,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:29,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 89 transitions, 824 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 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-06-27 22:51:29,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:29,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:29,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:29,935 INFO L124 PetriNetUnfolderBase]: 2641/4858 cut-off events. [2024-06-27 22:51:29,936 INFO L125 PetriNetUnfolderBase]: For 18643/18643 co-relation queries the response was YES. [2024-06-27 22:51:29,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17784 conditions, 4858 events. 2641/4858 cut-off events. For 18643/18643 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 37994 event pairs, 610 based on Foata normal form. 20/4843 useless extension candidates. Maximal degree in co-relation 17754. Up to 1995 conditions per place. [2024-06-27 22:51:29,968 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 78 selfloop transitions, 31 changer transitions 0/122 dead transitions. [2024-06-27 22:51:29,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 122 transitions, 1194 flow [2024-06-27 22:51:29,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:29,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-06-27 22:51:29,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6340425531914894 [2024-06-27 22:51:29,970 INFO L175 Difference]: Start difference. First operand has 76 places, 89 transitions, 824 flow. Second operand 5 states and 149 transitions. [2024-06-27 22:51:29,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 122 transitions, 1194 flow [2024-06-27 22:51:30,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 122 transitions, 1172 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:30,005 INFO L231 Difference]: Finished difference. Result has 81 places, 94 transitions, 976 flow [2024-06-27 22:51:30,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=976, PETRI_PLACES=81, PETRI_TRANSITIONS=94} [2024-06-27 22:51:30,006 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2024-06-27 22:51:30,006 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 976 flow [2024-06-27 22:51:30,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 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-06-27 22:51:30,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:30,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:30,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:51:30,007 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:30,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash 734769205, now seen corresponding path program 1 times [2024-06-27 22:51:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99507683] [2024-06-27 22:51:30,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:30,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:30,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:30,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:30,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99507683] [2024-06-27 22:51:30,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99507683] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:30,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:30,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:51:30,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237679705] [2024-06-27 22:51:30,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:30,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:51:30,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:30,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:51:30,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:51:30,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:30,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 976 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:30,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:30,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:30,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:30,831 INFO L124 PetriNetUnfolderBase]: 2635/4944 cut-off events. [2024-06-27 22:51:30,831 INFO L125 PetriNetUnfolderBase]: For 24049/24049 co-relation queries the response was YES. [2024-06-27 22:51:30,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18953 conditions, 4944 events. 2635/4944 cut-off events. For 24049/24049 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 39408 event pairs, 1164 based on Foata normal form. 1/4900 useless extension candidates. Maximal degree in co-relation 18919. Up to 3281 conditions per place. [2024-06-27 22:51:30,859 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 103 selfloop transitions, 31 changer transitions 0/147 dead transitions. [2024-06-27 22:51:30,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 147 transitions, 1617 flow [2024-06-27 22:51:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:30,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2024-06-27 22:51:30,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-06-27 22:51:30,861 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 976 flow. Second operand 5 states and 160 transitions. [2024-06-27 22:51:30,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 147 transitions, 1617 flow [2024-06-27 22:51:30,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 147 transitions, 1581 flow, removed 14 selfloop flow, removed 2 redundant places. [2024-06-27 22:51:30,899 INFO L231 Difference]: Finished difference. Result has 86 places, 104 transitions, 1233 flow [2024-06-27 22:51:30,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1233, PETRI_PLACES=86, PETRI_TRANSITIONS=104} [2024-06-27 22:51:30,900 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places. [2024-06-27 22:51:30,900 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 104 transitions, 1233 flow [2024-06-27 22:51:30,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:30,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:30,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:30,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:51:30,901 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:30,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash -209064939, now seen corresponding path program 1 times [2024-06-27 22:51:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552197528] [2024-06-27 22:51:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552197528] [2024-06-27 22:51:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552197528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:51:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166266533] [2024-06-27 22:51:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:31,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:51:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:51:31,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:51:31,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:51:31,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 104 transitions, 1233 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:31,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:31,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:51:31,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:31,850 INFO L124 PetriNetUnfolderBase]: 2778/5149 cut-off events. [2024-06-27 22:51:31,850 INFO L125 PetriNetUnfolderBase]: For 27914/27917 co-relation queries the response was YES. [2024-06-27 22:51:31,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21118 conditions, 5149 events. 2778/5149 cut-off events. For 27914/27917 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 40469 event pairs, 1006 based on Foata normal form. 10/5123 useless extension candidates. Maximal degree in co-relation 21080. Up to 3955 conditions per place. [2024-06-27 22:51:31,885 INFO L140 encePairwiseOnDemand]: 36/47 looper letters, 112 selfloop transitions, 46 changer transitions 0/170 dead transitions. [2024-06-27 22:51:31,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 170 transitions, 2060 flow [2024-06-27 22:51:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:51:31,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:51:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 183 transitions. [2024-06-27 22:51:31,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.648936170212766 [2024-06-27 22:51:31,887 INFO L175 Difference]: Start difference. First operand has 86 places, 104 transitions, 1233 flow. Second operand 6 states and 183 transitions. [2024-06-27 22:51:31,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 170 transitions, 2060 flow [2024-06-27 22:51:31,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 170 transitions, 1967 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-06-27 22:51:31,935 INFO L231 Difference]: Finished difference. Result has 93 places, 129 transitions, 1679 flow [2024-06-27 22:51:31,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1159, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1679, PETRI_PLACES=93, PETRI_TRANSITIONS=129} [2024-06-27 22:51:31,937 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places. [2024-06-27 22:51:31,937 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 129 transitions, 1679 flow [2024-06-27 22:51:31,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:31,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:31,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:31,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:51:31,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:31,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:31,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1454389747, now seen corresponding path program 2 times [2024-06-27 22:51:31,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:31,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922937011] [2024-06-27 22:51:31,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:31,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:32,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922937011] [2024-06-27 22:51:32,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922937011] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:32,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:32,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:51:32,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377707157] [2024-06-27 22:51:32,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:32,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:51:32,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:32,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:51:32,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:51:32,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:32,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 129 transitions, 1679 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-06-27 22:51:32,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:32,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:32,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:33,091 INFO L124 PetriNetUnfolderBase]: 2814/5255 cut-off events. [2024-06-27 22:51:33,093 INFO L125 PetriNetUnfolderBase]: For 31270/31273 co-relation queries the response was YES. [2024-06-27 22:51:33,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22076 conditions, 5255 events. 2814/5255 cut-off events. For 31270/31273 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 41673 event pairs, 962 based on Foata normal form. 6/5226 useless extension candidates. Maximal degree in co-relation 22033. Up to 3360 conditions per place. [2024-06-27 22:51:33,128 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 118 selfloop transitions, 51 changer transitions 0/182 dead transitions. [2024-06-27 22:51:33,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 182 transitions, 2401 flow [2024-06-27 22:51:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-06-27 22:51:33,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6936170212765957 [2024-06-27 22:51:33,130 INFO L175 Difference]: Start difference. First operand has 93 places, 129 transitions, 1679 flow. Second operand 5 states and 163 transitions. [2024-06-27 22:51:33,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 182 transitions, 2401 flow [2024-06-27 22:51:33,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 182 transitions, 2315 flow, removed 43 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:33,182 INFO L231 Difference]: Finished difference. Result has 99 places, 138 transitions, 1931 flow [2024-06-27 22:51:33,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1615, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1931, PETRI_PLACES=99, PETRI_TRANSITIONS=138} [2024-06-27 22:51:33,183 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2024-06-27 22:51:33,183 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 138 transitions, 1931 flow [2024-06-27 22:51:33,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-06-27 22:51:33,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:33,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:33,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:51:33,183 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:33,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1861604428, now seen corresponding path program 1 times [2024-06-27 22:51:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095182347] [2024-06-27 22:51:33,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:33,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095182347] [2024-06-27 22:51:33,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095182347] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:33,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:33,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:51:33,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761922211] [2024-06-27 22:51:33,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:33,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:51:33,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:33,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:51:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:51:33,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:33,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 138 transitions, 1931 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-06-27 22:51:33,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:33,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:33,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:34,094 INFO L124 PetriNetUnfolderBase]: 2769/5107 cut-off events. [2024-06-27 22:51:34,094 INFO L125 PetriNetUnfolderBase]: For 33427/33430 co-relation queries the response was YES. [2024-06-27 22:51:34,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22274 conditions, 5107 events. 2769/5107 cut-off events. For 33427/33430 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 40023 event pairs, 345 based on Foata normal form. 26/5097 useless extension candidates. Maximal degree in co-relation 22227. Up to 1932 conditions per place. [2024-06-27 22:51:34,131 INFO L140 encePairwiseOnDemand]: 39/47 looper letters, 124 selfloop transitions, 49 changer transitions 0/186 dead transitions. [2024-06-27 22:51:34,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 186 transitions, 2542 flow [2024-06-27 22:51:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-06-27 22:51:34,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6936170212765957 [2024-06-27 22:51:34,132 INFO L175 Difference]: Start difference. First operand has 99 places, 138 transitions, 1931 flow. Second operand 5 states and 163 transitions. [2024-06-27 22:51:34,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 186 transitions, 2542 flow [2024-06-27 22:51:34,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 186 transitions, 2458 flow, removed 42 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:34,194 INFO L231 Difference]: Finished difference. Result has 104 places, 138 transitions, 1983 flow [2024-06-27 22:51:34,194 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1983, PETRI_PLACES=104, PETRI_TRANSITIONS=138} [2024-06-27 22:51:34,195 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 53 predicate places. [2024-06-27 22:51:34,195 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 1983 flow [2024-06-27 22:51:34,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-06-27 22:51:34,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:34,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:34,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:51:34,195 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:34,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1786121622, now seen corresponding path program 1 times [2024-06-27 22:51:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447422855] [2024-06-27 22:51:34,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:34,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:34,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447422855] [2024-06-27 22:51:34,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447422855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:34,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:34,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:51:34,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874230207] [2024-06-27 22:51:34,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:34,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:51:34,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:34,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:51:34,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:51:34,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:51:34,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 1983 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:34,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:34,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:51:34,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:35,289 INFO L124 PetriNetUnfolderBase]: 6000/9489 cut-off events. [2024-06-27 22:51:35,290 INFO L125 PetriNetUnfolderBase]: For 60760/60770 co-relation queries the response was YES. [2024-06-27 22:51:35,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37838 conditions, 9489 events. 6000/9489 cut-off events. For 60760/60770 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 64209 event pairs, 1134 based on Foata normal form. 339/9809 useless extension candidates. Maximal degree in co-relation 37788. Up to 4829 conditions per place. [2024-06-27 22:51:35,359 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 210 selfloop transitions, 5 changer transitions 1/226 dead transitions. [2024-06-27 22:51:35,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 226 transitions, 3482 flow [2024-06-27 22:51:35,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:51:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:51:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-06-27 22:51:35,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6276595744680851 [2024-06-27 22:51:35,360 INFO L175 Difference]: Start difference. First operand has 104 places, 138 transitions, 1983 flow. Second operand 4 states and 118 transitions. [2024-06-27 22:51:35,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 226 transitions, 3482 flow [2024-06-27 22:51:35,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 226 transitions, 3318 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:51:35,538 INFO L231 Difference]: Finished difference. Result has 105 places, 127 transitions, 1654 flow [2024-06-27 22:51:35,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1620, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1654, PETRI_PLACES=105, PETRI_TRANSITIONS=127} [2024-06-27 22:51:35,539 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 54 predicate places. [2024-06-27 22:51:35,540 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 127 transitions, 1654 flow [2024-06-27 22:51:35,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:35,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:35,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:35,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:51:35,541 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:35,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 416241399, now seen corresponding path program 1 times [2024-06-27 22:51:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:35,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983381249] [2024-06-27 22:51:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:35,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:35,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:35,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983381249] [2024-06-27 22:51:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983381249] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:35,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393492984] [2024-06-27 22:51:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:35,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:35,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:51:35,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 127 transitions, 1654 flow. Second operand has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:35,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:35,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:51:35,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:37,011 INFO L124 PetriNetUnfolderBase]: 4895/8932 cut-off events. [2024-06-27 22:51:37,011 INFO L125 PetriNetUnfolderBase]: For 46197/46218 co-relation queries the response was YES. [2024-06-27 22:51:37,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35256 conditions, 8932 events. 4895/8932 cut-off events. For 46197/46218 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 71864 event pairs, 1478 based on Foata normal form. 9/8608 useless extension candidates. Maximal degree in co-relation 35203. Up to 3973 conditions per place. [2024-06-27 22:51:37,092 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 134 selfloop transitions, 74 changer transitions 0/223 dead transitions. [2024-06-27 22:51:37,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 223 transitions, 2905 flow [2024-06-27 22:51:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:51:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:51:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 242 transitions. [2024-06-27 22:51:37,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6436170212765957 [2024-06-27 22:51:37,098 INFO L175 Difference]: Start difference. First operand has 105 places, 127 transitions, 1654 flow. Second operand 8 states and 242 transitions. [2024-06-27 22:51:37,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 223 transitions, 2905 flow [2024-06-27 22:51:37,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 223 transitions, 2873 flow, removed 7 selfloop flow, removed 2 redundant places. [2024-06-27 22:51:37,248 INFO L231 Difference]: Finished difference. Result has 114 places, 159 transitions, 2424 flow [2024-06-27 22:51:37,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1646, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2424, PETRI_PLACES=114, PETRI_TRANSITIONS=159} [2024-06-27 22:51:37,249 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 63 predicate places. [2024-06-27 22:51:37,250 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 159 transitions, 2424 flow [2024-06-27 22:51:37,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.285714285714285) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:37,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:37,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:51:37,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:51:37,250 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:37,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:37,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1013396241, now seen corresponding path program 2 times [2024-06-27 22:51:37,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:37,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121539773] [2024-06-27 22:51:37,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:37,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:37,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:37,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:37,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121539773] [2024-06-27 22:51:37,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121539773] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:37,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:37,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:51:37,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412441697] [2024-06-27 22:51:37,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:37,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:51:37,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:37,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:51:37,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:51:37,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:37,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 159 transitions, 2424 flow. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-06-27 22:51:37,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:37,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:37,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:39,006 INFO L124 PetriNetUnfolderBase]: 5335/9628 cut-off events. [2024-06-27 22:51:39,006 INFO L125 PetriNetUnfolderBase]: For 61914/61947 co-relation queries the response was YES. [2024-06-27 22:51:39,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39392 conditions, 9628 events. 5335/9628 cut-off events. For 61914/61947 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 78742 event pairs, 1813 based on Foata normal form. 8/9231 useless extension candidates. Maximal degree in co-relation 39336. Up to 4385 conditions per place. [2024-06-27 22:51:39,107 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 116 selfloop transitions, 86 changer transitions 0/218 dead transitions. [2024-06-27 22:51:39,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 218 transitions, 3303 flow [2024-06-27 22:51:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:51:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:51:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2024-06-27 22:51:39,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6808510638297872 [2024-06-27 22:51:39,110 INFO L175 Difference]: Start difference. First operand has 114 places, 159 transitions, 2424 flow. Second operand 6 states and 192 transitions. [2024-06-27 22:51:39,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 218 transitions, 3303 flow [2024-06-27 22:51:39,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 218 transitions, 3213 flow, removed 45 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:39,312 INFO L231 Difference]: Finished difference. Result has 123 places, 173 transitions, 2957 flow [2024-06-27 22:51:39,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2334, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2957, PETRI_PLACES=123, PETRI_TRANSITIONS=173} [2024-06-27 22:51:39,313 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 72 predicate places. [2024-06-27 22:51:39,313 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 173 transitions, 2957 flow [2024-06-27 22:51:39,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 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-06-27 22:51:39,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:39,313 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] [2024-06-27 22:51:39,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:51:39,314 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:39,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1743980361, now seen corresponding path program 1 times [2024-06-27 22:51:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258606317] [2024-06-27 22:51:39,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:39,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:39,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:39,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258606317] [2024-06-27 22:51:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258606317] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:39,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:39,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:51:39,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043902606] [2024-06-27 22:51:39,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:39,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:51:39,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:39,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:51:39,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:51:39,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 47 [2024-06-27 22:51:39,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 173 transitions, 2957 flow. Second operand has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:39,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:39,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 47 [2024-06-27 22:51:39,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:42,063 INFO L124 PetriNetUnfolderBase]: 9068/16634 cut-off events. [2024-06-27 22:51:42,063 INFO L125 PetriNetUnfolderBase]: For 128671/128694 co-relation queries the response was YES. [2024-06-27 22:51:42,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68784 conditions, 16634 events. 9068/16634 cut-off events. For 128671/128694 co-relation queries the response was YES. Maximal size of possible extension queue 1154. Compared 150380 event pairs, 2842 based on Foata normal form. 22/15966 useless extension candidates. Maximal degree in co-relation 68721. Up to 4309 conditions per place. [2024-06-27 22:51:42,185 INFO L140 encePairwiseOnDemand]: 37/47 looper letters, 221 selfloop transitions, 99 changer transitions 0/335 dead transitions. [2024-06-27 22:51:42,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 335 transitions, 5399 flow [2024-06-27 22:51:42,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:51:42,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:51:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 319 transitions. [2024-06-27 22:51:42,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-06-27 22:51:42,186 INFO L175 Difference]: Start difference. First operand has 123 places, 173 transitions, 2957 flow. Second operand 11 states and 319 transitions. [2024-06-27 22:51:42,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 335 transitions, 5399 flow [2024-06-27 22:51:42,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 335 transitions, 5293 flow, removed 53 selfloop flow, removed 0 redundant places. [2024-06-27 22:51:42,575 INFO L231 Difference]: Finished difference. Result has 139 places, 211 transitions, 4092 flow [2024-06-27 22:51:42,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2901, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4092, PETRI_PLACES=139, PETRI_TRANSITIONS=211} [2024-06-27 22:51:42,576 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 88 predicate places. [2024-06-27 22:51:42,576 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 211 transitions, 4092 flow [2024-06-27 22:51:42,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.125) internal successors, (145), 8 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:42,576 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:42,576 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] [2024-06-27 22:51:42,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:51:42,576 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:42,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:42,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1350600809, now seen corresponding path program 2 times [2024-06-27 22:51:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:42,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900453992] [2024-06-27 22:51:42,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:43,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:43,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900453992] [2024-06-27 22:51:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900453992] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469292126] [2024-06-27 22:51:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:43,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:43,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:43,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:43,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:43,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:43,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 211 transitions, 4092 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:43,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:43,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:43,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:45,845 INFO L124 PetriNetUnfolderBase]: 10100/18624 cut-off events. [2024-06-27 22:51:45,846 INFO L125 PetriNetUnfolderBase]: For 154728/154781 co-relation queries the response was YES. [2024-06-27 22:51:45,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78130 conditions, 18624 events. 10100/18624 cut-off events. For 154728/154781 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 171893 event pairs, 3039 based on Foata normal form. 36/17862 useless extension candidates. Maximal degree in co-relation 78059. Up to 8457 conditions per place. [2024-06-27 22:51:46,006 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 142 selfloop transitions, 124 changer transitions 0/282 dead transitions. [2024-06-27 22:51:46,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 282 transitions, 5155 flow [2024-06-27 22:51:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:51:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:51:46,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 222 transitions. [2024-06-27 22:51:46,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6747720364741642 [2024-06-27 22:51:46,007 INFO L175 Difference]: Start difference. First operand has 139 places, 211 transitions, 4092 flow. Second operand 7 states and 222 transitions. [2024-06-27 22:51:46,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 282 transitions, 5155 flow [2024-06-27 22:51:46,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 282 transitions, 4976 flow, removed 68 selfloop flow, removed 3 redundant places. [2024-06-27 22:51:46,713 INFO L231 Difference]: Finished difference. Result has 143 places, 221 transitions, 4440 flow [2024-06-27 22:51:46,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3946, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4440, PETRI_PLACES=143, PETRI_TRANSITIONS=221} [2024-06-27 22:51:46,713 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 92 predicate places. [2024-06-27 22:51:46,713 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 221 transitions, 4440 flow [2024-06-27 22:51:46,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:46,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:46,714 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] [2024-06-27 22:51:46,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:51:46,714 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:46,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash -223517387, now seen corresponding path program 3 times [2024-06-27 22:51:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:46,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423819015] [2024-06-27 22:51:46,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:46,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:47,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423819015] [2024-06-27 22:51:47,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423819015] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:47,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:47,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:47,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312664959] [2024-06-27 22:51:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:47,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:47,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:47,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:47,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:47,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:47,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 221 transitions, 4440 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:47,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:47,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:47,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:50,158 INFO L124 PetriNetUnfolderBase]: 10202/18573 cut-off events. [2024-06-27 22:51:50,158 INFO L125 PetriNetUnfolderBase]: For 168116/168165 co-relation queries the response was YES. [2024-06-27 22:51:50,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78942 conditions, 18573 events. 10202/18573 cut-off events. For 168116/168165 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 170237 event pairs, 2538 based on Foata normal form. 36/17774 useless extension candidates. Maximal degree in co-relation 78871. Up to 6063 conditions per place. [2024-06-27 22:51:50,462 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 127 selfloop transitions, 122 changer transitions 0/265 dead transitions. [2024-06-27 22:51:50,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 265 transitions, 5179 flow [2024-06-27 22:51:50,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:51:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:51:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2024-06-27 22:51:50,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6524822695035462 [2024-06-27 22:51:50,465 INFO L175 Difference]: Start difference. First operand has 143 places, 221 transitions, 4440 flow. Second operand 6 states and 184 transitions. [2024-06-27 22:51:50,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 265 transitions, 5179 flow [2024-06-27 22:51:51,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 265 transitions, 4967 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-06-27 22:51:51,065 INFO L231 Difference]: Finished difference. Result has 145 places, 223 transitions, 4576 flow [2024-06-27 22:51:51,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4234, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4576, PETRI_PLACES=145, PETRI_TRANSITIONS=223} [2024-06-27 22:51:51,066 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 94 predicate places. [2024-06-27 22:51:51,066 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 223 transitions, 4576 flow [2024-06-27 22:51:51,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:51,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:51,066 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] [2024-06-27 22:51:51,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:51:51,066 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:51,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:51,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1002963442, now seen corresponding path program 1 times [2024-06-27 22:51:51,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:51,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405027459] [2024-06-27 22:51:51,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:51,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:51,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:51,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405027459] [2024-06-27 22:51:51,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405027459] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:51,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:51,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:51,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366077067] [2024-06-27 22:51:51,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:51,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:51,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:51,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 223 transitions, 4576 flow. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:51,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:51,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:51,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:54,544 INFO L124 PetriNetUnfolderBase]: 10226/18510 cut-off events. [2024-06-27 22:51:54,545 INFO L125 PetriNetUnfolderBase]: For 158724/158772 co-relation queries the response was YES. [2024-06-27 22:51:54,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79588 conditions, 18510 events. 10226/18510 cut-off events. For 158724/158772 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 169462 event pairs, 6400 based on Foata normal form. 9/17589 useless extension candidates. Maximal degree in co-relation 79516. Up to 12432 conditions per place. [2024-06-27 22:51:54,912 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 142 selfloop transitions, 91 changer transitions 0/249 dead transitions. [2024-06-27 22:51:54,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 249 transitions, 5176 flow [2024-06-27 22:51:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:51:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:51:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-06-27 22:51:54,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6170212765957447 [2024-06-27 22:51:54,913 INFO L175 Difference]: Start difference. First operand has 145 places, 223 transitions, 4576 flow. Second operand 5 states and 145 transitions. [2024-06-27 22:51:54,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 249 transitions, 5176 flow [2024-06-27 22:51:55,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 249 transitions, 5067 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:51:55,668 INFO L231 Difference]: Finished difference. Result has 147 places, 225 transitions, 4712 flow [2024-06-27 22:51:55,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4467, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4712, PETRI_PLACES=147, PETRI_TRANSITIONS=225} [2024-06-27 22:51:55,669 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 96 predicate places. [2024-06-27 22:51:55,669 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 225 transitions, 4712 flow [2024-06-27 22:51:55,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 7 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:55,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:55,669 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] [2024-06-27 22:51:55,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:51:55,669 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:55,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:55,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1653042024, now seen corresponding path program 1 times [2024-06-27 22:51:55,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:55,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618469518] [2024-06-27 22:51:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:55,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:51:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:51:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:51:56,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:51:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618469518] [2024-06-27 22:51:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618469518] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:51:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:51:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:51:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838153992] [2024-06-27 22:51:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:51:56,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:51:56,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:51:56,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:51:56,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:51:56,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 47 [2024-06-27 22:51:56,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 225 transitions, 4712 flow. Second operand has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:56,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:51:56,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 47 [2024-06-27 22:51:56,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:51:59,125 INFO L124 PetriNetUnfolderBase]: 10159/18490 cut-off events. [2024-06-27 22:51:59,125 INFO L125 PetriNetUnfolderBase]: For 169940/170003 co-relation queries the response was YES. [2024-06-27 22:51:59,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79629 conditions, 18490 events. 10159/18490 cut-off events. For 169940/170003 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 170352 event pairs, 4383 based on Foata normal form. 14/17613 useless extension candidates. Maximal degree in co-relation 79557. Up to 12687 conditions per place. [2024-06-27 22:51:59,318 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 174 selfloop transitions, 52 changer transitions 0/242 dead transitions. [2024-06-27 22:51:59,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 242 transitions, 5245 flow [2024-06-27 22:51:59,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:51:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:51:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2024-06-27 22:51:59,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.601063829787234 [2024-06-27 22:51:59,320 INFO L175 Difference]: Start difference. First operand has 147 places, 225 transitions, 4712 flow. Second operand 4 states and 113 transitions. [2024-06-27 22:51:59,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 242 transitions, 5245 flow [2024-06-27 22:51:59,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 242 transitions, 4867 flow, removed 42 selfloop flow, removed 7 redundant places. [2024-06-27 22:51:59,981 INFO L231 Difference]: Finished difference. Result has 142 places, 224 transitions, 4410 flow [2024-06-27 22:51:59,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=4306, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4410, PETRI_PLACES=142, PETRI_TRANSITIONS=224} [2024-06-27 22:51:59,981 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 91 predicate places. [2024-06-27 22:51:59,981 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 224 transitions, 4410 flow [2024-06-27 22:51:59,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:51:59,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:51:59,982 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] [2024-06-27 22:51:59,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:51:59,982 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:51:59,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:51:59,982 INFO L85 PathProgramCache]: Analyzing trace with hash 267004116, now seen corresponding path program 1 times [2024-06-27 22:51:59,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:51:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131384157] [2024-06-27 22:51:59,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:51:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:00,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:00,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131384157] [2024-06-27 22:52:00,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131384157] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:00,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:00,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:52:00,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294885497] [2024-06-27 22:52:00,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:00,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:52:00,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:52:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:52:00,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:52:00,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 224 transitions, 4410 flow. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:00,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:00,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:52:00,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:02,737 INFO L124 PetriNetUnfolderBase]: 11539/18743 cut-off events. [2024-06-27 22:52:02,737 INFO L125 PetriNetUnfolderBase]: For 159160/159170 co-relation queries the response was YES. [2024-06-27 22:52:02,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79109 conditions, 18743 events. 11539/18743 cut-off events. For 159160/159170 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 142144 event pairs, 939 based on Foata normal form. 982/19695 useless extension candidates. Maximal degree in co-relation 79041. Up to 7269 conditions per place. [2024-06-27 22:52:02,879 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 336 selfloop transitions, 8 changer transitions 1/355 dead transitions. [2024-06-27 22:52:02,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 355 transitions, 7112 flow [2024-06-27 22:52:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:52:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:52:02,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2024-06-27 22:52:02,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.625531914893617 [2024-06-27 22:52:02,881 INFO L175 Difference]: Start difference. First operand has 142 places, 224 transitions, 4410 flow. Second operand 5 states and 147 transitions. [2024-06-27 22:52:02,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 355 transitions, 7112 flow [2024-06-27 22:52:03,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 355 transitions, 6617 flow, removed 117 selfloop flow, removed 8 redundant places. [2024-06-27 22:52:03,126 INFO L231 Difference]: Finished difference. Result has 140 places, 193 transitions, 3310 flow [2024-06-27 22:52:03,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=3262, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3310, PETRI_PLACES=140, PETRI_TRANSITIONS=193} [2024-06-27 22:52:03,127 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 89 predicate places. [2024-06-27 22:52:03,127 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 193 transitions, 3310 flow [2024-06-27 22:52:03,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:03,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:03,127 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] [2024-06-27 22:52:03,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:52:03,127 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:03,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:03,128 INFO L85 PathProgramCache]: Analyzing trace with hash -195515279, now seen corresponding path program 1 times [2024-06-27 22:52:03,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:03,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715860775] [2024-06-27 22:52:03,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:03,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:03,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:03,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715860775] [2024-06-27 22:52:03,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715860775] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:03,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:03,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:52:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024926589] [2024-06-27 22:52:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:03,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:52:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:52:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:52:03,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:52:03,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 193 transitions, 3310 flow. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:03,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:03,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:52:03,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:04,944 INFO L124 PetriNetUnfolderBase]: 7178/11524 cut-off events. [2024-06-27 22:52:04,944 INFO L125 PetriNetUnfolderBase]: For 92814/92824 co-relation queries the response was YES. [2024-06-27 22:52:05,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53282 conditions, 11524 events. 7178/11524 cut-off events. For 92814/92824 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 79321 event pairs, 370 based on Foata normal form. 604/12098 useless extension candidates. Maximal degree in co-relation 53218. Up to 4512 conditions per place. [2024-06-27 22:52:05,048 INFO L140 encePairwiseOnDemand]: 41/47 looper letters, 265 selfloop transitions, 11 changer transitions 1/287 dead transitions. [2024-06-27 22:52:05,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 287 transitions, 5078 flow [2024-06-27 22:52:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:52:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:52:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-06-27 22:52:05,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5602836879432624 [2024-06-27 22:52:05,049 INFO L175 Difference]: Start difference. First operand has 140 places, 193 transitions, 3310 flow. Second operand 6 states and 158 transitions. [2024-06-27 22:52:05,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 287 transitions, 5078 flow [2024-06-27 22:52:05,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 287 transitions, 4494 flow, removed 87 selfloop flow, removed 15 redundant places. [2024-06-27 22:52:05,248 INFO L231 Difference]: Finished difference. Result has 132 places, 150 transitions, 2079 flow [2024-06-27 22:52:05,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2043, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2079, PETRI_PLACES=132, PETRI_TRANSITIONS=150} [2024-06-27 22:52:05,249 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 81 predicate places. [2024-06-27 22:52:05,249 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 150 transitions, 2079 flow [2024-06-27 22:52:05,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:05,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:05,249 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] [2024-06-27 22:52:05,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:52:05,249 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:05,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash -401156208, now seen corresponding path program 1 times [2024-06-27 22:52:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:05,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001648714] [2024-06-27 22:52:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:05,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001648714] [2024-06-27 22:52:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001648714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:05,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:52:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782838656] [2024-06-27 22:52:05,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:05,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:52:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:05,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:52:05,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:52:05,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 47 [2024-06-27 22:52:05,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 150 transitions, 2079 flow. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:05,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:05,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 47 [2024-06-27 22:52:05,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:06,648 INFO L124 PetriNetUnfolderBase]: 6270/11221 cut-off events. [2024-06-27 22:52:06,648 INFO L125 PetriNetUnfolderBase]: For 62609/62878 co-relation queries the response was YES. [2024-06-27 22:52:06,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46282 conditions, 11221 events. 6270/11221 cut-off events. For 62609/62878 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 90490 event pairs, 2367 based on Foata normal form. 72/10865 useless extension candidates. Maximal degree in co-relation 46227. Up to 4986 conditions per place. [2024-06-27 22:52:06,726 INFO L140 encePairwiseOnDemand]: 42/47 looper letters, 113 selfloop transitions, 2 changer transitions 100/231 dead transitions. [2024-06-27 22:52:06,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 231 transitions, 3643 flow [2024-06-27 22:52:06,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:52:06,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:52:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 120 transitions. [2024-06-27 22:52:06,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5106382978723404 [2024-06-27 22:52:06,727 INFO L175 Difference]: Start difference. First operand has 132 places, 150 transitions, 2079 flow. Second operand 5 states and 120 transitions. [2024-06-27 22:52:06,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 231 transitions, 3643 flow [2024-06-27 22:52:06,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 231 transitions, 3568 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-06-27 22:52:06,967 INFO L231 Difference]: Finished difference. Result has 131 places, 110 transitions, 1379 flow [2024-06-27 22:52:06,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=2019, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1379, PETRI_PLACES=131, PETRI_TRANSITIONS=110} [2024-06-27 22:52:06,968 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 80 predicate places. [2024-06-27 22:52:06,968 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 110 transitions, 1379 flow [2024-06-27 22:52:06,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:06,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:06,968 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] [2024-06-27 22:52:06,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:52:06,969 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:06,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1857099980, now seen corresponding path program 2 times [2024-06-27 22:52:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:06,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530044804] [2024-06-27 22:52:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:06,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:52:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:52:08,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:52:08,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530044804] [2024-06-27 22:52:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530044804] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:52:08,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:52:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:52:08,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226692817] [2024-06-27 22:52:08,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:52:08,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:52:08,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:52:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:52:08,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:52:08,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 47 [2024-06-27 22:52:08,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 110 transitions, 1379 flow. Second operand has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:08,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:52:08,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 47 [2024-06-27 22:52:08,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:52:08,705 INFO L124 PetriNetUnfolderBase]: 1668/3085 cut-off events. [2024-06-27 22:52:08,705 INFO L125 PetriNetUnfolderBase]: For 15898/16266 co-relation queries the response was YES. [2024-06-27 22:52:08,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11452 conditions, 3085 events. 1668/3085 cut-off events. For 15898/16266 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20123 event pairs, 683 based on Foata normal form. 20/2900 useless extension candidates. Maximal degree in co-relation 11418. Up to 1806 conditions per place. [2024-06-27 22:52:08,723 INFO L140 encePairwiseOnDemand]: 40/47 looper letters, 41 selfloop transitions, 8 changer transitions 67/133 dead transitions. [2024-06-27 22:52:08,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 133 transitions, 1688 flow [2024-06-27 22:52:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:52:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:52:08,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-06-27 22:52:08,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47074468085106386 [2024-06-27 22:52:08,724 INFO L175 Difference]: Start difference. First operand has 131 places, 110 transitions, 1379 flow. Second operand 8 states and 177 transitions. [2024-06-27 22:52:08,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 133 transitions, 1688 flow [2024-06-27 22:52:08,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 133 transitions, 1472 flow, removed 17 selfloop flow, removed 19 redundant places. [2024-06-27 22:52:08,742 INFO L231 Difference]: Finished difference. Result has 118 places, 62 transitions, 484 flow [2024-06-27 22:52:08,742 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=47, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=484, PETRI_PLACES=118, PETRI_TRANSITIONS=62} [2024-06-27 22:52:08,742 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 67 predicate places. [2024-06-27 22:52:08,742 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 62 transitions, 484 flow [2024-06-27 22:52:08,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:52:08,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:52:08,743 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] [2024-06-27 22:52:08,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:52:08,743 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:52:08,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:52:08,743 INFO L85 PathProgramCache]: Analyzing trace with hash 436494738, now seen corresponding path program 3 times [2024-06-27 22:52:08,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:52:08,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378184749] [2024-06-27 22:52:08,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:52:08,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:52:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:52:08,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:52:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:52:08,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:52:08,877 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:52:08,877 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 22:52:08,879 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-06-27 22:52:08,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-06-27 22:52:08,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-06-27 22:52:08,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-06-27 22:52:08,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-06-27 22:52:08,880 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-06-27 22:52:08,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:52:08,881 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:52:08,884 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:52:08,885 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:52:08,942 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:52:08,943 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:52:08,947 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:52:08,947 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:52:08,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:52:08,949 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:52:08,961 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-27 22:52:08,990 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-06-27 22:52:08,990 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-06-27 22:52:08,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:52:08 BasicIcfg [2024-06-27 22:52:08,991 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:52:08,991 INFO L158 Benchmark]: Toolchain (without parser) took 46699.33ms. Allocated memory was 127.9MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 53.4MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-06-27 22:52:08,991 INFO L158 Benchmark]: Witness Parser took 0.45ms. Allocated memory is still 127.9MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:52:08,991 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:52:08,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.98ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 53.2MB in the beginning and 113.7MB in the end (delta: -60.6MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-06-27 22:52:08,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.60ms. Allocated memory is still 169.9MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:52:08,992 INFO L158 Benchmark]: Boogie Preprocessor took 71.55ms. Allocated memory is still 169.9MB. Free memory was 111.6MB in the beginning and 107.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:52:08,992 INFO L158 Benchmark]: RCFGBuilder took 783.43ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 106.1MB in the end (delta: 1.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-06-27 22:52:08,992 INFO L158 Benchmark]: TraceAbstraction took 45251.01ms. Allocated memory was 169.9MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 106.1MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2024-06-27 22:52:08,993 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.45ms. Allocated memory is still 127.9MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.98ms. Allocated memory was 127.9MB in the beginning and 169.9MB in the end (delta: 41.9MB). Free memory was 53.2MB in the beginning and 113.7MB in the end (delta: -60.6MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.60ms. Allocated memory is still 169.9MB. Free memory was 113.7MB in the beginning and 111.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.55ms. Allocated memory is still 169.9MB. Free memory was 111.6MB in the beginning and 107.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 783.43ms. Allocated memory is still 169.9MB. Free memory was 107.5MB in the beginning and 106.1MB in the end (delta: 1.4MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. * TraceAbstraction took 45251.01ms. Allocated memory was 169.9MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 106.1MB in the beginning and 7.9GB in the end (delta: -7.8GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2269; [L850] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L850] FCALL, FORK 0 pthread_create(&t2269, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L851] 0 pthread_t t2270; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 //@ assert (!multithreaded || (((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL))); [L852] 0 x [L852] 0 x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] FCALL, FORK 0 pthread_create(&t2270, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, t2270=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L852] 0 x [L852] 0 x [L853] 0 pthread_t t2271; VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, t2270=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 //@ assert (!multithreaded || (((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL))); [L854] 0 x [L854] 0 x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, t2270=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] FCALL, FORK 0 pthread_create(&t2271, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 x [L854] 0 x [L855] 0 //@ assert (!multithreaded || (((((0LL - (long long) __unbuffered_p0_EAX) + (long long) x) >= 0LL) && (((0LL - (long long) __unbuffered_p0_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((long long) x - (long long) x$mem_tmp) >= 0LL))); [L855] 0 x [L855] 0 x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L824] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L759] 1 y = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L789] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L855] 0 x [L855] 0 x [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2269=-3, t2270=-2, t2271=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 852]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 71 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 45.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 36.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1458 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1446 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3546 IncrementalHoareTripleChecker+Invalid, 3807 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 7 mSDtfsCounter, 3546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4712occurred in iteration=19, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 445 ConstructedInterpolants, 0 QuantifiedInterpolants, 5708 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:52:09,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE