./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/clever.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3d25acf6 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-3d25acf-m [2024-01-30 14:23:42,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:23:42,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-30 14:23:42,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:23:42,947 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:23:42,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:23:42,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:23:42,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:23:42,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:23:42,975 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:23:42,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:23:42,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:23:42,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:23:42,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:23:42,990 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:23:42,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:23:42,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:23:42,991 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:23:42,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:23:42,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:23:42,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:23:42,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:23:42,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:23:42,993 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:23:42,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:23:42,994 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:23:42,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:23:42,994 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:23:42,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:23:42,995 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:23:42,995 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:23:42,995 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:23:42,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:23:42,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:23:42,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:23:42,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:23:42,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:23:42,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:23:42,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:23:42,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:23:42,997 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:23:42,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:23:42,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:23:42,997 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-30 14:23:43,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:23:43,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:23:43,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:23:43,195 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:23:43,195 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:23:43,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/clever.wvr.yml/witness.yml [2024-01-30 14:23:43,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:23:43,323 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:23:43,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-30 14:23:44,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:23:44,480 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:23:44,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2024-01-30 14:23:44,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef75bf8a5/51efce2716554323b40faea680650b1d/FLAG978a49d19 [2024-01-30 14:23:44,517 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef75bf8a5/51efce2716554323b40faea680650b1d [2024-01-30 14:23:44,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:23:44,518 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:23:44,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:23:44,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:23:44,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:23:44,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:23:43" (1/2) ... [2024-01-30 14:23:44,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b6fedb and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:44, skipping insertion in model container [2024-01-30 14:23:44,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:23:43" (1/2) ... [2024-01-30 14:23:44,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65d48292 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:44, skipping insertion in model container [2024-01-30 14:23:44,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:23:44" (2/2) ... [2024-01-30 14:23:44,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70b6fedb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44, skipping insertion in model container [2024-01-30 14:23:44,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:23:44" (2/2) ... [2024-01-30 14:23:44,528 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:23:44,553 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:23:44,554 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] k2 == 0U [2024-01-30 14:23:44,554 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (m == 0)) && (i1 == 0)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-01-30 14:23:44,554 INFO L98 nessWitnessExtractor]: Location invariant after [L41-L43] k2 == 0U [2024-01-30 14:23:44,554 INFO L98 nessWitnessExtractor]: Loop invariant at [L41-L43] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,554 INFO L98 nessWitnessExtractor]: Location invariant before [L47-L47] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,554 INFO L98 nessWitnessExtractor]: Location invariant before [L53-L53] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,554 INFO L98 nessWitnessExtractor]: Location invariant before [L63-L63] (((((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (n == 0)) && (m == 0)) && (i1 == 0)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] (k1 == 0U) && (k2 == 0U) [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Location invariant before [L42-L42] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] ((j1 == 0) && (k1 == 0U)) && (k2 == 0U) [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Loop invariant at [L51-L54] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((((((((0LL - (long long )i2) + (long long )j1 >= 0LL) && ((long long )i2 + (long long )j1 >= 0LL)) && ((0LL - (long long )i2) - (long long )j1 >= 0LL)) && ((long long )i2 - (long long )j1 >= 0LL)) && (i1 == 0)) && (i2 == 0)) && (j1 == 0)) && (k1 == 0U)) && (k2 == 0U) [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Location invariant before [L56-L56] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,555 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] ((j1 == 0) && (k1 == 0U)) && (k2 == 0U) [2024-01-30 14:23:44,556 INFO L98 nessWitnessExtractor]: Location invariant before [L52-L52] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,556 INFO L98 nessWitnessExtractor]: Location invariant before [L44-L44] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,556 INFO L98 nessWitnessExtractor]: Loop invariant at [L40-L45] (unsigned long )_argptr == 0UL [2024-01-30 14:23:44,571 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:23:44,721 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c[2159,2172] [2024-01-30 14:23:44,726 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:23:44,737 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:23:44,747 WARN L424 MainDispatcher]: Unable to annotate extern int pthread_create (pthread_t *__restrict __newthread, const pthread_attr_t *__restrict __attr, void *(*__start_routine) (void *), void *__restrict __arg) __attribute__ ((__nothrow__)) __attribute__ ((__nonnull__ (1, 3))); with a witness entry Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-01-30 14:23:44,812 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c[2159,2172] [2024-01-30 14:23:44,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:23:44,823 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:23:44,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44 WrapperNode [2024-01-30 14:23:44,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:23:44,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:23:44,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:23:44,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:23:44,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,869 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 91 [2024-01-30 14:23:44,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:23:44,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:23:44,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:23:44,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:23:44,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,893 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-01-30 14:23:44,893 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,893 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,900 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,902 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,904 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:23:44,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:23:44,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:23:44,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:23:44,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (1/1) ... [2024-01-30 14:23:44,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:23:44,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:23:44,939 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-30 14:23:44,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-30 14:23:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:23:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:23:44,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:23:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:23:44,971 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:23:44,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:23:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:23:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:23:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:23:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:23:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:23:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:23:44,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:23:44,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:23:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:23:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:23:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:23:44,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:23:44,974 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-30 14:23:45,048 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:23:45,052 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:23:45,327 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:23:45,328 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:23:45,452 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:23:45,453 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-30 14:23:45,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:23:45 BoogieIcfgContainer [2024-01-30 14:23:45,454 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:23:45,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:23:45,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:23:45,459 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:23:45,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 30.01 02:23:43" (1/4) ... [2024-01-30 14:23:45,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321aba5f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:23:45, skipping insertion in model container [2024-01-30 14:23:45,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:23:44" (2/4) ... [2024-01-30 14:23:45,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321aba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:23:45, skipping insertion in model container [2024-01-30 14:23:45,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:44" (3/4) ... [2024-01-30 14:23:45,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@321aba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:23:45, skipping insertion in model container [2024-01-30 14:23:45,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:23:45" (4/4) ... [2024-01-30 14:23:45,462 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-01-30 14:23:45,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:23:45,475 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2024-01-30 14:23:45,475 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:23:45,543 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-30 14:23:45,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 61 transitions, 136 flow [2024-01-30 14:23:45,621 INFO L124 PetriNetUnfolderBase]: 3/59 cut-off events. [2024-01-30 14:23:45,622 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:23:45,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 59 events. 3/59 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 137 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2024-01-30 14:23:45,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 61 transitions, 136 flow [2024-01-30 14:23:45,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 128 flow [2024-01-30 14:23:45,638 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:23:45,666 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;@117d11f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:23:45,666 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-01-30 14:23:45,672 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:23:45,672 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:23:45,672 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:23:45,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:45,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:23:45,673 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:45,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:45,677 INFO L85 PathProgramCache]: Analyzing trace with hash 11643, now seen corresponding path program 1 times [2024-01-30 14:23:45,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:45,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437078793] [2024-01-30 14:23:45,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:45,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:46,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:46,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437078793] [2024-01-30 14:23:46,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437078793] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:46,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:46,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351880161] [2024-01-30 14:23:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:46,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:46,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:46,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:46,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 61 [2024-01-30 14:23:46,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:46,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 61 [2024-01-30 14:23:46,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:46,218 INFO L124 PetriNetUnfolderBase]: 221/479 cut-off events. [2024-01-30 14:23:46,218 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-01-30 14:23:46,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 479 events. 221/479 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2573 event pairs, 159 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 777. Up to 367 conditions per place. [2024-01-30 14:23:46,226 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 33 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-01-30 14:23:46,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 57 transitions, 196 flow [2024-01-30 14:23:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:46,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-01-30 14:23:46,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5901639344262295 [2024-01-30 14:23:46,237 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 128 flow. Second operand 3 states and 108 transitions. [2024-01-30 14:23:46,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 57 transitions, 196 flow [2024-01-30 14:23:46,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 57 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-30 14:23:46,245 INFO L231 Difference]: Finished difference. Result has 59 places, 57 transitions, 122 flow [2024-01-30 14:23:46,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=59, PETRI_TRANSITIONS=57} [2024-01-30 14:23:46,251 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-01-30 14:23:46,251 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 57 transitions, 122 flow [2024-01-30 14:23:46,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:46,252 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-30 14:23:46,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:23:46,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:46,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash 361289, now seen corresponding path program 1 times [2024-01-30 14:23:46,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:46,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358595749] [2024-01-30 14:23:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:46,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:46,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358595749] [2024-01-30 14:23:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358595749] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:46,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:23:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334610482] [2024-01-30 14:23:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:46,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:23:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:23:46,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:23:46,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 61 [2024-01-30 14:23:46,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 57 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:46,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 61 [2024-01-30 14:23:46,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:46,495 INFO L124 PetriNetUnfolderBase]: 190/445 cut-off events. [2024-01-30 14:23:46,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:23:46,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 445 events. 190/445 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2413 event pairs, 132 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 766. Up to 314 conditions per place. [2024-01-30 14:23:46,498 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 31 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-01-30 14:23:46,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 186 flow [2024-01-30 14:23:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2024-01-30 14:23:46,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6120218579234973 [2024-01-30 14:23:46,500 INFO L175 Difference]: Start difference. First operand has 59 places, 57 transitions, 122 flow. Second operand 3 states and 112 transitions. [2024-01-30 14:23:46,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 186 flow [2024-01-30 14:23:46,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:46,501 INFO L231 Difference]: Finished difference. Result has 58 places, 56 transitions, 120 flow [2024-01-30 14:23:46,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=58, PETRI_TRANSITIONS=56} [2024-01-30 14:23:46,512 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-01-30 14:23:46,512 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 56 transitions, 120 flow [2024-01-30 14:23:46,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:46,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:23:46,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:23:46,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:46,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash 11200357, now seen corresponding path program 1 times [2024-01-30 14:23:46,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:46,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667098586] [2024-01-30 14:23:46,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:46,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:46,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:46,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:46,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667098586] [2024-01-30 14:23:46,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667098586] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:46,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:46,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:23:46,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092041727] [2024-01-30 14:23:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:46,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:23:46,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:46,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:23:46,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:23:46,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 61 [2024-01-30 14:23:46,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 56 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:46,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 61 [2024-01-30 14:23:46,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:46,690 INFO L124 PetriNetUnfolderBase]: 149/370 cut-off events. [2024-01-30 14:23:46,691 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:23:46,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 370 events. 149/370 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2023 event pairs, 117 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 634. Up to 259 conditions per place. [2024-01-30 14:23:46,693 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 29 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-01-30 14:23:46,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 180 flow [2024-01-30 14:23:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:46,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-01-30 14:23:46,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2024-01-30 14:23:46,694 INFO L175 Difference]: Start difference. First operand has 58 places, 56 transitions, 120 flow. Second operand 3 states and 116 transitions. [2024-01-30 14:23:46,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 180 flow [2024-01-30 14:23:46,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:46,696 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 118 flow [2024-01-30 14:23:46,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2024-01-30 14:23:46,697 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2024-01-30 14:23:46,697 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 118 flow [2024-01-30 14:23:46,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:46,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:23:46,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:23:46,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:46,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:46,698 INFO L85 PathProgramCache]: Analyzing trace with hash 347211433, now seen corresponding path program 1 times [2024-01-30 14:23:46,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:46,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528238814] [2024-01-30 14:23:46,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:46,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:46,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:46,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528238814] [2024-01-30 14:23:46,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528238814] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:46,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:46,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:23:46,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037999359] [2024-01-30 14:23:46,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:46,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:23:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:46,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:23:46,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:23:46,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 61 [2024-01-30 14:23:46,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:46,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 61 [2024-01-30 14:23:46,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:46,830 INFO L124 PetriNetUnfolderBase]: 149/369 cut-off events. [2024-01-30 14:23:46,830 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:23:46,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 369 events. 149/369 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2020 event pairs, 117 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 630. Up to 257 conditions per place. [2024-01-30 14:23:46,832 INFO L140 encePairwiseOnDemand]: 58/61 looper letters, 28 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-01-30 14:23:46,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 176 flow [2024-01-30 14:23:46,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:46,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:46,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2024-01-30 14:23:46,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.644808743169399 [2024-01-30 14:23:46,833 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 118 flow. Second operand 3 states and 118 transitions. [2024-01-30 14:23:46,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 176 flow [2024-01-30 14:23:46,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:46,835 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 116 flow [2024-01-30 14:23:46,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-01-30 14:23:46,835 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2024-01-30 14:23:46,836 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 116 flow [2024-01-30 14:23:46,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:46,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:23:46,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:23:46,836 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:46,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2121347085, now seen corresponding path program 1 times [2024-01-30 14:23:46,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:46,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076918764] [2024-01-30 14:23:46,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:46,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:46,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:46,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076918764] [2024-01-30 14:23:46,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076918764] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:46,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:46,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:23:46,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618060101] [2024-01-30 14:23:46,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:46,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:23:46,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:23:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:23:46,887 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 61 [2024-01-30 14:23:46,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:46,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 61 [2024-01-30 14:23:46,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:46,974 INFO L124 PetriNetUnfolderBase]: 266/645 cut-off events. [2024-01-30 14:23:46,975 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-30 14:23:46,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 645 events. 266/645 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3871 event pairs, 102 based on Foata normal form. 0/551 useless extension candidates. Maximal degree in co-relation 1099. Up to 236 conditions per place. [2024-01-30 14:23:46,978 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 43 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2024-01-30 14:23:46,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 247 flow [2024-01-30 14:23:46,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:23:46,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:23:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2024-01-30 14:23:46,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6885245901639344 [2024-01-30 14:23:46,979 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 116 flow. Second operand 4 states and 168 transitions. [2024-01-30 14:23:46,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 247 flow [2024-01-30 14:23:46,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:46,981 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 132 flow [2024-01-30 14:23:46,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2024-01-30 14:23:46,982 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2024-01-30 14:23:46,982 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 132 flow [2024-01-30 14:23:46,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:46,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:46,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:46,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:23:46,983 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:46,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:46,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1337249807, now seen corresponding path program 1 times [2024-01-30 14:23:46,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:46,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462186484] [2024-01-30 14:23:46,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:46,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:47,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:47,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:47,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462186484] [2024-01-30 14:23:47,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462186484] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:47,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:47,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:23:47,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250662764] [2024-01-30 14:23:47,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:47,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:47,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:47,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:47,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:47,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-01-30 14:23:47,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:47,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-01-30 14:23:47,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:47,114 INFO L124 PetriNetUnfolderBase]: 405/971 cut-off events. [2024-01-30 14:23:47,114 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-01-30 14:23:47,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1795 conditions, 971 events. 405/971 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6153 event pairs, 91 based on Foata normal form. 10/892 useless extension candidates. Maximal degree in co-relation 619. Up to 503 conditions per place. [2024-01-30 14:23:47,119 INFO L140 encePairwiseOnDemand]: 53/61 looper letters, 40 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2024-01-30 14:23:47,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 267 flow [2024-01-30 14:23:47,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:47,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-01-30 14:23:47,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7595628415300546 [2024-01-30 14:23:47,120 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 132 flow. Second operand 3 states and 139 transitions. [2024-01-30 14:23:47,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 267 flow [2024-01-30 14:23:47,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 70 transitions, 265 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:23:47,122 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 159 flow [2024-01-30 14:23:47,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-01-30 14:23:47,123 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2024-01-30 14:23:47,123 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 159 flow [2024-01-30 14:23:47,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:47,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:47,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:23:47,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:47,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1494929295, now seen corresponding path program 1 times [2024-01-30 14:23:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:47,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317816541] [2024-01-30 14:23:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317816541] [2024-01-30 14:23:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317816541] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:47,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-30 14:23:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277088420] [2024-01-30 14:23:47,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:47,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:47,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-01-30 14:23:47,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:47,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-01-30 14:23:47,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:47,255 INFO L124 PetriNetUnfolderBase]: 616/1432 cut-off events. [2024-01-30 14:23:47,255 INFO L125 PetriNetUnfolderBase]: For 456/468 co-relation queries the response was YES. [2024-01-30 14:23:47,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2850 conditions, 1432 events. 616/1432 cut-off events. For 456/468 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9836 event pairs, 230 based on Foata normal form. 25/1333 useless extension candidates. Maximal degree in co-relation 1122. Up to 596 conditions per place. [2024-01-30 14:23:47,262 INFO L140 encePairwiseOnDemand]: 56/61 looper letters, 46 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-01-30 14:23:47,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 313 flow [2024-01-30 14:23:47,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-01-30 14:23:47,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7595628415300546 [2024-01-30 14:23:47,263 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 159 flow. Second operand 3 states and 139 transitions. [2024-01-30 14:23:47,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 313 flow [2024-01-30 14:23:47,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 73 transitions, 308 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-30 14:23:47,265 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 180 flow [2024-01-30 14:23:47,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-01-30 14:23:47,266 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -1 predicate places. [2024-01-30 14:23:47,266 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 180 flow [2024-01-30 14:23:47,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:47,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:47,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:23:47,267 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:47,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash 923164965, now seen corresponding path program 1 times [2024-01-30 14:23:47,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:47,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783733993] [2024-01-30 14:23:47,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:47,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:47,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:47,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:47,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783733993] [2024-01-30 14:23:47,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783733993] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:47,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:47,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:23:47,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158561017] [2024-01-30 14:23:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:47,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:23:47,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:47,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:23:47,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:23:47,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 61 [2024-01-30 14:23:47,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:47,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 61 [2024-01-30 14:23:47,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:47,452 INFO L124 PetriNetUnfolderBase]: 582/1274 cut-off events. [2024-01-30 14:23:47,453 INFO L125 PetriNetUnfolderBase]: For 936/942 co-relation queries the response was YES. [2024-01-30 14:23:47,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2860 conditions, 1274 events. 582/1274 cut-off events. For 936/942 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8020 event pairs, 58 based on Foata normal form. 160/1387 useless extension candidates. Maximal degree in co-relation 1023. Up to 906 conditions per place. [2024-01-30 14:23:47,459 INFO L140 encePairwiseOnDemand]: 52/61 looper letters, 38 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2024-01-30 14:23:47,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 58 transitions, 273 flow [2024-01-30 14:23:47,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:23:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:23:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2024-01-30 14:23:47,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5942622950819673 [2024-01-30 14:23:47,460 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 180 flow. Second operand 4 states and 145 transitions. [2024-01-30 14:23:47,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 58 transitions, 273 flow [2024-01-30 14:23:47,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:47,463 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 162 flow [2024-01-30 14:23:47,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-01-30 14:23:47,464 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -7 predicate places. [2024-01-30 14:23:47,464 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 162 flow [2024-01-30 14:23:47,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:47,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:47,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:23:47,464 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:47,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1897277441, now seen corresponding path program 1 times [2024-01-30 14:23:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050276016] [2024-01-30 14:23:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:47,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:47,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:47,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050276016] [2024-01-30 14:23:47,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050276016] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:47,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:47,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-30 14:23:47,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163945149] [2024-01-30 14:23:47,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:47,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-30 14:23:47,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:47,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-30 14:23:47,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-30 14:23:47,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 61 [2024-01-30 14:23:47,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:47,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 61 [2024-01-30 14:23:47,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:47,650 INFO L124 PetriNetUnfolderBase]: 597/1185 cut-off events. [2024-01-30 14:23:47,650 INFO L125 PetriNetUnfolderBase]: For 662/674 co-relation queries the response was YES. [2024-01-30 14:23:47,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2623 conditions, 1185 events. 597/1185 cut-off events. For 662/674 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 6856 event pairs, 58 based on Foata normal form. 173/1314 useless extension candidates. Maximal degree in co-relation 2588. Up to 816 conditions per place. [2024-01-30 14:23:47,655 INFO L140 encePairwiseOnDemand]: 54/61 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-01-30 14:23:47,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 341 flow [2024-01-30 14:23:47,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-30 14:23:47,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-30 14:23:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2024-01-30 14:23:47,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6516393442622951 [2024-01-30 14:23:47,657 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 162 flow. Second operand 4 states and 159 transitions. [2024-01-30 14:23:47,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 341 flow [2024-01-30 14:23:47,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:47,659 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 153 flow [2024-01-30 14:23:47,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2024-01-30 14:23:47,659 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -11 predicate places. [2024-01-30 14:23:47,659 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 153 flow [2024-01-30 14:23:47,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:47,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:47,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-30 14:23:47,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:47,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 310386829, now seen corresponding path program 1 times [2024-01-30 14:23:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:47,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603794357] [2024-01-30 14:23:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:47,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:47,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:47,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603794357] [2024-01-30 14:23:47,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603794357] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:47,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:47,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-30 14:23:47,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230605114] [2024-01-30 14:23:47,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:47,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:23:47,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:47,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:23:47,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:23:47,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-01-30 14:23:47,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:47,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:47,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-01-30 14:23:47,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:48,217 INFO L124 PetriNetUnfolderBase]: 1362/2614 cut-off events. [2024-01-30 14:23:48,218 INFO L125 PetriNetUnfolderBase]: For 1524/1560 co-relation queries the response was YES. [2024-01-30 14:23:48,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6041 conditions, 2614 events. 1362/2614 cut-off events. For 1524/1560 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 15892 event pairs, 173 based on Foata normal form. 36/2615 useless extension candidates. Maximal degree in co-relation 6007. Up to 760 conditions per place. [2024-01-30 14:23:48,226 INFO L140 encePairwiseOnDemand]: 51/61 looper letters, 113 selfloop transitions, 15 changer transitions 1/140 dead transitions. [2024-01-30 14:23:48,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 140 transitions, 732 flow [2024-01-30 14:23:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-30 14:23:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-30 14:23:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 364 transitions. [2024-01-30 14:23:48,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7459016393442623 [2024-01-30 14:23:48,228 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 153 flow. Second operand 8 states and 364 transitions. [2024-01-30 14:23:48,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 140 transitions, 732 flow [2024-01-30 14:23:48,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 140 transitions, 719 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:48,230 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 292 flow [2024-01-30 14:23:48,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=292, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2024-01-30 14:23:48,232 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2024-01-30 14:23:48,232 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 292 flow [2024-01-30 14:23:48,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:48,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:48,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:48,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-30 14:23:48,233 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:48,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:48,233 INFO L85 PathProgramCache]: Analyzing trace with hash -557027583, now seen corresponding path program 2 times [2024-01-30 14:23:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:48,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998557193] [2024-01-30 14:23:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:48,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998557193] [2024-01-30 14:23:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998557193] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-30 14:23:48,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216203958] [2024-01-30 14:23:48,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:48,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:23:48,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:48,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:23:48,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:23:48,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-01-30 14:23:48,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:48,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:48,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-01-30 14:23:48,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:48,853 INFO L124 PetriNetUnfolderBase]: 1698/3238 cut-off events. [2024-01-30 14:23:48,853 INFO L125 PetriNetUnfolderBase]: For 4755/4869 co-relation queries the response was YES. [2024-01-30 14:23:48,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8678 conditions, 3238 events. 1698/3238 cut-off events. For 4755/4869 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 20487 event pairs, 165 based on Foata normal form. 52/3253 useless extension candidates. Maximal degree in co-relation 8632. Up to 1005 conditions per place. [2024-01-30 14:23:48,868 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 106 selfloop transitions, 30 changer transitions 2/149 dead transitions. [2024-01-30 14:23:48,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 149 transitions, 924 flow [2024-01-30 14:23:48,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-30 14:23:48,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-30 14:23:48,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 369 transitions. [2024-01-30 14:23:48,870 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7561475409836066 [2024-01-30 14:23:48,870 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 292 flow. Second operand 8 states and 369 transitions. [2024-01-30 14:23:48,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 149 transitions, 924 flow [2024-01-30 14:23:48,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 149 transitions, 924 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-30 14:23:48,880 INFO L231 Difference]: Finished difference. Result has 75 places, 72 transitions, 551 flow [2024-01-30 14:23:48,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=551, PETRI_PLACES=75, PETRI_TRANSITIONS=72} [2024-01-30 14:23:48,881 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 13 predicate places. [2024-01-30 14:23:48,881 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 72 transitions, 551 flow [2024-01-30 14:23:48,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:48,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:48,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:48,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-30 14:23:48,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:48,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:48,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1740487829, now seen corresponding path program 3 times [2024-01-30 14:23:48,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:48,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907173135] [2024-01-30 14:23:48,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:48,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-30 14:23:48,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:48,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907173135] [2024-01-30 14:23:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907173135] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:48,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:48,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-30 14:23:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187836070] [2024-01-30 14:23:48,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:48,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-30 14:23:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:48,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-30 14:23:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-01-30 14:23:49,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 61 [2024-01-30 14:23:49,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 72 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:49,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:49,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 61 [2024-01-30 14:23:49,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:49,436 INFO L124 PetriNetUnfolderBase]: 2070/3968 cut-off events. [2024-01-30 14:23:49,436 INFO L125 PetriNetUnfolderBase]: For 11483/11613 co-relation queries the response was YES. [2024-01-30 14:23:49,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12011 conditions, 3968 events. 2070/3968 cut-off events. For 11483/11613 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 26675 event pairs, 259 based on Foata normal form. 68/3997 useless extension candidates. Maximal degree in co-relation 11952. Up to 1181 conditions per place. [2024-01-30 14:23:49,464 INFO L140 encePairwiseOnDemand]: 50/61 looper letters, 112 selfloop transitions, 43 changer transitions 1/167 dead transitions. [2024-01-30 14:23:49,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 167 transitions, 1304 flow [2024-01-30 14:23:49,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-01-30 14:23:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-01-30 14:23:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 370 transitions. [2024-01-30 14:23:49,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7581967213114754 [2024-01-30 14:23:49,466 INFO L175 Difference]: Start difference. First operand has 75 places, 72 transitions, 551 flow. Second operand 8 states and 370 transitions. [2024-01-30 14:23:49,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 167 transitions, 1304 flow [2024-01-30 14:23:49,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 167 transitions, 1288 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-01-30 14:23:49,491 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 910 flow [2024-01-30 14:23:49,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=61, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=910, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2024-01-30 14:23:49,492 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 24 predicate places. [2024-01-30 14:23:49,492 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 910 flow [2024-01-30 14:23:49,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:49,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:49,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:49,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-30 14:23:49,493 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (and 33 more)] === [2024-01-30 14:23:49,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash 854038073, now seen corresponding path program 1 times [2024-01-30 14:23:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947673654] [2024-01-30 14:23:49,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:49,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:23:49,505 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:23:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:23:49,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:23:49,535 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:23:49,535 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (35 of 36 remaining) [2024-01-30 14:23:49,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (34 of 36 remaining) [2024-01-30 14:23:49,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (33 of 36 remaining) [2024-01-30 14:23:49,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (32 of 36 remaining) [2024-01-30 14:23:49,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (31 of 36 remaining) [2024-01-30 14:23:49,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (30 of 36 remaining) [2024-01-30 14:23:49,537 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (29 of 36 remaining) [2024-01-30 14:23:49,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 36 remaining) [2024-01-30 14:23:49,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 36 remaining) [2024-01-30 14:23:49,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 36 remaining) [2024-01-30 14:23:49,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 36 remaining) [2024-01-30 14:23:49,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 36 remaining) [2024-01-30 14:23:49,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 36 remaining) [2024-01-30 14:23:49,538 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 36 remaining) [2024-01-30 14:23:49,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 36 remaining) [2024-01-30 14:23:49,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 36 remaining) [2024-01-30 14:23:49,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 36 remaining) [2024-01-30 14:23:49,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 36 remaining) [2024-01-30 14:23:49,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 36 remaining) [2024-01-30 14:23:49,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 36 remaining) [2024-01-30 14:23:49,539 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 36 remaining) [2024-01-30 14:23:49,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2024-01-30 14:23:49,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2024-01-30 14:23:49,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2024-01-30 14:23:49,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 36 remaining) [2024-01-30 14:23:49,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (10 of 36 remaining) [2024-01-30 14:23:49,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err7ASSERT_VIOLATIONWITNESS_INVARIANT (9 of 36 remaining) [2024-01-30 14:23:49,540 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (8 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err5ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err6ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 36 remaining) [2024-01-30 14:23:49,541 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 36 remaining) [2024-01-30 14:23:49,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-30 14:23:49,542 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:49,547 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:23:49,547 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:23:49,590 INFO L503 ceAbstractionStarter]: Automizer considered 20 witness invariants [2024-01-30 14:23:49,590 INFO L504 ceAbstractionStarter]: WitnessConsidered=20 [2024-01-30 14:23:49,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:23:49 BasicIcfg [2024-01-30 14:23:49,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:23:49,591 INFO L158 Benchmark]: Toolchain (without parser) took 5072.94ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 171.6MB in the beginning and 104.3MB in the end (delta: 67.3MB). Peak memory consumption was 167.2MB. Max. memory is 16.1GB. [2024-01-30 14:23:49,591 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 136.3MB. Free memory was 101.6MB in the beginning and 101.4MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:23:49,592 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:23:49,593 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.07ms. Allocated memory is still 201.3MB. Free memory was 171.6MB in the beginning and 156.2MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-30 14:23:49,593 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.43ms. Allocated memory is still 201.3MB. Free memory was 156.2MB in the beginning and 154.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:23:49,593 INFO L158 Benchmark]: Boogie Preprocessor took 34.11ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:23:49,594 INFO L158 Benchmark]: RCFGBuilder took 548.48ms. Allocated memory is still 201.3MB. Free memory was 152.0MB in the beginning and 112.4MB in the end (delta: 39.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-01-30 14:23:49,594 INFO L158 Benchmark]: TraceAbstraction took 4134.68ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 112.2MB in the beginning and 104.3MB in the end (delta: 7.8MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2024-01-30 14:23:49,595 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.15ms. Allocated memory is still 136.3MB. Free memory was 101.6MB in the beginning and 101.4MB in the end (delta: 141.4kB). There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 105.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.07ms. Allocated memory is still 201.3MB. Free memory was 171.6MB in the beginning and 156.2MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.43ms. Allocated memory is still 201.3MB. Free memory was 156.2MB in the beginning and 154.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.11ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 152.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.48ms. Allocated memory is still 201.3MB. Free memory was 152.0MB in the beginning and 112.4MB in the end (delta: 39.6MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4134.68ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 112.2MB in the beginning and 104.3MB in the end (delta: 7.8MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 41]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L36] 0 int n, m, i1, i2, j1; [L37] 0 unsigned int k1, k2; [L60] 0 pthread_t t1, t2; VAL [i1=0, i2=0, j1=0, k1=0, k2=0, m=0, n=0, t1={3:0}, t2={5:0}] [L63] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[n],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L63] 0 n = __VERIFIER_nondet_int() [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[m],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L64] 0 m = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L65] 0 i1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHPLUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,BinaryExpression[ARITHMINUS,IntegerLiteral[0LL],CastExpression[ACSLType[long long],IdentifierExpression[i2]]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPGEQ,BinaryExpression[ARITHMINUS,CastExpression[ACSLType[long long],IdentifierExpression[i2]],CastExpression[ACSLType[long long],IdentifierExpression[j1]]],IntegerLiteral[0LL]]],BinaryExpression[COMPEQ,IdentifierExpression[i2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L66] 0 i2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[j1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L67] 0 j1 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[k1],IntegerLiteral[0U]],BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]]] [L68] 0 k1 = __VERIFIER_nondet_uint() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] [L69] 0 k2 = __VERIFIER_nondet_uint() [L72] CALL 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L33] COND FALSE 0 !(!cond) [L72] RET 0 assume_abort_if_not( i1 == i2 && i1 == k1 && i1 == k2 && i1 == 0 ) [L73] CALL 0 assume_abort_if_not( m >= 0 ) [L33] COND FALSE 0 !(!cond) [L73] RET 0 assume_abort_if_not( m >= 0 ) [L75] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [_argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L40] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L40] COND TRUE 1 i1 < n [L41] 1 j1 = 0 VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L41] COND TRUE 1 j1 < m VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=0, k1=0, k2=0, m=1, n=1] [L42] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L42] 1 k1++ [L41] 1 j1++ VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L41] COND FALSE 1 !(j1 < m) VAL [_argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L76] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1, t1={3:0}, t2={5:0}] [L51] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L51] COND TRUE 2 i2 < n VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=0, m=1, n=1] [L52] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,CastExpression[ACSLType[unsigned long],IdentifierExpression[_argptr]],IntegerLiteral[0UL]]]] [L52] 2 k2 = k2 + m VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] [L41] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[k2],IntegerLiteral[0U]]]] VAL [_argptr={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, i1=0, i2=0, j1=1, k1=1, k2=1, m=1, n=1] - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 56]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 53]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 63]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 64]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 67]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 68]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 81]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 75]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 76]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 94 locations, 36 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: 4.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 873 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 706 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1497 IncrementalHoareTripleChecker+Invalid, 1594 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 30 mSDtfsCounter, 1497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=910occurred in iteration=12, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 1318 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-01-30 14:23:49,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE