./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/bigshot_s2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bigshot_s2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d8006e4b 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/bigshot_s2.i ./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bigshot_s2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-d8006e4-m [2024-02-05 10:25:21,982 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-05 10:25:22,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-05 10:25:22,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-05 10:25:22,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-05 10:25:22,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-05 10:25:22,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-05 10:25:22,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-05 10:25:22,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-05 10:25:22,076 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-05 10:25:22,077 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-05 10:25:22,077 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-05 10:25:22,078 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-05 10:25:22,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-05 10:25:22,079 INFO L153 SettingsManager]: * Use SBE=true [2024-02-05 10:25:22,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-05 10:25:22,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-05 10:25:22,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-05 10:25:22,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-05 10:25:22,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-05 10:25:22,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-05 10:25:22,080 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-05 10:25:22,080 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-05 10:25:22,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-05 10:25:22,081 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-05 10:25:22,081 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-05 10:25:22,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-05 10:25:22,081 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-05 10:25:22,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-05 10:25:22,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-05 10:25:22,083 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-05 10:25:22,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-05 10:25:22,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:25:22,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-05 10:25:22,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-05 10:25:22,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-05 10:25:22,084 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-05 10:25:22,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-05 10:25:22,084 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-05 10:25:22,084 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-05 10:25:22,084 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-05 10:25:22,085 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-05 10:25:22,085 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-05 10:25:22,085 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-05 10:25:22,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-05 10:25:22,316 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-05 10:25:22,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-05 10:25:22,319 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-05 10:25:22,320 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-05 10:25:22,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-01-24_13-31-21.files/SV-COMP24_unreach-call/bigshot_s2.yml/witness.yml [2024-02-05 10:25:22,382 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-05 10:25:22,383 INFO L274 PluginConnector]: CDTParser initialized [2024-02-05 10:25:22,384 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2024-02-05 10:25:23,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-05 10:25:23,563 INFO L384 CDTParser]: Found 1 translation units. [2024-02-05 10:25:23,563 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2024-02-05 10:25:23,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161b95f78/dec88a25ab12432883f4d4e34a89e994/FLAG1be2e7c41 [2024-02-05 10:25:23,589 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/161b95f78/dec88a25ab12432883f4d4e34a89e994 [2024-02-05 10:25:23,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-05 10:25:23,591 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-05 10:25:23,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-05 10:25:23,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-05 10:25:23,597 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-05 10:25:23,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:25:22" (1/2) ... [2024-02-05 10:25:23,598 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60401de2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:25:23, skipping insertion in model container [2024-02-05 10:25:23,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:25:22" (1/2) ... [2024-02-05 10:25:23,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@47dcf254 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 05.02 10:25:23, skipping insertion in model container [2024-02-05 10:25:23,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:23" (2/2) ... [2024-02-05 10:25:23,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60401de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:23, skipping insertion in model container [2024-02-05 10:25:23,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:25:23" (2/2) ... [2024-02-05 10:25:23,601 INFO L86 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-05 10:25:23,637 INFO L99 nessWitnessExtractor]: Found the following entries in the witness: [2024-02-05 10:25:23,638 INFO L101 nessWitnessExtractor]: Location invariant before [L1107-L1107] ((0 <= expression) && (expression <= 1)) && (expression == 0 || expression == 1) [2024-02-05 10:25:23,638 INFO L101 nessWitnessExtractor]: Location invariant before [L1116-L1116] (unsigned long )arg == 0UL [2024-02-05 10:25:23,638 INFO L101 nessWitnessExtractor]: Location invariant before [L1122-L1122] v == 0 [2024-02-05 10:25:23,638 INFO L101 nessWitnessExtractor]: Location invariant before [L1112-L1112] (unsigned long )arg == 0UL [2024-02-05 10:25:23,639 INFO L101 nessWitnessExtractor]: Location invariant before [L1117-L1117] (unsigned long )arg == 0UL [2024-02-05 10:25:23,639 INFO L101 nessWitnessExtractor]: Location invariant before [L1107-L1107] expression == 0 [2024-02-05 10:25:23,639 INFO L101 nessWitnessExtractor]: Location invariant before [L1107-L1107] expression == 1 [2024-02-05 10:25:23,640 INFO L101 nessWitnessExtractor]: Location invariant before [L1111-L1111] (unsigned long )arg == 0UL [2024-02-05 10:25:23,640 INFO L101 nessWitnessExtractor]: Location invariant after [L1107-L1107] expression == 1 [2024-02-05 10:25:23,640 INFO L101 nessWitnessExtractor]: Location invariant after [L1107-L1107] expression == 1 [2024-02-05 10:25:23,640 INFO L101 nessWitnessExtractor]: Location invariant after [L1116-L1116] (unsigned long )arg == 0UL [2024-02-05 10:25:23,640 INFO L101 nessWitnessExtractor]: Location invariant before [L1116-L1116] (unsigned long )arg == 0UL [2024-02-05 10:25:23,640 INFO L101 nessWitnessExtractor]: Location invariant after [L1107-L1107] expression == 0 [2024-02-05 10:25:23,706 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-02-05 10:25:23,982 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/bigshot_s2.i[55203,55216] [2024-02-05 10:25:24,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:25:24,015 INFO L204 MainTranslator]: Completed pre-run Start Parsing Local [2024-02-05 10:25:24,078 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/bigshot_s2.i[55203,55216] Start Parsing Local Start Parsing Local [2024-02-05 10:25:24,079 WARN L424 MainDispatcher]: Unable to annotate ; with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-05 10:25:24,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-05 10:25:24,124 INFO L208 MainTranslator]: Completed translation [2024-02-05 10:25:24,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24 WrapperNode [2024-02-05 10:25:24,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-05 10:25:24,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-05 10:25:24,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-05 10:25:24,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-05 10:25:24,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,186 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2024-02-05 10:25:24,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-05 10:25:24,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-05 10:25:24,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-05 10:25:24,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-05 10:25:24,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,225 INFO L175 MemorySlicer]: Split 17 memory accesses to 5 slices as follows [2, 9, 2, 2, 2]. 53 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0, 0]. The 3 writes are split as follows [0, 0, 1, 1, 1]. [2024-02-05 10:25:24,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-05 10:25:24,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-05 10:25:24,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-05 10:25:24,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-05 10:25:24,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (1/1) ... [2024-02-05 10:25:24,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-05 10:25:24,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:24,282 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-05 10:25:24,289 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-05 10:25:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-05 10:25:24,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-05 10:25:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-02-05 10:25:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-02-05 10:25:24,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2024-02-05 10:25:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2024-02-05 10:25:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2024-02-05 10:25:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-05 10:25:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-05 10:25:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-05 10:25:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-05 10:25:24,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-05 10:25:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-05 10:25:24,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-05 10:25:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-05 10:25:24,315 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-05 10:25:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-05 10:25:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-05 10:25:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-05 10:25:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-05 10:25:24,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-05 10:25:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-05 10:25:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-05 10:25:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-05 10:25:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-05 10:25:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-05 10:25:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-05 10:25:24,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-05 10:25:24,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-05 10:25:24,317 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-05 10:25:24,318 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-05 10:25:24,432 INFO L244 CfgBuilder]: Building ICFG [2024-02-05 10:25:24,434 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-05 10:25:24,574 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-05 10:25:24,575 INFO L293 CfgBuilder]: Performing block encoding [2024-02-05 10:25:24,650 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-05 10:25:24,651 INFO L320 CfgBuilder]: Removed 1 assume(true) statements. [2024-02-05 10:25:24,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:25:24 BoogieIcfgContainer [2024-02-05 10:25:24,651 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-05 10:25:24,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-05 10:25:24,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-05 10:25:24,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-05 10:25:24,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 05.02 10:25:22" (1/4) ... [2024-02-05 10:25:24,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604f5c97 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 05.02 10:25:24, skipping insertion in model container [2024-02-05 10:25:24,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:25:23" (2/4) ... [2024-02-05 10:25:24,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604f5c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:24, skipping insertion in model container [2024-02-05 10:25:24,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:25:24" (3/4) ... [2024-02-05 10:25:24,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@604f5c97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:25:24, skipping insertion in model container [2024-02-05 10:25:24,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.02 10:25:24" (4/4) ... [2024-02-05 10:25:24,658 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2024-02-05 10:25:24,671 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-05 10:25:24,672 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-02-05 10:25:24,672 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-05 10:25:24,713 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-05 10:25:24,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 42 transitions, 98 flow [2024-02-05 10:25:24,771 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-02-05 10:25:24,771 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:25:24,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 4/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-02-05 10:25:24,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 42 transitions, 98 flow [2024-02-05 10:25:24,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 39 transitions, 90 flow [2024-02-05 10:25:24,809 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-05 10:25:24,813 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;@31f99473, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-05 10:25:24,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-02-05 10:25:24,815 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-05 10:25:24,816 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-02-05 10:25:24,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:25:24,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:24,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-02-05 10:25:24,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:24,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:24,820 INFO L85 PathProgramCache]: Analyzing trace with hash 7946, now seen corresponding path program 1 times [2024-02-05 10:25:24,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:24,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764073611] [2024-02-05 10:25:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:24,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:25,019 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-05 10:25:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:25,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764073611] [2024-02-05 10:25:25,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764073611] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:25,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:25:25,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-05 10:25:25,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919066939] [2024-02-05 10:25:25,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:25,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:25:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:25:25,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:25:25,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 42 [2024-02-05 10:25:25,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 90 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-05 10:25:25,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:25,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 42 [2024-02-05 10:25:25,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:25,139 INFO L124 PetriNetUnfolderBase]: 10/69 cut-off events. [2024-02-05 10:25:25,139 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:25:25,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 69 events. 10/69 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 121 event pairs, 4 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 85. Up to 27 conditions per place. [2024-02-05 10:25:25,141 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 20 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2024-02-05 10:25:25,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 143 flow [2024-02-05 10:25:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:25:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:25:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-05 10:25:25,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2024-02-05 10:25:25,153 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 90 flow. Second operand 3 states and 87 transitions. [2024-02-05 10:25:25,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 143 flow [2024-02-05 10:25:25,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 41 transitions, 133 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-02-05 10:25:25,164 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 82 flow [2024-02-05 10:25:25,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2024-02-05 10:25:25,169 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2024-02-05 10:25:25,169 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 82 flow [2024-02-05 10:25:25,170 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-05 10:25:25,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:25,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-02-05 10:25:25,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-05 10:25:25,171 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:25,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:25,172 INFO L85 PathProgramCache]: Analyzing trace with hash 236990666, now seen corresponding path program 1 times [2024-02-05 10:25:25,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:25,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967741703] [2024-02-05 10:25:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:25,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:25,352 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-05 10:25:25,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:25,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967741703] [2024-02-05 10:25:25,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967741703] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:25,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:25:25,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:25:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140740535] [2024-02-05 10:25:25,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:25,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:25:25,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:25,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:25:25,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:25:25,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 42 [2024-02-05 10:25:25,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-05 10:25:25,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:25,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 42 [2024-02-05 10:25:25,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:25,434 INFO L124 PetriNetUnfolderBase]: 10/65 cut-off events. [2024-02-05 10:25:25,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:25:25,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 65 events. 10/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 109 event pairs, 5 based on Foata normal form. 2/57 useless extension candidates. Maximal degree in co-relation 60. Up to 34 conditions per place. [2024-02-05 10:25:25,436 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 17 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2024-02-05 10:25:25,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 118 flow [2024-02-05 10:25:25,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:25:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:25:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-02-05 10:25:25,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5773809523809523 [2024-02-05 10:25:25,439 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 82 flow. Second operand 4 states and 97 transitions. [2024-02-05 10:25:25,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 118 flow [2024-02-05 10:25:25,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 35 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:25:25,441 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 76 flow [2024-02-05 10:25:25,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-02-05 10:25:25,442 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-02-05 10:25:25,442 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 76 flow [2024-02-05 10:25:25,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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-05 10:25:25,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:25,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:25:25,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-05 10:25:25,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:25,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:25,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1536893984, now seen corresponding path program 1 times [2024-02-05 10:25:25,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:25,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038502625] [2024-02-05 10:25:25,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:25,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:25,627 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-05 10:25:25,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:25,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038502625] [2024-02-05 10:25:25,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038502625] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:25,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:25:25,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:25:25,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588585784] [2024-02-05 10:25:25,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:25,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:25:25,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:25,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:25:25,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:25:25,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2024-02-05 10:25:25,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:25:25,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:25,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2024-02-05 10:25:25,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:25,702 INFO L124 PetriNetUnfolderBase]: 10/49 cut-off events. [2024-02-05 10:25:25,702 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:25:25,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 49 events. 10/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 2 based on Foata normal form. 4/49 useless extension candidates. Maximal degree in co-relation 75. Up to 18 conditions per place. [2024-02-05 10:25:25,704 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 17 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2024-02-05 10:25:25,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 32 transitions, 110 flow [2024-02-05 10:25:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:25:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:25:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-02-05 10:25:25,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595238095238095 [2024-02-05 10:25:25,709 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 76 flow. Second operand 4 states and 94 transitions. [2024-02-05 10:25:25,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 32 transitions, 110 flow [2024-02-05 10:25:25,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:25:25,710 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 71 flow [2024-02-05 10:25:25,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2024-02-05 10:25:25,712 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2024-02-05 10:25:25,712 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 71 flow [2024-02-05 10:25:25,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:25:25,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:25,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:25:25,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-05 10:25:25,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:25,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:25,714 INFO L85 PathProgramCache]: Analyzing trace with hash -814656690, now seen corresponding path program 1 times [2024-02-05 10:25:25,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:25,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828627426] [2024-02-05 10:25:25,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:25,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:25,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:25,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828627426] [2024-02-05 10:25:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828627426] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:25,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:25:25,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:25:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457935217] [2024-02-05 10:25:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:25,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:25:25,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:25,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:25:25,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:25:25,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-02-05 10:25:25,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:25:25,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:25,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-02-05 10:25:25,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:25,829 INFO L124 PetriNetUnfolderBase]: 8/44 cut-off events. [2024-02-05 10:25:25,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-05 10:25:25,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 44 events. 8/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 4 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 70. Up to 26 conditions per place. [2024-02-05 10:25:25,830 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 17 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2024-02-05 10:25:25,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 107 flow [2024-02-05 10:25:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:25:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:25:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-02-05 10:25:25,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2024-02-05 10:25:25,832 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 71 flow. Second operand 3 states and 82 transitions. [2024-02-05 10:25:25,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 107 flow [2024-02-05 10:25:25,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 104 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-05 10:25:25,834 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 68 flow [2024-02-05 10:25:25,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2024-02-05 10:25:25,835 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2024-02-05 10:25:25,835 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 68 flow [2024-02-05 10:25:25,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-05 10:25:25,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:25,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:25:25,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-05 10:25:25,836 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:25,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash 417789903, now seen corresponding path program 1 times [2024-02-05 10:25:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281776541] [2024-02-05 10:25:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:25,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:26,407 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-05 10:25:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:26,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281776541] [2024-02-05 10:25:26,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281776541] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:25:26,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-05 10:25:26,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590940298] [2024-02-05 10:25:26,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:26,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-05 10:25:26,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:26,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-05 10:25:26,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:25:26,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-02-05 10:25:26,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 68 flow. Second operand has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-05 10:25:26,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:26,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-02-05 10:25:26,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:26,574 INFO L124 PetriNetUnfolderBase]: 13/64 cut-off events. [2024-02-05 10:25:26,574 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-05 10:25:26,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 64 events. 13/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 6 based on Foata normal form. 3/64 useless extension candidates. Maximal degree in co-relation 112. Up to 34 conditions per place. [2024-02-05 10:25:26,575 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 22 selfloop transitions, 5 changer transitions 5/41 dead transitions. [2024-02-05 10:25:26,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 155 flow [2024-02-05 10:25:26,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:25:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:25:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-02-05 10:25:26,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5089285714285714 [2024-02-05 10:25:26,577 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 68 flow. Second operand 8 states and 171 transitions. [2024-02-05 10:25:26,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 155 flow [2024-02-05 10:25:26,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 41 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:25:26,579 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 99 flow [2024-02-05 10:25:26,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=99, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2024-02-05 10:25:26,581 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-02-05 10:25:26,581 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 99 flow [2024-02-05 10:25:26,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 0 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-05 10:25:26,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:26,581 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:25:26,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-05 10:25:26,582 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:26,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:26,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1554654268, now seen corresponding path program 1 times [2024-02-05 10:25:26,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:26,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443902040] [2024-02-05 10:25:26,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:26,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:26,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443902040] [2024-02-05 10:25:26,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443902040] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:26,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089705724] [2024-02-05 10:25:26,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:26,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:26,747 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:26,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-05 10:25:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:26,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-05 10:25:26,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:26,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-05 10:25:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:26,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:25:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:27,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089705724] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:25:27,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:25:27,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-02-05 10:25:27,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255143348] [2024-02-05 10:25:27,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:25:27,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-05 10:25:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-05 10:25:27,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-02-05 10:25:27,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-02-05 10:25:27,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 99 flow. Second operand has 14 states, 14 states have (on average 24.357142857142858) internal successors, (341), 14 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-05 10:25:27,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:27,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-02-05 10:25:27,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:27,112 INFO L124 PetriNetUnfolderBase]: 15/63 cut-off events. [2024-02-05 10:25:27,112 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-05 10:25:27,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 63 events. 15/63 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 7 based on Foata normal form. 2/62 useless extension candidates. Maximal degree in co-relation 136. Up to 33 conditions per place. [2024-02-05 10:25:27,113 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 21 selfloop transitions, 6 changer transitions 1/40 dead transitions. [2024-02-05 10:25:27,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 173 flow [2024-02-05 10:25:27,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-05 10:25:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-05 10:25:27,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-02-05 10:25:27,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2024-02-05 10:25:27,114 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 99 flow. Second operand 7 states and 176 transitions. [2024-02-05 10:25:27,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 173 flow [2024-02-05 10:25:27,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 164 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-02-05 10:25:27,116 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 120 flow [2024-02-05 10:25:27,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=120, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-02-05 10:25:27,116 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2024-02-05 10:25:27,117 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 120 flow [2024-02-05 10:25:27,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 24.357142857142858) internal successors, (341), 14 states have internal predecessors, (341), 0 states have call successors, (0), 0 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-05 10:25:27,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:27,117 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:25:27,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-05 10:25:27,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-05 10:25:27,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:27,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:27,333 INFO L85 PathProgramCache]: Analyzing trace with hash 227248765, now seen corresponding path program 2 times [2024-02-05 10:25:27,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:27,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136549825] [2024-02-05 10:25:27,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:27,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:27,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:27,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136549825] [2024-02-05 10:25:27,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136549825] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:27,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352806096] [2024-02-05 10:25:27,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:25:27,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:27,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:27,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:27,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-05 10:25:27,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-05 10:25:27,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:25:27,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-05 10:25:27,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-05 10:25:27,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-05 10:25:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352806096] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:27,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-05 10:25:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-02-05 10:25:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881772299] [2024-02-05 10:25:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:27,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:25:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:27,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:25:27,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-02-05 10:25:27,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 42 [2024-02-05 10:25:27,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-05 10:25:27,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:27,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 42 [2024-02-05 10:25:27,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:27,670 INFO L124 PetriNetUnfolderBase]: 13/60 cut-off events. [2024-02-05 10:25:27,670 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-02-05 10:25:27,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 60 events. 13/60 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 11 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 147. Up to 45 conditions per place. [2024-02-05 10:25:27,671 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 24 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2024-02-05 10:25:27,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 168 flow [2024-02-05 10:25:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:25:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:25:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-02-05 10:25:27,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-05 10:25:27,673 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 120 flow. Second operand 3 states and 75 transitions. [2024-02-05 10:25:27,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 168 flow [2024-02-05 10:25:27,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 156 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-02-05 10:25:27,675 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 108 flow [2024-02-05 10:25:27,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2024-02-05 10:25:27,675 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-02-05 10:25:27,675 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 108 flow [2024-02-05 10:25:27,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 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-05 10:25:27,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:27,676 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 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-05 10:25:27,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-05 10:25:27,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-05 10:25:27,885 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:27,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:27,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2023475530, now seen corresponding path program 1 times [2024-02-05 10:25:27,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:27,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231145005] [2024-02-05 10:25:27,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-05 10:25:27,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:27,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231145005] [2024-02-05 10:25:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231145005] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:27,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:25:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-05 10:25:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348576882] [2024-02-05 10:25:27,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:27,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-05 10:25:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:27,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-05 10:25:27,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-05 10:25:27,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-05 10:25:27,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-05 10:25:27,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:27,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-05 10:25:27,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:27,970 INFO L124 PetriNetUnfolderBase]: 13/59 cut-off events. [2024-02-05 10:25:27,970 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-05 10:25:27,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 59 events. 13/59 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 11 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 139. Up to 45 conditions per place. [2024-02-05 10:25:27,971 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 24 selfloop transitions, 2 changer transitions 1/33 dead transitions. [2024-02-05 10:25:27,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 160 flow [2024-02-05 10:25:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-05 10:25:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-05 10:25:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-02-05 10:25:27,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2024-02-05 10:25:27,972 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 108 flow. Second operand 4 states and 83 transitions. [2024-02-05 10:25:27,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 160 flow [2024-02-05 10:25:27,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 33 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:25:27,975 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 107 flow [2024-02-05 10:25:27,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2024-02-05 10:25:27,976 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-02-05 10:25:27,976 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 107 flow [2024-02-05 10:25:27,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-05 10:25:27,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:27,977 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 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-05 10:25:27,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-05 10:25:27,977 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:27,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2023475539, now seen corresponding path program 1 times [2024-02-05 10:25:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:27,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688183485] [2024-02-05 10:25:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-02-05 10:25:28,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:28,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688183485] [2024-02-05 10:25:28,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688183485] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-05 10:25:28,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-05 10:25:28,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-05 10:25:28,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776800554] [2024-02-05 10:25:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-05 10:25:28,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-05 10:25:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-05 10:25:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-05 10:25:28,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 42 [2024-02-05 10:25:28,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-05 10:25:28,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:28,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 42 [2024-02-05 10:25:28,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:28,064 INFO L124 PetriNetUnfolderBase]: 13/57 cut-off events. [2024-02-05 10:25:28,065 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-05 10:25:28,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 57 events. 13/57 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 11 based on Foata normal form. 1/56 useless extension candidates. Maximal degree in co-relation 135. Up to 46 conditions per place. [2024-02-05 10:25:28,066 INFO L140 encePairwiseOnDemand]: 40/42 looper letters, 23 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2024-02-05 10:25:28,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 151 flow [2024-02-05 10:25:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-05 10:25:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-05 10:25:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-02-05 10:25:28,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2024-02-05 10:25:28,067 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 107 flow. Second operand 3 states and 71 transitions. [2024-02-05 10:25:28,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 151 flow [2024-02-05 10:25:28,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 31 transitions, 150 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:25:28,069 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 104 flow [2024-02-05 10:25:28,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2024-02-05 10:25:28,069 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2024-02-05 10:25:28,069 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 104 flow [2024-02-05 10:25:28,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-05 10:25:28,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:28,070 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 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-05 10:25:28,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-05 10:25:28,070 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:28,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1696767971, now seen corresponding path program 1 times [2024-02-05 10:25:28,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:28,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316105279] [2024-02-05 10:25:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:28,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316105279] [2024-02-05 10:25:28,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316105279] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:28,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868133758] [2024-02-05 10:25:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:28,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:28,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:28,245 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:28,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-05 10:25:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:28,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-05 10:25:28,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:28,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-05 10:25:28,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:28,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:25:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:28,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868133758] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:25:28,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:25:28,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-02-05 10:25:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622393520] [2024-02-05 10:25:28,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:25:28,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-05 10:25:28,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:28,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-05 10:25:28,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-02-05 10:25:28,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-02-05 10:25:28,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 104 flow. Second operand has 17 states, 17 states have (on average 24.235294117647058) internal successors, (412), 17 states have internal predecessors, (412), 0 states have call successors, (0), 0 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-05 10:25:28,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:28,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-02-05 10:25:28,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:28,687 INFO L124 PetriNetUnfolderBase]: 17/65 cut-off events. [2024-02-05 10:25:28,687 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-02-05 10:25:28,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 65 events. 17/65 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 7 based on Foata normal form. 2/65 useless extension candidates. Maximal degree in co-relation 168. Up to 33 conditions per place. [2024-02-05 10:25:28,688 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 23 selfloop transitions, 7 changer transitions 1/39 dead transitions. [2024-02-05 10:25:28,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 192 flow [2024-02-05 10:25:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-02-05 10:25:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-02-05 10:25:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-02-05 10:25:28,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-02-05 10:25:28,689 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 104 flow. Second operand 8 states and 200 transitions. [2024-02-05 10:25:28,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 192 flow [2024-02-05 10:25:28,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 39 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-05 10:25:28,691 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 139 flow [2024-02-05 10:25:28,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2024-02-05 10:25:28,691 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2024-02-05 10:25:28,692 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 139 flow [2024-02-05 10:25:28,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 24.235294117647058) internal successors, (412), 17 states have internal predecessors, (412), 0 states have call successors, (0), 0 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-05 10:25:28,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:28,692 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 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-05 10:25:28,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-05 10:25:28,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:28,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:28,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:28,905 INFO L85 PathProgramCache]: Analyzing trace with hash 668185704, now seen corresponding path program 2 times [2024-02-05 10:25:28,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:28,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894359026] [2024-02-05 10:25:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:28,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:29,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894359026] [2024-02-05 10:25:29,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894359026] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:29,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781422516] [2024-02-05 10:25:29,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-05 10:25:29,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:29,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:29,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:29,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-05 10:25:29,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-05 10:25:29,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:25:29,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-05 10:25:29,225 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:29,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-05 10:25:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:29,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:25:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781422516] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:25:29,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:25:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2024-02-05 10:25:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420977824] [2024-02-05 10:25:29,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:25:29,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-02-05 10:25:29,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-02-05 10:25:29,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-02-05 10:25:29,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-02-05 10:25:29,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 139 flow. Second operand has 20 states, 20 states have (on average 24.05) internal successors, (481), 20 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-05 10:25:29,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:29,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-02-05 10:25:29,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:29,646 INFO L124 PetriNetUnfolderBase]: 19/71 cut-off events. [2024-02-05 10:25:29,646 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-02-05 10:25:29,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 71 events. 19/71 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 7 based on Foata normal form. 2/71 useless extension candidates. Maximal degree in co-relation 210. Up to 33 conditions per place. [2024-02-05 10:25:29,647 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 25 selfloop transitions, 8 changer transitions 1/42 dead transitions. [2024-02-05 10:25:29,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 42 transitions, 241 flow [2024-02-05 10:25:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-05 10:25:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-05 10:25:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 224 transitions. [2024-02-05 10:25:29,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5925925925925926 [2024-02-05 10:25:29,648 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 139 flow. Second operand 9 states and 224 transitions. [2024-02-05 10:25:29,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 42 transitions, 241 flow [2024-02-05 10:25:29,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 223 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-02-05 10:25:29,650 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 163 flow [2024-02-05 10:25:29,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=163, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2024-02-05 10:25:29,650 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2024-02-05 10:25:29,650 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 163 flow [2024-02-05 10:25:29,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 24.05) internal successors, (481), 20 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-05 10:25:29,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:29,651 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 4, 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-05 10:25:29,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-05 10:25:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:29,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:29,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1734030107, now seen corresponding path program 3 times [2024-02-05 10:25:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:29,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850669896] [2024-02-05 10:25:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:30,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850669896] [2024-02-05 10:25:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850669896] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11360510] [2024-02-05 10:25:30,065 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-05 10:25:30,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:30,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:30,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:30,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-05 10:25:30,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-02-05 10:25:30,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:25:30,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 17 conjunts are in the unsatisfiable core [2024-02-05 10:25:30,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:30,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-05 10:25:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:30,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:25:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:30,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11360510] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:25:30,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:25:30,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-02-05 10:25:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852104464] [2024-02-05 10:25:30,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:25:30,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-05 10:25:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:30,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-05 10:25:30,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-02-05 10:25:30,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-02-05 10:25:30,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 163 flow. Second operand has 23 states, 23 states have (on average 23.91304347826087) internal successors, (550), 23 states have internal predecessors, (550), 0 states have call successors, (0), 0 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-05 10:25:30,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:30,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-02-05 10:25:30,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:30,641 INFO L124 PetriNetUnfolderBase]: 21/77 cut-off events. [2024-02-05 10:25:30,642 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-02-05 10:25:30,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 77 events. 21/77 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 7 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 248. Up to 33 conditions per place. [2024-02-05 10:25:30,643 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 27 selfloop transitions, 9 changer transitions 1/45 dead transitions. [2024-02-05 10:25:30,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 45 transitions, 279 flow [2024-02-05 10:25:30,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-02-05 10:25:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-02-05 10:25:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 248 transitions. [2024-02-05 10:25:30,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2024-02-05 10:25:30,645 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 163 flow. Second operand 10 states and 248 transitions. [2024-02-05 10:25:30,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 45 transitions, 279 flow [2024-02-05 10:25:30,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 45 transitions, 255 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-02-05 10:25:30,646 INFO L231 Difference]: Finished difference. Result has 62 places, 37 transitions, 187 flow [2024-02-05 10:25:30,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=187, PETRI_PLACES=62, PETRI_TRANSITIONS=37} [2024-02-05 10:25:30,647 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 20 predicate places. [2024-02-05 10:25:30,647 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 37 transitions, 187 flow [2024-02-05 10:25:30,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 23.91304347826087) internal successors, (550), 23 states have internal predecessors, (550), 0 states have call successors, (0), 0 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-05 10:25:30,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:30,648 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 5, 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-05 10:25:30,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-05 10:25:30,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-02-05 10:25:30,875 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:30,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 428980770, now seen corresponding path program 4 times [2024-02-05 10:25:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:30,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388347030] [2024-02-05 10:25:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:31,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:31,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388347030] [2024-02-05 10:25:31,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388347030] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:31,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653386960] [2024-02-05 10:25:31,087 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-05 10:25:31,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:31,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:31,088 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:31,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-05 10:25:31,190 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-05 10:25:31,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:25:31,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2024-02-05 10:25:31,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:31,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-05 10:25:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:31,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:25:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653386960] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:25:31,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:25:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2024-02-05 10:25:31,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584307170] [2024-02-05 10:25:31,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:25:31,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-02-05 10:25:31,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:31,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-02-05 10:25:31,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-02-05 10:25:31,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-02-05 10:25:31,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 37 transitions, 187 flow. Second operand has 26 states, 26 states have (on average 23.807692307692307) internal successors, (619), 26 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-05 10:25:31,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:31,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-02-05 10:25:31,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:31,815 INFO L124 PetriNetUnfolderBase]: 23/83 cut-off events. [2024-02-05 10:25:31,816 INFO L125 PetriNetUnfolderBase]: For 169/169 co-relation queries the response was YES. [2024-02-05 10:25:31,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 83 events. 23/83 cut-off events. For 169/169 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 7 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 286. Up to 33 conditions per place. [2024-02-05 10:25:31,817 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 29 selfloop transitions, 10 changer transitions 1/48 dead transitions. [2024-02-05 10:25:31,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 48 transitions, 317 flow [2024-02-05 10:25:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-05 10:25:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-05 10:25:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 272 transitions. [2024-02-05 10:25:31,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5887445887445888 [2024-02-05 10:25:31,819 INFO L175 Difference]: Start difference. First operand has 62 places, 37 transitions, 187 flow. Second operand 11 states and 272 transitions. [2024-02-05 10:25:31,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 48 transitions, 317 flow [2024-02-05 10:25:31,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 48 transitions, 287 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-02-05 10:25:31,823 INFO L231 Difference]: Finished difference. Result has 67 places, 39 transitions, 211 flow [2024-02-05 10:25:31,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=211, PETRI_PLACES=67, PETRI_TRANSITIONS=39} [2024-02-05 10:25:31,824 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2024-02-05 10:25:31,824 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 39 transitions, 211 flow [2024-02-05 10:25:31,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 23.807692307692307) internal successors, (619), 26 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-05 10:25:31,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:31,825 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 6, 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-05 10:25:31,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-05 10:25:32,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:32,039 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:32,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash 318262303, now seen corresponding path program 5 times [2024-02-05 10:25:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:32,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106022727] [2024-02-05 10:25:32,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:32,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:32,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106022727] [2024-02-05 10:25:32,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106022727] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:32,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717200886] [2024-02-05 10:25:32,296 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-05 10:25:32,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:32,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:32,300 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:32,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-05 10:25:32,435 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2024-02-05 10:25:32,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:25:32,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 21 conjunts are in the unsatisfiable core [2024-02-05 10:25:32,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:32,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-02-05 10:25:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:32,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:25:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:32,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717200886] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:25:32,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:25:32,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2024-02-05 10:25:32,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461216093] [2024-02-05 10:25:32,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:25:32,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-02-05 10:25:32,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:25:32,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-02-05 10:25:32,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2024-02-05 10:25:32,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 42 [2024-02-05 10:25:32,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 39 transitions, 211 flow. Second operand has 29 states, 29 states have (on average 23.724137931034484) internal successors, (688), 29 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-05 10:25:32,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:25:32,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 42 [2024-02-05 10:25:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:25:33,230 INFO L124 PetriNetUnfolderBase]: 25/89 cut-off events. [2024-02-05 10:25:33,230 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2024-02-05 10:25:33,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 89 events. 25/89 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 7 based on Foata normal form. 2/89 useless extension candidates. Maximal degree in co-relation 324. Up to 33 conditions per place. [2024-02-05 10:25:33,231 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 31 selfloop transitions, 11 changer transitions 1/51 dead transitions. [2024-02-05 10:25:33,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 51 transitions, 355 flow [2024-02-05 10:25:33,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-05 10:25:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-05 10:25:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 296 transitions. [2024-02-05 10:25:33,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-02-05 10:25:33,233 INFO L175 Difference]: Start difference. First operand has 67 places, 39 transitions, 211 flow. Second operand 12 states and 296 transitions. [2024-02-05 10:25:33,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 51 transitions, 355 flow [2024-02-05 10:25:33,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 51 transitions, 319 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-02-05 10:25:33,235 INFO L231 Difference]: Finished difference. Result has 72 places, 41 transitions, 235 flow [2024-02-05 10:25:33,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=235, PETRI_PLACES=72, PETRI_TRANSITIONS=41} [2024-02-05 10:25:33,236 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-02-05 10:25:33,236 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 41 transitions, 235 flow [2024-02-05 10:25:33,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 23.724137931034484) internal successors, (688), 29 states have internal predecessors, (688), 0 states have call successors, (0), 0 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-05 10:25:33,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-05 10:25:33,236 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 7, 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-05 10:25:33,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-05 10:25:33,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:33,449 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (and 14 more)] === [2024-02-05 10:25:33,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-05 10:25:33,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1291997916, now seen corresponding path program 6 times [2024-02-05 10:25:33,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-05 10:25:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665549449] [2024-02-05 10:25:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-05 10:25:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-05 10:25:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-05 10:25:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 20 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-05 10:25:34,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665549449] [2024-02-05 10:25:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665549449] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-05 10:25:34,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566088104] [2024-02-05 10:25:34,376 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-05 10:25:34,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-05 10:25:34,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-05 10:25:34,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-05 10:25:34,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-05 10:25:34,502 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-02-05 10:25:34,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-05 10:25:34,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 47 conjunts are in the unsatisfiable core [2024-02-05 10:25:34,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-05 10:25:34,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-02-05 10:25:34,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-05 10:25:34,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-02-05 10:25:34,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-05 10:25:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-02-05 10:25:34,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-05 10:25:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-02-05 10:25:34,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-05 10:25:34,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-02-05 10:25:34,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-05 10:25:34,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-02-05 10:25:34,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-05 10:25:34,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-02-05 10:25:34,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-02-05 10:25:34,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-02-05 10:25:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-05 10:25:34,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-05 10:25:35,442 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| Int)) (or (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59| Int)) (= 66 (select (select (store |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (select |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59|)) c_~v~0.base) c_~v~0.offset))) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)))) is different from false [2024-02-05 10:28:09,517 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)) (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_61| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_60| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_63| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_62| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| 1)) (= 66 (select (select (store |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (store (select |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_63|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_62|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_61|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_60|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59|)) c_~v~0.base) c_~v~0.offset)))))) is different from false [2024-02-05 10:29:11,049 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| Int)) (or (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_61| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_60| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_63| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_62| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_64| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| 1)) (= 66 (select (select (store |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (store (store (select |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_64|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_63|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_62|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_61|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_60|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59|)) c_~v~0.base) c_~v~0.offset)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| 1)))) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)))) is different from false [2024-02-05 10:30:21,696 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 1)) (forall ((|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_61| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_60| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_63| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_62| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_65| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_64| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| Int) (|v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| Int)) (or (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| 1)) (= 66 (select (select (store |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| (store (store (store (store (store (store (store (select |c_#memory_int#2| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_65|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_64|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_63|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_84| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_62|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_61|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_60|) (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset|) |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~mem14#1_59|)) c_~v~0.base) c_~v~0.offset)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_87| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_81| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_82| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_83| 1)) (< |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_85| (+ |v_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1_86| 1)))))) is different from false [2024-02-05 10:30:21,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 410218 treesize of output 409962 [2024-02-05 10:30:29,066 WARN L293 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 502 DAG size of output: 238 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-05 10:30:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 16 refuted. 12 times theorem prover too weak. 0 trivial. 22 not checked. [2024-02-05 10:30:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566088104] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-05 10:30:33,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-05 10:30:33,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 20] total 42 [2024-02-05 10:30:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342315302] [2024-02-05 10:30:33,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-05 10:30:33,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-02-05 10:30:33,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-05 10:30:33,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-02-05 10:30:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1106, Unknown=67, NotChecked=308, Total=1806 [2024-02-05 10:30:33,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 42 [2024-02-05 10:30:33,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 41 transitions, 235 flow. Second operand has 43 states, 43 states have (on average 14.906976744186046) internal successors, (641), 43 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-05 10:30:33,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-05 10:30:33,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 42 [2024-02-05 10:30:33,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-05 10:30:34,573 INFO L124 PetriNetUnfolderBase]: 23/84 cut-off events. [2024-02-05 10:30:34,573 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2024-02-05 10:30:34,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 84 events. 23/84 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 83 event pairs, 2 based on Foata normal form. 1/83 useless extension candidates. Maximal degree in co-relation 311. Up to 20 conditions per place. [2024-02-05 10:30:34,574 INFO L140 encePairwiseOnDemand]: 35/42 looper letters, 0 selfloop transitions, 0 changer transitions 48/48 dead transitions. [2024-02-05 10:30:34,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 48 transitions, 334 flow [2024-02-05 10:30:34,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-05 10:30:34,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-05 10:30:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 225 transitions. [2024-02-05 10:30:34,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3826530612244898 [2024-02-05 10:30:34,575 INFO L175 Difference]: Start difference. First operand has 72 places, 41 transitions, 235 flow. Second operand 14 states and 225 transitions. [2024-02-05 10:30:34,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 48 transitions, 334 flow [2024-02-05 10:30:34,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 48 transitions, 292 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-02-05 10:30:34,578 INFO L231 Difference]: Finished difference. Result has 72 places, 0 transitions, 0 flow [2024-02-05 10:30:34,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=0, PETRI_PLACES=72, PETRI_TRANSITIONS=0} [2024-02-05 10:30:34,578 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2024-02-05 10:30:34,578 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 0 transitions, 0 flow [2024-02-05 10:30:34,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 14.906976744186046) internal successors, (641), 43 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-05 10:30:34,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 17 remaining) [2024-02-05 10:30:34,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 17 remaining) [2024-02-05 10:30:34,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 17 remaining) [2024-02-05 10:30:34,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 17 remaining) [2024-02-05 10:30:34,581 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2024-02-05 10:30:34,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 17 remaining) [2024-02-05 10:30:34,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 17 remaining) [2024-02-05 10:30:34,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 17 remaining) [2024-02-05 10:30:34,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 17 remaining) [2024-02-05 10:30:34,583 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 17 remaining) [2024-02-05 10:30:34,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-05 10:30:34,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-02-05 10:30:34,795 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1] [2024-02-05 10:30:34,799 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-05 10:30:34,799 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-05 10:30:34,802 INFO L503 ceAbstractionStarter]: Automizer considered 9 witness invariants [2024-02-05 10:30:34,802 INFO L504 ceAbstractionStarter]: WitnessConsidered=9 [2024-02-05 10:30:34,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:30:34 BasicIcfg [2024-02-05 10:30:34,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-05 10:30:34,803 INFO L158 Benchmark]: Toolchain (without parser) took 311212.32ms. Allocated memory was 163.6MB in the beginning and 792.7MB in the end (delta: 629.1MB). Free memory was 103.3MB in the beginning and 348.4MB in the end (delta: -245.1MB). Peak memory consumption was 383.7MB. Max. memory is 16.1GB. [2024-02-05 10:30:34,803 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:30:34,803 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-05 10:30:34,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.26ms. Allocated memory is still 163.6MB. Free memory was 103.3MB in the beginning and 102.4MB in the end (delta: 888.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-02-05 10:30:34,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.74ms. Allocated memory is still 163.6MB. Free memory was 102.4MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-05 10:30:34,804 INFO L158 Benchmark]: Boogie Preprocessor took 69.74ms. Allocated memory is still 163.6MB. Free memory was 100.3MB in the beginning and 97.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-05 10:30:34,804 INFO L158 Benchmark]: RCFGBuilder took 393.24ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 70.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-02-05 10:30:34,804 INFO L158 Benchmark]: TraceAbstraction took 310149.87ms. Allocated memory was 163.6MB in the beginning and 792.7MB in the end (delta: 629.1MB). Free memory was 69.6MB in the beginning and 348.4MB in the end (delta: -278.8MB). Peak memory consumption was 352.1MB. Max. memory is 16.1GB. [2024-02-05 10:30:34,807 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.16ms. Allocated memory is still 96.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 47.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.26ms. Allocated memory is still 163.6MB. Free memory was 103.3MB in the beginning and 102.4MB in the end (delta: 888.5kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.74ms. Allocated memory is still 163.6MB. Free memory was 102.4MB in the beginning and 100.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.74ms. Allocated memory is still 163.6MB. Free memory was 100.3MB in the beginning and 97.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.24ms. Allocated memory is still 163.6MB. Free memory was 97.5MB in the beginning and 70.3MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 310149.87ms. Allocated memory was 163.6MB in the beginning and 792.7MB in the end (delta: 629.1MB). Free memory was 69.6MB in the beginning and 348.4MB in the end (delta: -278.8MB). Peak memory consumption was 352.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1111]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1112]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1116]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1116]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1117]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1122]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1107]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1107]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1107]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 59 locations, 17 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: 310.1s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 154 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2914 IncrementalHoareTripleChecker+Invalid, 3096 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 7 mSDtfsCounter, 2914 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 381 SyntacticMatches, 8 SemanticMatches, 234 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 288.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=14, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 303.6s InterpolantComputationTime, 624 NumberOfCodeBlocks, 620 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 822 ConstructedInterpolants, 14 QuantifiedInterpolants, 6871 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1790 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 30 InterpolantComputations, 8 PerfectInterpolantSequences, 80/528 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 - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-02-05 10:30:34,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE