./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe031_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe031_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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/safe031_tso.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe031_tso.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-wip.fs.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:04:49,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:04:49,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:04:49,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:04:49,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:04:49,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:04:49,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:04:49,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:04:49,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:04:49,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:04:49,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:04:49,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:04:49,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:04:49,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:04:49,793 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:04:49,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:04:49,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:04:49,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:04:49,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:04:49,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:04:49,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:04:49,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:04:49,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:04:49,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:04:49,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:04:49,798 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:04:49,798 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:04:49,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:04:49,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:04:49,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:04:49,799 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:04:49,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:04:49,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:04:49,800 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:04:49,800 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:04:49,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:04:49,801 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:04:49,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:04:49,801 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:04:49,801 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:04:49,801 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:04:49,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:04:49,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:04:49,802 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-02-07 19:04:50,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:04:50,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:04:50,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:04:50,081 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:04:50,081 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:04:50,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/safe031_tso.yml/witness.yml [2024-02-07 19:04:50,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:04:50,151 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:04:50,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_tso.i [2024-02-07 19:04:51,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:04:51,447 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:04:51,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_tso.i [2024-02-07 19:04:51,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a99879b/52f1c6a4946f43179b2aa8900016fa20/FLAGb427d4b33 [2024-02-07 19:04:51,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8a99879b/52f1c6a4946f43179b2aa8900016fa20 [2024-02-07 19:04:51,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:04:51,476 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:04:51,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:51,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:04:51,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:04:51,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:50" (1/2) ... [2024-02-07 19:04:51,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ad82d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:51, skipping insertion in model container [2024-02-07 19:04:51,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:50" (1/2) ... [2024-02-07 19:04:51,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@657905fb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:04:51, skipping insertion in model container [2024-02-07 19:04:51,486 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:51" (2/2) ... [2024-02-07 19:04:51,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76ad82d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:51, skipping insertion in model container [2024-02-07 19:04:51,487 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:04:51" (2/2) ... [2024-02-07 19:04:51,487 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:04:51,554 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:04:51,555 INFO L76 edCorrectnessWitness]: Location invariant before [L764-L764] 1 <= __unbuffered_cnt [2024-02-07 19:04:51,555 INFO L76 edCorrectnessWitness]: Location invariant before [L759-L759] z == 1 [2024-02-07 19:04:51,555 INFO L76 edCorrectnessWitness]: Location invariant before [L729-L729] ((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) [2024-02-07 19:04:51,556 INFO L76 edCorrectnessWitness]: Location invariant before [L756-L756] y == 2 [2024-02-07 19:04:51,556 INFO L76 edCorrectnessWitness]: Location invariant before [L791-L791] ((((0 <= __unbuffered_p0_EAX) && (__unbuffered_p0_EAX <= 1)) && (y == 2)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (z == 2 || (((0 <= z && z <= 2) && z <= 127) && ((z == 0 || z == 1) || z == 2))) [2024-02-07 19:04:51,556 INFO L76 edCorrectnessWitness]: Location invariant before [L734-L734] 1 <= __unbuffered_cnt [2024-02-07 19:04:51,556 INFO L76 edCorrectnessWitness]: Location invariant before [L785-L785] 0 <= __unbuffered_cnt [2024-02-07 19:04:51,556 INFO L76 edCorrectnessWitness]: Location invariant before [L792-L792] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:51,556 INFO L76 edCorrectnessWitness]: Location invariant before [L733-L733] 0 <= __unbuffered_cnt [2024-02-07 19:04:51,556 INFO L76 edCorrectnessWitness]: Location invariant before [L787-L787] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:51,557 INFO L76 edCorrectnessWitness]: Location invariant before [L744-L744] y == 1 [2024-02-07 19:04:51,557 INFO L76 edCorrectnessWitness]: Location invariant before [L741-L741] x == 1 [2024-02-07 19:04:51,557 INFO L76 edCorrectnessWitness]: Location invariant before [L763-L763] 0 <= __unbuffered_cnt [2024-02-07 19:04:51,557 INFO L76 edCorrectnessWitness]: Location invariant before [L724-L724] z == 2 [2024-02-07 19:04:51,557 INFO L76 edCorrectnessWitness]: Location invariant before [L793-L793] main$tmp_guard1 == (_Bool)0 || main$tmp_guard1 == (_Bool)1 [2024-02-07 19:04:51,557 INFO L76 edCorrectnessWitness]: Location invariant before [L786-L786] main$tmp_guard0 == (_Bool)0 || main$tmp_guard0 == (_Bool)1 [2024-02-07 19:04:51,557 INFO L76 edCorrectnessWitness]: Location invariant before [L748-L748] 0 <= __unbuffered_cnt [2024-02-07 19:04:51,558 INFO L76 edCorrectnessWitness]: Location invariant before [L728-L728] ((0 <= x) && (x <= 1)) && (x == 0 || x == 1) [2024-02-07 19:04:51,558 INFO L76 edCorrectnessWitness]: Location invariant before [L749-L749] 1 <= __unbuffered_cnt [2024-02-07 19:04:51,558 INFO L76 edCorrectnessWitness]: Location invariant before [L18-L18] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-07 19:04:51,597 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:04:51,775 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_tso.i[945,958] [2024-02-07 19:04:51,928 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:51,936 INFO L206 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-07 19:04:51,968 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_tso.i[945,958] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:04:52,009 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:04:52,039 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:04:52,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52 WrapperNode [2024-02-07 19:04:52,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:04:52,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:52,041 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:04:52,041 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:04:52,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,061 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,079 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-02-07 19:04:52,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:04:52,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:04:52,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:04:52,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:04:52,090 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,123 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-02-07 19:04:52,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:04:52,139 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:04:52,139 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:04:52,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:04:52,140 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (1/1) ... [2024-02-07 19:04:52,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:04:52,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:04:52,188 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-02-07 19:04:52,202 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-02-07 19:04:52,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:04:52,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:04:52,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:04:52,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:04:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-07 19:04:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:04:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:04:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:04:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-02-07 19:04:52,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-02-07 19:04:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-02-07 19:04:52,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-02-07 19:04:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-02-07 19:04:52,258 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-02-07 19:04:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:04:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:04:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:04:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:04:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-07 19:04:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:04:52,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:04:52,260 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:04:52,408 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:04:52,410 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:04:52,633 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:04:52,634 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:04:52,742 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:04:52,744 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-07 19:04:52,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:52 BoogieIcfgContainer [2024-02-07 19:04:52,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:04:52,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:04:52,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:04:52,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:04:52,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:04:50" (1/4) ... [2024-02-07 19:04:52,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142ed139 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:04:52, skipping insertion in model container [2024-02-07 19:04:52,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:04:51" (2/4) ... [2024-02-07 19:04:52,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142ed139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:04:52, skipping insertion in model container [2024-02-07 19:04:52,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:04:52" (3/4) ... [2024-02-07 19:04:52,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142ed139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:04:52, skipping insertion in model container [2024-02-07 19:04:52,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:04:52" (4/4) ... [2024-02-07 19:04:52,752 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_tso.i [2024-02-07 19:04:52,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:04:52,766 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-02-07 19:04:52,766 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:04:52,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-07 19:04:52,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 60 transitions, 132 flow [2024-02-07 19:04:52,875 INFO L124 PetriNetUnfolderBase]: 1/57 cut-off events. [2024-02-07 19:04:52,875 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:52,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 57 events. 1/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 175 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 59. Up to 2 conditions per place. [2024-02-07 19:04:52,882 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 60 transitions, 132 flow [2024-02-07 19:04:52,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 57 transitions, 123 flow [2024-02-07 19:04:52,895 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:04:52,900 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;@51c1ba6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:04:52,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-02-07 19:04:52,903 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:04:52,903 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-02-07 19:04:52,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:52,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:52,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-02-07 19:04:52,904 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:52,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash 9269829, now seen corresponding path program 1 times [2024-02-07 19:04:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:52,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040975892] [2024-02-07 19:04:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:53,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:53,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040975892] [2024-02-07 19:04:53,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040975892] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:53,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:53,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:53,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583201913] [2024-02-07 19:04:53,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:53,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-02-07 19:04:53,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:53,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-02-07 19:04:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-02-07 19:04:53,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 19:04:53,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 123 flow. Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:53,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:53,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 19:04:53,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:54,074 INFO L124 PetriNetUnfolderBase]: 5627/9791 cut-off events. [2024-02-07 19:04:54,074 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-02-07 19:04:54,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 9791 events. 5627/9791 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 76306 event pairs, 5627 based on Foata normal form. 252/7481 useless extension candidates. Maximal degree in co-relation 17879. Up to 7995 conditions per place. [2024-02-07 19:04:54,146 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 30 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-02-07 19:04:54,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 159 flow [2024-02-07 19:04:54,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-02-07 19:04:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-02-07 19:04:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2024-02-07 19:04:54,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-02-07 19:04:54,157 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 123 flow. Second operand 2 states and 78 transitions. [2024-02-07 19:04:54,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 159 flow [2024-02-07 19:04:54,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:04:54,165 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 96 flow [2024-02-07 19:04:54,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2024-02-07 19:04:54,170 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -13 predicate places. [2024-02-07 19:04:54,170 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 96 flow [2024-02-07 19:04:54,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:54,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:54,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-02-07 19:04:54,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:04:54,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:54,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 318381767, now seen corresponding path program 1 times [2024-02-07 19:04:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540363387] [2024-02-07 19:04:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:54,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:54,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:54,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540363387] [2024-02-07 19:04:54,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540363387] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:54,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:54,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:54,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695933267] [2024-02-07 19:04:54,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:54,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:54,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:54,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 19:04:54,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:54,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:54,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 19:04:54,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:54,850 INFO L124 PetriNetUnfolderBase]: 5474/8392 cut-off events. [2024-02-07 19:04:54,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-07 19:04:54,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16274 conditions, 8392 events. 5474/8392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 56125 event pairs, 923 based on Foata normal form. 0/6427 useless extension candidates. Maximal degree in co-relation 16271. Up to 6910 conditions per place. [2024-02-07 19:04:54,896 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 48 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-02-07 19:04:54,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 238 flow [2024-02-07 19:04:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2024-02-07 19:04:54,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-07 19:04:54,900 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 96 flow. Second operand 3 states and 105 transitions. [2024-02-07 19:04:54,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 238 flow [2024-02-07 19:04:54,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 65 transitions, 238 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-02-07 19:04:54,903 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 104 flow [2024-02-07 19:04:54,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2024-02-07 19:04:54,904 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-02-07 19:04:54,904 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 104 flow [2024-02-07 19:04:54,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:54,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:54,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:54,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:04:54,905 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:54,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:54,906 INFO L85 PathProgramCache]: Analyzing trace with hash -263781350, now seen corresponding path program 1 times [2024-02-07 19:04:54,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:54,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418285549] [2024-02-07 19:04:54,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:54,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:54,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418285549] [2024-02-07 19:04:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418285549] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:04:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757111496] [2024-02-07 19:04:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:54,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:54,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:54,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:54,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:55,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 19:04:55,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:55,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:55,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 19:04:55,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:55,410 INFO L124 PetriNetUnfolderBase]: 4223/6406 cut-off events. [2024-02-07 19:04:55,410 INFO L125 PetriNetUnfolderBase]: For 479/479 co-relation queries the response was YES. [2024-02-07 19:04:55,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13326 conditions, 6406 events. 4223/6406 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 38804 event pairs, 1395 based on Foata normal form. 0/5351 useless extension candidates. Maximal degree in co-relation 13321. Up to 5264 conditions per place. [2024-02-07 19:04:55,439 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 47 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-02-07 19:04:55,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 66 transitions, 257 flow [2024-02-07 19:04:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2024-02-07 19:04:55,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2024-02-07 19:04:55,444 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 104 flow. Second operand 3 states and 109 transitions. [2024-02-07 19:04:55,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 66 transitions, 257 flow [2024-02-07 19:04:55,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 66 transitions, 251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:55,447 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 132 flow [2024-02-07 19:04:55,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-02-07 19:04:55,449 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2024-02-07 19:04:55,449 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 132 flow [2024-02-07 19:04:55,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:55,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:55,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:55,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:04:55,451 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:55,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:55,452 INFO L85 PathProgramCache]: Analyzing trace with hash 412713097, now seen corresponding path program 1 times [2024-02-07 19:04:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338384760] [2024-02-07 19:04:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:55,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:55,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338384760] [2024-02-07 19:04:55,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338384760] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:55,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:55,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:55,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251195097] [2024-02-07 19:04:55,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:55,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:55,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:55,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:55,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:55,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:04:55,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:55,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:55,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:04:55,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:55,933 INFO L124 PetriNetUnfolderBase]: 4223/7246 cut-off events. [2024-02-07 19:04:55,933 INFO L125 PetriNetUnfolderBase]: For 1021/1021 co-relation queries the response was YES. [2024-02-07 19:04:55,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15787 conditions, 7246 events. 4223/7246 cut-off events. For 1021/1021 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 53128 event pairs, 3949 based on Foata normal form. 0/6008 useless extension candidates. Maximal degree in co-relation 15781. Up to 6094 conditions per place. [2024-02-07 19:04:55,976 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 32 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2024-02-07 19:04:55,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 196 flow [2024-02-07 19:04:55,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-02-07 19:04:55,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2024-02-07 19:04:55,978 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 132 flow. Second operand 3 states and 82 transitions. [2024-02-07 19:04:55,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 196 flow [2024-02-07 19:04:55,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:55,979 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 128 flow [2024-02-07 19:04:55,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-02-07 19:04:55,981 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -9 predicate places. [2024-02-07 19:04:55,981 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 128 flow [2024-02-07 19:04:55,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:55,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:55,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:55,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-07 19:04:55,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:55,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:55,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1719009564, now seen corresponding path program 1 times [2024-02-07 19:04:55,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:55,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695893264] [2024-02-07 19:04:55,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:55,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:56,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:56,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695893264] [2024-02-07 19:04:56,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695893264] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:56,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:56,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:56,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951543468] [2024-02-07 19:04:56,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:56,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:56,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:56,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:56,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:56,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 19:04:56,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:56,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:56,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 19:04:56,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:56,392 INFO L124 PetriNetUnfolderBase]: 3702/5741 cut-off events. [2024-02-07 19:04:56,392 INFO L125 PetriNetUnfolderBase]: For 763/763 co-relation queries the response was YES. [2024-02-07 19:04:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12914 conditions, 5741 events. 3702/5741 cut-off events. For 763/763 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 35468 event pairs, 846 based on Foata normal form. 218/5157 useless extension candidates. Maximal degree in co-relation 12908. Up to 4698 conditions per place. [2024-02-07 19:04:56,426 INFO L140 encePairwiseOnDemand]: 58/60 looper letters, 53 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2024-02-07 19:04:56,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 292 flow [2024-02-07 19:04:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2024-02-07 19:04:56,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-02-07 19:04:56,427 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 128 flow. Second operand 3 states and 104 transitions. [2024-02-07 19:04:56,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 292 flow [2024-02-07 19:04:56,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 289 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:56,429 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 123 flow [2024-02-07 19:04:56,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-02-07 19:04:56,429 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-02-07 19:04:56,430 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 123 flow [2024-02-07 19:04:56,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:56,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:56,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:56,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:04:56,430 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:56,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:56,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1480305490, now seen corresponding path program 1 times [2024-02-07 19:04:56,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:56,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200274448] [2024-02-07 19:04:56,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:56,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:56,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200274448] [2024-02-07 19:04:56,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200274448] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:56,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:04:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244933763] [2024-02-07 19:04:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:56,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:04:56,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:56,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:04:56,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:04:56,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:04:56,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:56,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:56,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:04:56,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:56,968 INFO L124 PetriNetUnfolderBase]: 3493/6284 cut-off events. [2024-02-07 19:04:56,969 INFO L125 PetriNetUnfolderBase]: For 827/827 co-relation queries the response was YES. [2024-02-07 19:04:56,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13224 conditions, 6284 events. 3493/6284 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 46518 event pairs, 597 based on Foata normal form. 179/5387 useless extension candidates. Maximal degree in co-relation 13219. Up to 3001 conditions per place. [2024-02-07 19:04:57,006 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 54 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2024-02-07 19:04:57,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 315 flow [2024-02-07 19:04:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:04:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:04:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2024-02-07 19:04:57,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375 [2024-02-07 19:04:57,008 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 123 flow. Second operand 4 states and 129 transitions. [2024-02-07 19:04:57,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 315 flow [2024-02-07 19:04:57,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:04:57,011 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 148 flow [2024-02-07 19:04:57,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-02-07 19:04:57,014 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -6 predicate places. [2024-02-07 19:04:57,014 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 148 flow [2024-02-07 19:04:57,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:57,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:57,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:57,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:04:57,015 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:57,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -241064504, now seen corresponding path program 1 times [2024-02-07 19:04:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:57,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190675744] [2024-02-07 19:04:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:57,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:57,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:57,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190675744] [2024-02-07 19:04:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190675744] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:57,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:57,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:04:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24017682] [2024-02-07 19:04:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:57,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:04:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:57,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:04:57,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:04:57,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 60 [2024-02-07 19:04:57,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:57,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:57,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 60 [2024-02-07 19:04:57,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:57,344 INFO L124 PetriNetUnfolderBase]: 2080/3783 cut-off events. [2024-02-07 19:04:57,344 INFO L125 PetriNetUnfolderBase]: For 1165/1177 co-relation queries the response was YES. [2024-02-07 19:04:57,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8284 conditions, 3783 events. 2080/3783 cut-off events. For 1165/1177 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 25457 event pairs, 864 based on Foata normal form. 98/3575 useless extension candidates. Maximal degree in co-relation 8277. Up to 2834 conditions per place. [2024-02-07 19:04:57,355 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 35 selfloop transitions, 3 changer transitions 2/54 dead transitions. [2024-02-07 19:04:57,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 239 flow [2024-02-07 19:04:57,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:04:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:04:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-02-07 19:04:57,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444444444444444 [2024-02-07 19:04:57,357 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 148 flow. Second operand 3 states and 98 transitions. [2024-02-07 19:04:57,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 239 flow [2024-02-07 19:04:57,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:04:57,359 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 126 flow [2024-02-07 19:04:57,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2024-02-07 19:04:57,360 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -10 predicate places. [2024-02-07 19:04:57,360 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 126 flow [2024-02-07 19:04:57,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:57,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:57,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:57,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-07 19:04:57,361 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:57,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:57,361 INFO L85 PathProgramCache]: Analyzing trace with hash -366968092, now seen corresponding path program 1 times [2024-02-07 19:04:57,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039998762] [2024-02-07 19:04:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:57,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:57,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:57,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039998762] [2024-02-07 19:04:57,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039998762] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:57,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:57,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:04:57,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058313714] [2024-02-07 19:04:57,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:57,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:04:57,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:57,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:04:57,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:04:57,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:04:57,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:57,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:57,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:04:57,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:57,648 INFO L124 PetriNetUnfolderBase]: 1159/2144 cut-off events. [2024-02-07 19:04:57,649 INFO L125 PetriNetUnfolderBase]: For 765/765 co-relation queries the response was YES. [2024-02-07 19:04:57,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4769 conditions, 2144 events. 1159/2144 cut-off events. For 765/765 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 12527 event pairs, 149 based on Foata normal form. 98/2104 useless extension candidates. Maximal degree in co-relation 4762. Up to 641 conditions per place. [2024-02-07 19:04:57,657 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 57 selfloop transitions, 8 changer transitions 1/80 dead transitions. [2024-02-07 19:04:57,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 359 flow [2024-02-07 19:04:57,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:04:57,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:04:57,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-02-07 19:04:57,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2024-02-07 19:04:57,659 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 126 flow. Second operand 5 states and 153 transitions. [2024-02-07 19:04:57,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 359 flow [2024-02-07 19:04:57,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 80 transitions, 343 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-02-07 19:04:57,662 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 159 flow [2024-02-07 19:04:57,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2024-02-07 19:04:57,663 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -8 predicate places. [2024-02-07 19:04:57,663 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 159 flow [2024-02-07 19:04:57,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:57,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:57,663 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-02-07 19:04:57,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:04:57,664 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:57,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash -959831412, now seen corresponding path program 1 times [2024-02-07 19:04:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:57,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804194526] [2024-02-07 19:04:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:57,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:04:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:04:57,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:04:57,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804194526] [2024-02-07 19:04:57,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804194526] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:04:57,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:04:57,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-07 19:04:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360175376] [2024-02-07 19:04:57,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:04:57,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-07 19:04:57,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:04:57,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-07 19:04:57,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-02-07 19:04:57,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 60 [2024-02-07 19:04:57,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:57,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:04:57,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 60 [2024-02-07 19:04:57,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:04:57,898 INFO L124 PetriNetUnfolderBase]: 700/1199 cut-off events. [2024-02-07 19:04:57,899 INFO L125 PetriNetUnfolderBase]: For 872/872 co-relation queries the response was YES. [2024-02-07 19:04:57,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1199 events. 700/1199 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 5497 event pairs, 128 based on Foata normal form. 44/1213 useless extension candidates. Maximal degree in co-relation 3111. Up to 378 conditions per place. [2024-02-07 19:04:57,903 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 49 selfloop transitions, 11 changer transitions 1/75 dead transitions. [2024-02-07 19:04:57,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 355 flow [2024-02-07 19:04:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-07 19:04:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-07 19:04:57,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 165 transitions. [2024-02-07 19:04:57,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2024-02-07 19:04:57,905 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 159 flow. Second operand 6 states and 165 transitions. [2024-02-07 19:04:57,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 355 flow [2024-02-07 19:04:57,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 330 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-02-07 19:04:57,910 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 173 flow [2024-02-07 19:04:57,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2024-02-07 19:04:57,910 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, -5 predicate places. [2024-02-07 19:04:57,910 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 173 flow [2024-02-07 19:04:57,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:04:57,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:04:57,911 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] [2024-02-07 19:04:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-07 19:04:57,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 34 more)] === [2024-02-07 19:04:57,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:04:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -488577604, now seen corresponding path program 1 times [2024-02-07 19:04:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:04:57,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879132535] [2024-02-07 19:04:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:04:57,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:04:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:57,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:04:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:04:57,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:04:57,949 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:04:57,950 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (36 of 37 remaining) [2024-02-07 19:04:57,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 37 remaining) [2024-02-07 19:04:57,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 37 remaining) [2024-02-07 19:04:57,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 37 remaining) [2024-02-07 19:04:57,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 37 remaining) [2024-02-07 19:04:57,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 37 remaining) [2024-02-07 19:04:57,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 37 remaining) [2024-02-07 19:04:57,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 37 remaining) [2024-02-07 19:04:57,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 37 remaining) [2024-02-07 19:04:57,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 37 remaining) [2024-02-07 19:04:57,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 37 remaining) [2024-02-07 19:04:57,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 37 remaining) [2024-02-07 19:04:57,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 37 remaining) [2024-02-07 19:04:57,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 37 remaining) [2024-02-07 19:04:57,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 37 remaining) [2024-02-07 19:04:57,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 37 remaining) [2024-02-07 19:04:57,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 37 remaining) [2024-02-07 19:04:57,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 37 remaining) [2024-02-07 19:04:57,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 37 remaining) [2024-02-07 19:04:57,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 37 remaining) [2024-02-07 19:04:57,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (16 of 37 remaining) [2024-02-07 19:04:57,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 37 remaining) [2024-02-07 19:04:57,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 37 remaining) [2024-02-07 19:04:57,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 37 remaining) [2024-02-07 19:04:57,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 37 remaining) [2024-02-07 19:04:57,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 37 remaining) [2024-02-07 19:04:57,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 37 remaining) [2024-02-07 19:04:57,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 37 remaining) [2024-02-07 19:04:57,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 37 remaining) [2024-02-07 19:04:57,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 37 remaining) [2024-02-07 19:04:57,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 37 remaining) [2024-02-07 19:04:57,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 37 remaining) [2024-02-07 19:04:57,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 37 remaining) [2024-02-07 19:04:57,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 37 remaining) [2024-02-07 19:04:57,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 37 remaining) [2024-02-07 19:04:57,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 37 remaining) [2024-02-07 19:04:57,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 37 remaining) [2024-02-07 19:04:57,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-07 19:04:57,958 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:04:57,963 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:04:57,963 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:04:57,989 INFO L503 ceAbstractionStarter]: Automizer considered 20 witness invariants [2024-02-07 19:04:57,989 INFO L504 ceAbstractionStarter]: WitnessConsidered=20 [2024-02-07 19:04:57,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:04:57 BasicIcfg [2024-02-07 19:04:57,990 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:04:57,990 INFO L158 Benchmark]: Toolchain (without parser) took 6514.40ms. Allocated memory was 148.9MB in the beginning and 880.8MB in the end (delta: 731.9MB). Free memory was 113.0MB in the beginning and 528.9MB in the end (delta: -415.9MB). Peak memory consumption was 316.9MB. Max. memory is 16.1GB. [2024-02-07 19:04:57,990 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 76.6MB in the beginning and 76.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:57,990 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:04:57,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.72ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 84.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-02-07 19:04:57,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.36ms. Allocated memory is still 148.9MB. Free memory was 84.7MB in the beginning and 82.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:57,991 INFO L158 Benchmark]: Boogie Preprocessor took 57.37ms. Allocated memory is still 148.9MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:04:57,991 INFO L158 Benchmark]: RCFGBuilder took 605.47ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 89.9MB in the end (delta: -10.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-02-07 19:04:57,992 INFO L158 Benchmark]: TraceAbstraction took 5243.76ms. Allocated memory was 148.9MB in the beginning and 880.8MB in the end (delta: 731.9MB). Free memory was 88.9MB in the beginning and 528.9MB in the end (delta: -440.0MB). Peak memory consumption was 294.9MB. Max. memory is 16.1GB. [2024-02-07 19:04:57,996 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 76.6MB in the beginning and 76.4MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.72ms. Allocated memory is still 148.9MB. Free memory was 113.0MB in the beginning and 84.7MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.36ms. Allocated memory is still 148.9MB. Free memory was 84.7MB in the beginning and 82.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.37ms. Allocated memory is still 148.9MB. Free memory was 81.6MB in the beginning and 79.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 605.47ms. Allocated memory is still 148.9MB. Free memory was 79.5MB in the beginning and 89.9MB in the end (delta: -10.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5243.76ms. Allocated memory was 148.9MB in the beginning and 880.8MB in the end (delta: 731.9MB). Free memory was 88.9MB in the beginning and 528.9MB in the end (delta: -440.0MB). Peak memory consumption was 294.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 791]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L778] 0 pthread_t t2531; [L779] FCALL, FORK 0 pthread_create(&t2531, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2531={5:0}, x=0, y=0, z=0] [L723] 1 z = 2 [L724] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=2] [L728] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[x]],BinaryExpression[COMPLEQ,IdentifierExpression[x],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]]]] [L728] 1 __unbuffered_p0_EAX = x [L729] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=2] [L780] 0 pthread_t t2532; [L781] FCALL, FORK 0 pthread_create(&t2532, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2531={5:0}, t2532={6:0}, x=0, y=0, z=2] [L740] 2 x = 1 [L741] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[x],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=0, z=2] [L782] 0 pthread_t t2533; [L783] FCALL, FORK 0 pthread_create(&t2533, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2531={5:0}, t2532={6:0}, t2533={3:0}, x=1, y=0, z=2] [L755] 3 y = 2 [L756] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=2, z=2] [L743] 2 y = 1 [L744] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=2] [L758] 3 z = 1 [L759] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]]] VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L733] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L734] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L748] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L748] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L763] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L763] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 3 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[__unbuffered_cnt]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, x=1, y=1, z=1] [L785] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_cnt]]]] [L785] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L786] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2531={5:0}, t2532={6:0}, t2533={3:0}, x=1, y=1, z=1] [L787] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[main$tmp_guard0],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] [L787] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L787] RET 0 assume_abort_if_not(main$tmp_guard0) [L791] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[__unbuffered_p0_EAX]],BinaryExpression[COMPLEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[y],IntegerLiteral[2]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[__unbuffered_p0_EAX],IntegerLiteral[1]]]],BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[2]],BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[0],IdentifierExpression[z]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[2]]],BinaryExpression[COMPLEQ,IdentifierExpression[z],IntegerLiteral[127]]],BinaryExpression[LOGICOR,BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[1]]],BinaryExpression[COMPEQ,IdentifierExpression[z],IntegerLiteral[2]]]]]]]] VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2531={5:0}, t2532={6:0}, t2533={3:0}, x=1, y=1, z=1] - UnprovableResult [Line: 724]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 728]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 733]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 734]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 749]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 763]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 764]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 785]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 792]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 783]: 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: 779]: 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: 781]: 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, 98 locations, 37 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: 5.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 306 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 304 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 543 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 0 mSDtfsCounter, 543 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=173occurred in iteration=9, InterpolantAutomatonStates: 32, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-02-07 19:04:58,033 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