./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.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/chl-simpl-str-trans.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/chl-simpl-str-trans.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/chl-simpl-str-trans.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:34,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-30 14:23:34,117 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:34,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-30 14:23:34,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-30 14:23:34,145 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-30 14:23:34,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-30 14:23:34,146 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-30 14:23:34,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-30 14:23:34,151 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-30 14:23:34,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-30 14:23:34,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-30 14:23:34,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-30 14:23:34,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-30 14:23:34,154 INFO L153 SettingsManager]: * Use SBE=true [2024-01-30 14:23:34,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-30 14:23:34,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-30 14:23:34,155 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-30 14:23:34,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-30 14:23:34,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-30 14:23:34,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-30 14:23:34,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-30 14:23:34,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-30 14:23:34,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-30 14:23:34,156 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-30 14:23:34,156 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-30 14:23:34,157 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-30 14:23:34,157 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-30 14:23:34,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-30 14:23:34,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-30 14:23:34,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-30 14:23:34,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-30 14:23:34,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:23:34,159 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-30 14:23:34,159 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-30 14:23:34,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-30 14:23:34,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-30 14:23:34,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-30 14:23:34,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-30 14:23:34,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-30 14:23:34,160 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-30 14:23:34,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-30 14:23:34,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-30 14:23:34,161 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:34,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-30 14:23:34,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-30 14:23:34,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-30 14:23:34,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-30 14:23:34,348 INFO L274 PluginConnector]: CDTParser initialized [2024-01-30 14:23:34,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-30 14:23:35,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-30 14:23:35,469 INFO L384 CDTParser]: Found 1 translation units. [2024-01-30 14:23:35,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2024-01-30 14:23:35,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe50f07c4/3eb8066115b04f42a4745d13afca20db/FLAG1d2f4edbd [2024-01-30 14:23:35,484 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe50f07c4/3eb8066115b04f42a4745d13afca20db [2024-01-30 14:23:35,486 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-30 14:23:35,486 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-30 14:23:35,487 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/chl-simpl-str-trans.wvr.yml/witness.yml [2024-01-30 14:23:35,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-30 14:23:35,602 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-30 14:23:35,603 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-30 14:23:35,603 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-30 14:23:35,606 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-30 14:23:35,607 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:23:35" (1/2) ... [2024-01-30 14:23:35,608 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d4db38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:35, skipping insertion in model container [2024-01-30 14:23:35,608 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:23:35" (1/2) ... [2024-01-30 14:23:35,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2245c532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:23:35, skipping insertion in model container [2024-01-30 14:23:35,610 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:35" (2/2) ... [2024-01-30 14:23:35,610 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d4db38 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35, skipping insertion in model container [2024-01-30 14:23:35,610 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:35" (2/2) ... [2024-01-30 14:23:35,610 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-30 14:23:35,636 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-30 14:23:35,637 INFO L98 nessWitnessExtractor]: Location invariant before [L51-L51] (unsigned long )_argptr == 0UL [2024-01-30 14:23:35,637 INFO L98 nessWitnessExtractor]: Location invariant before [L57-L57] (unsigned long )_argptr == 0UL [2024-01-30 14:23:35,637 INFO L98 nessWitnessExtractor]: Location invariant before [L87-L87] (b <= -1) && (b != 0) [2024-01-30 14:23:35,637 INFO L98 nessWitnessExtractor]: Location invariant before [L45-L45] (unsigned long )_argptr == 0UL [2024-01-30 14:23:35,638 INFO L98 nessWitnessExtractor]: Location invariant before [L65-L65] (((((((to_int_1 == 0) && (length_2 == 0)) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,638 INFO L98 nessWitnessExtractor]: Location invariant before [L64-L64] ((((((((length_0 == 0) && (to_int_1 == 0)) && (length_2 == 0)) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,638 INFO L98 nessWitnessExtractor]: Location invariant before [L69-L69] (((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,639 INFO L98 nessWitnessExtractor]: Location invariant before [L72-L72] ((result_6 == 0) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,639 INFO L98 nessWitnessExtractor]: Location invariant before [L66-L66] ((((((length_2 == 0) && (to_int_3 == 0)) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,639 INFO L98 nessWitnessExtractor]: Location invariant before [L67-L67] (((((to_int_3 == 0) && (length_4 == 0)) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,639 INFO L98 nessWitnessExtractor]: Location invariant before [L86-L86] (1 <= b) && (b != 0) [2024-01-30 14:23:35,639 INFO L98 nessWitnessExtractor]: Location invariant before [L68-L68] ((((length_4 == 0) && (to_int_5 == 0)) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,639 INFO L98 nessWitnessExtractor]: Location invariant before [L22-L25] (((to_int_5 == 0) && (result_6 == 0)) && (result_7 == 0)) && (result_8 == 0) [2024-01-30 14:23:35,657 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-30 14:23:35,785 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/chl-simpl-str-trans.wvr.c[2553,2566] [2024-01-30 14:23:35,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:23:35,803 INFO L202 MainTranslator]: Completed pre-run [2024-01-30 14:23:35,811 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 [2024-01-30 14:23:35,851 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/chl-simpl-str-trans.wvr.c[2553,2566] Start Parsing Local Start Parsing Local [2024-01-30 14:23:35,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-30 14:23:35,869 INFO L206 MainTranslator]: Completed translation [2024-01-30 14:23:35,869 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35 WrapperNode [2024-01-30 14:23:35,870 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-30 14:23:35,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-30 14:23:35,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-30 14:23:35,871 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-30 14:23:35,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,906 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 187 [2024-01-30 14:23:35,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-30 14:23:35,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-30 14:23:35,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-30 14:23:35,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-30 14:23:35,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,924 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,949 INFO L175 MemorySlicer]: Split 8 memory accesses to 4 slices as follows [2, 2, 2, 2]. 25 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-01-30 14:23:35,950 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,956 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,958 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-30 14:23:35,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-30 14:23:35,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-30 14:23:35,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-30 14:23:35,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (1/1) ... [2024-01-30 14:23:35,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-30 14:23:35,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-30 14:23:36,004 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:36,024 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:36,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-30 14:23:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-30 14:23:36,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-30 14:23:36,040 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-30 14:23:36,040 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-30 14:23:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-30 14:23:36,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-30 14:23:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-30 14:23:36,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-30 14:23:36,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-30 14:23:36,043 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-30 14:23:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-30 14:23:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-30 14:23:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-30 14:23:36,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-30 14:23:36,046 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:36,166 INFO L244 CfgBuilder]: Building ICFG [2024-01-30 14:23:36,168 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-30 14:23:36,439 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-30 14:23:36,440 INFO L293 CfgBuilder]: Performing block encoding [2024-01-30 14:23:36,659 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-30 14:23:36,659 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-30 14:23:36,659 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:23:36 BoogieIcfgContainer [2024-01-30 14:23:36,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-30 14:23:36,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-30 14:23:36,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-30 14:23:36,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-30 14:23:36,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:23:35" (1/4) ... [2024-01-30 14:23:36,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c561ffe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:23:36, skipping insertion in model container [2024-01-30 14:23:36,665 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:35" (2/4) ... [2024-01-30 14:23:36,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c561ffe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:23:36, skipping insertion in model container [2024-01-30 14:23:36,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 30.01 02:23:35" (3/4) ... [2024-01-30 14:23:36,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c561ffe and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 30.01 02:23:36, skipping insertion in model container [2024-01-30 14:23:36,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:23:36" (4/4) ... [2024-01-30 14:23:36,667 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2024-01-30 14:23:36,680 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-30 14:23:36,681 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-01-30 14:23:36,681 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-30 14:23:36,760 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-30 14:23:36,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 71 transitions, 163 flow [2024-01-30 14:23:36,833 INFO L124 PetriNetUnfolderBase]: 6/68 cut-off events. [2024-01-30 14:23:36,834 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-30 14:23:36,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 68 events. 6/68 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 161 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-01-30 14:23:36,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 71 transitions, 163 flow [2024-01-30 14:23:36,842 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 67 transitions, 152 flow [2024-01-30 14:23:36,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-30 14:23:36,853 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;@62e55dd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-30 14:23:36,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-01-30 14:23:36,856 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-30 14:23:36,856 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2024-01-30 14:23:36,856 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-01-30 14:23:36,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:36,857 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-01-30 14:23:36,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:36,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 17270, now seen corresponding path program 1 times [2024-01-30 14:23:36,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:36,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225405276] [2024-01-30 14:23:36,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:37,148 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:37,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:37,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225405276] [2024-01-30 14:23:37,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225405276] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:37,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:37,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973146155] [2024-01-30 14:23:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:37,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:37,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:37,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:37,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 71 [2024-01-30 14:23:37,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:37,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:37,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 71 [2024-01-30 14:23:37,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:37,677 INFO L124 PetriNetUnfolderBase]: 3281/5193 cut-off events. [2024-01-30 14:23:37,677 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2024-01-30 14:23:37,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9850 conditions, 5193 events. 3281/5193 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 32308 event pairs, 2653 based on Foata normal form. 0/4258 useless extension candidates. Maximal degree in co-relation 8903. Up to 4433 conditions per place. [2024-01-30 14:23:37,715 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2024-01-30 14:23:37,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 66 transitions, 250 flow [2024-01-30 14:23:37,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-01-30 14:23:37,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070422535211268 [2024-01-30 14:23:37,730 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 152 flow. Second operand 3 states and 108 transitions. [2024-01-30 14:23:37,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 66 transitions, 250 flow [2024-01-30 14:23:37,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 238 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-30 14:23:37,745 INFO L231 Difference]: Finished difference. Result has 66 places, 66 transitions, 142 flow [2024-01-30 14:23:37,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=66, PETRI_TRANSITIONS=66} [2024-01-30 14:23:37,750 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2024-01-30 14:23:37,750 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 66 transitions, 142 flow [2024-01-30 14:23:37,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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:37,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:37,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-01-30 14:23:37,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-30 14:23:37,752 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:37,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash 535947, now seen corresponding path program 1 times [2024-01-30 14:23:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:37,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810995059] [2024-01-30 14:23:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:37,918 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:37,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:37,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810995059] [2024-01-30 14:23:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810995059] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:37,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879769775] [2024-01-30 14:23:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:37,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:37,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:37,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:37,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-01-30 14:23:37,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:37,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:37,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-01-30 14:23:37,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:38,220 INFO L124 PetriNetUnfolderBase]: 2495/4005 cut-off events. [2024-01-30 14:23:38,221 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-01-30 14:23:38,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7562 conditions, 4005 events. 2495/4005 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 25862 event pairs, 2051 based on Foata normal form. 0/3391 useless extension candidates. Maximal degree in co-relation 7553. Up to 3487 conditions per place. [2024-01-30 14:23:38,249 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 45 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2024-01-30 14:23:38,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 234 flow [2024-01-30 14:23:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2024-01-30 14:23:38,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5352112676056338 [2024-01-30 14:23:38,252 INFO L175 Difference]: Start difference. First operand has 66 places, 66 transitions, 142 flow. Second operand 3 states and 114 transitions. [2024-01-30 14:23:38,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 234 flow [2024-01-30 14:23:38,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:38,254 INFO L231 Difference]: Finished difference. Result has 65 places, 65 transitions, 140 flow [2024-01-30 14:23:38,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=65, PETRI_TRANSITIONS=65} [2024-01-30 14:23:38,254 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -6 predicate places. [2024-01-30 14:23:38,255 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 65 transitions, 140 flow [2024-01-30 14:23:38,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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:38,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:38,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-01-30 14:23:38,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-30 14:23:38,255 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:38,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash 16614900, now seen corresponding path program 1 times [2024-01-30 14:23:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814075144] [2024-01-30 14:23:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:38,309 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:38,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814075144] [2024-01-30 14:23:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814075144] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:38,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:38,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532028066] [2024-01-30 14:23:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:38,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:38,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:38,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:38,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 71 [2024-01-30 14:23:38,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 65 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:38,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:38,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 71 [2024-01-30 14:23:38,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:38,588 INFO L124 PetriNetUnfolderBase]: 2495/4004 cut-off events. [2024-01-30 14:23:38,588 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-01-30 14:23:38,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7560 conditions, 4004 events. 2495/4004 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 25946 event pairs, 2051 based on Foata normal form. 0/3391 useless extension candidates. Maximal degree in co-relation 7549. Up to 3485 conditions per place. [2024-01-30 14:23:38,608 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 44 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-01-30 14:23:38,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 64 transitions, 230 flow [2024-01-30 14:23:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2024-01-30 14:23:38,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5446009389671361 [2024-01-30 14:23:38,612 INFO L175 Difference]: Start difference. First operand has 65 places, 65 transitions, 140 flow. Second operand 3 states and 116 transitions. [2024-01-30 14:23:38,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 64 transitions, 230 flow [2024-01-30 14:23:38,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:38,614 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 138 flow [2024-01-30 14:23:38,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2024-01-30 14:23:38,615 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -7 predicate places. [2024-01-30 14:23:38,615 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 138 flow [2024-01-30 14:23:38,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:38,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:38,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-01-30 14:23:38,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-30 14:23:38,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:38,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:38,617 INFO L85 PathProgramCache]: Analyzing trace with hash 515062455, now seen corresponding path program 1 times [2024-01-30 14:23:38,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:38,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107663685] [2024-01-30 14:23:38,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:38,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:38,675 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:38,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107663685] [2024-01-30 14:23:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107663685] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:38,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:38,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:38,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889084064] [2024-01-30 14:23:38,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:38,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:38,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 71 [2024-01-30 14:23:38,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:38,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:38,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 71 [2024-01-30 14:23:38,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:38,896 INFO L124 PetriNetUnfolderBase]: 2161/3504 cut-off events. [2024-01-30 14:23:38,896 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-30 14:23:38,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6625 conditions, 3504 events. 2161/3504 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23145 event pairs, 1782 based on Foata normal form. 0/3065 useless extension candidates. Maximal degree in co-relation 6612. Up to 3056 conditions per place. [2024-01-30 14:23:38,913 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 42 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-01-30 14:23:38,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 224 flow [2024-01-30 14:23:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2024-01-30 14:23:38,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5633802816901409 [2024-01-30 14:23:38,915 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 138 flow. Second operand 3 states and 120 transitions. [2024-01-30 14:23:38,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 224 flow [2024-01-30 14:23:38,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:38,917 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 136 flow [2024-01-30 14:23:38,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2024-01-30 14:23:38,919 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -8 predicate places. [2024-01-30 14:23:38,919 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 136 flow [2024-01-30 14:23:38,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-30 14:23:38,919 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:38,919 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-01-30 14:23:38,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-30 14:23:38,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:38,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:38,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1212932516, now seen corresponding path program 1 times [2024-01-30 14:23:38,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:38,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591671746] [2024-01-30 14:23:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:38,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:38,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:38,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591671746] [2024-01-30 14:23:38,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591671746] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:38,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:38,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:38,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693607029] [2024-01-30 14:23:38,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:38,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:38,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:38,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:38,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:38,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 71 [2024-01-30 14:23:38,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:38,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:38,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 71 [2024-01-30 14:23:38,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:39,212 INFO L124 PetriNetUnfolderBase]: 2161/3503 cut-off events. [2024-01-30 14:23:39,213 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-30 14:23:39,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6623 conditions, 3503 events. 2161/3503 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23125 event pairs, 1782 based on Foata normal form. 0/3065 useless extension candidates. Maximal degree in co-relation 6608. Up to 3054 conditions per place. [2024-01-30 14:23:39,226 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 41 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2024-01-30 14:23:39,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 220 flow [2024-01-30 14:23:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2024-01-30 14:23:39,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5727699530516432 [2024-01-30 14:23:39,227 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 136 flow. Second operand 3 states and 122 transitions. [2024-01-30 14:23:39,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 220 flow [2024-01-30 14:23:39,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:39,228 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 134 flow [2024-01-30 14:23:39,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-01-30 14:23:39,230 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -9 predicate places. [2024-01-30 14:23:39,230 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 134 flow [2024-01-30 14:23:39,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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:39,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:39,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:39,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-30 14:23:39,230 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:39,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:39,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1053798192, now seen corresponding path program 1 times [2024-01-30 14:23:39,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:39,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123665397] [2024-01-30 14:23:39,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:39,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:39,276 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:39,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:39,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123665397] [2024-01-30 14:23:39,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123665397] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:39,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:39,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:39,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693854921] [2024-01-30 14:23:39,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:39,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:39,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:39,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:39,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:39,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 71 [2024-01-30 14:23:39,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:39,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:39,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 71 [2024-01-30 14:23:39,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:39,503 INFO L124 PetriNetUnfolderBase]: 2161/3502 cut-off events. [2024-01-30 14:23:39,504 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-01-30 14:23:39,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 3502 events. 2161/3502 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 23074 event pairs, 1782 based on Foata normal form. 0/3065 useless extension candidates. Maximal degree in co-relation 6604. Up to 3052 conditions per place. [2024-01-30 14:23:39,518 INFO L140 encePairwiseOnDemand]: 68/71 looper letters, 40 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2024-01-30 14:23:39,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 216 flow [2024-01-30 14:23:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:39,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2024-01-30 14:23:39,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5821596244131455 [2024-01-30 14:23:39,520 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 134 flow. Second operand 3 states and 124 transitions. [2024-01-30 14:23:39,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 216 flow [2024-01-30 14:23:39,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:39,521 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 132 flow [2024-01-30 14:23:39,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-01-30 14:23:39,522 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2024-01-30 14:23:39,522 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 132 flow [2024-01-30 14:23:39,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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:39,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:39,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:39,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-30 14:23:39,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:39,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:39,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1691993841, now seen corresponding path program 1 times [2024-01-30 14:23:39,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:39,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664555149] [2024-01-30 14:23:39,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:39,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-30 14:23:39,549 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:39,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-30 14:23:39,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664555149] [2024-01-30 14:23:39,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664555149] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-30 14:23:39,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-30 14:23:39,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-01-30 14:23:39,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220398720] [2024-01-30 14:23:39,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-30 14:23:39,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-30 14:23:39,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-30 14:23:39,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-30 14:23:39,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-30 14:23:39,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 71 [2024-01-30 14:23:39,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:39,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-30 14:23:39,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 71 [2024-01-30 14:23:39,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-30 14:23:39,769 INFO L124 PetriNetUnfolderBase]: 2157/3518 cut-off events. [2024-01-30 14:23:39,769 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-01-30 14:23:39,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6636 conditions, 3518 events. 2157/3518 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 23701 event pairs, 712 based on Foata normal form. 0/3101 useless extension candidates. Maximal degree in co-relation 6617. Up to 2003 conditions per place. [2024-01-30 14:23:39,782 INFO L140 encePairwiseOnDemand]: 66/71 looper letters, 60 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2024-01-30 14:23:39,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 306 flow [2024-01-30 14:23:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-30 14:23:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-30 14:23:39,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2024-01-30 14:23:39,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2024-01-30 14:23:39,784 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 132 flow. Second operand 3 states and 149 transitions. [2024-01-30 14:23:39,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 306 flow [2024-01-30 14:23:39,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 302 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-30 14:23:39,786 INFO L231 Difference]: Finished difference. Result has 61 places, 63 transitions, 150 flow [2024-01-30 14:23:39,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=61, PETRI_TRANSITIONS=63} [2024-01-30 14:23:39,786 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2024-01-30 14:23:39,786 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 63 transitions, 150 flow [2024-01-30 14:23:39,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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:39,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-30 14:23:39,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:39,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-30 14:23:39,787 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (and 26 more)] === [2024-01-30 14:23:39,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-30 14:23:39,787 INFO L85 PathProgramCache]: Analyzing trace with hash -305575867, now seen corresponding path program 1 times [2024-01-30 14:23:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-30 14:23:39,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335746084] [2024-01-30 14:23:39,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-30 14:23:39,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-30 14:23:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:23:39,802 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-01-30 14:23:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-01-30 14:23:39,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-01-30 14:23:39,830 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-01-30 14:23:39,831 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (28 of 29 remaining) [2024-01-30 14:23:39,832 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (27 of 29 remaining) [2024-01-30 14:23:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (26 of 29 remaining) [2024-01-30 14:23:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (25 of 29 remaining) [2024-01-30 14:23:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (24 of 29 remaining) [2024-01-30 14:23:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (23 of 29 remaining) [2024-01-30 14:23:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (22 of 29 remaining) [2024-01-30 14:23:39,833 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (21 of 29 remaining) [2024-01-30 14:23:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (20 of 29 remaining) [2024-01-30 14:23:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (19 of 29 remaining) [2024-01-30 14:23:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (18 of 29 remaining) [2024-01-30 14:23:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (17 of 29 remaining) [2024-01-30 14:23:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (16 of 29 remaining) [2024-01-30 14:23:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONWITNESS_INVARIANT (15 of 29 remaining) [2024-01-30 14:23:39,834 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONWITNESS_INVARIANT (14 of 29 remaining) [2024-01-30 14:23:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONWITNESS_INVARIANT (13 of 29 remaining) [2024-01-30 14:23:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONWITNESS_INVARIANT (12 of 29 remaining) [2024-01-30 14:23:39,835 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2024-01-30 14:23:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 29 remaining) [2024-01-30 14:23:39,836 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 29 remaining) [2024-01-30 14:23:39,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 29 remaining) [2024-01-30 14:23:39,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 29 remaining) [2024-01-30 14:23:39,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 29 remaining) [2024-01-30 14:23:39,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 29 remaining) [2024-01-30 14:23:39,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 29 remaining) [2024-01-30 14:23:39,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 29 remaining) [2024-01-30 14:23:39,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 29 remaining) [2024-01-30 14:23:39,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 29 remaining) [2024-01-30 14:23:39,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 29 remaining) [2024-01-30 14:23:39,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-30 14:23:39,841 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-01-30 14:23:39,846 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-30 14:23:39,846 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-30 14:23:39,881 INFO L503 ceAbstractionStarter]: Automizer considered 16 witness invariants [2024-01-30 14:23:39,881 INFO L504 ceAbstractionStarter]: WitnessConsidered=16 [2024-01-30 14:23:39,882 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:23:39 BasicIcfg [2024-01-30 14:23:39,882 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-30 14:23:39,883 INFO L158 Benchmark]: Toolchain (without parser) took 4281.32ms. Allocated memory was 125.8MB in the beginning and 467.7MB in the end (delta: 341.8MB). Free memory was 99.0MB in the beginning and 143.7MB in the end (delta: -44.7MB). Peak memory consumption was 298.0MB. Max. memory is 16.1GB. [2024-01-30 14:23:39,884 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:23:39,884 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-30 14:23:39,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.23ms. Allocated memory is still 125.8MB. Free memory was 98.8MB in the beginning and 83.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-01-30 14:23:39,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.47ms. Allocated memory is still 125.8MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:23:39,885 INFO L158 Benchmark]: Boogie Preprocessor took 70.21ms. Allocated memory is still 125.8MB. Free memory was 81.4MB in the beginning and 78.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-30 14:23:39,885 INFO L158 Benchmark]: RCFGBuilder took 681.56ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 78.7MB in the beginning and 139.5MB in the end (delta: -60.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-01-30 14:23:39,887 INFO L158 Benchmark]: TraceAbstraction took 3221.57ms. Allocated memory was 184.5MB in the beginning and 467.7MB in the end (delta: 283.1MB). Free memory was 138.5MB in the beginning and 143.7MB in the end (delta: -5.3MB). Peak memory consumption was 281.0MB. Max. memory is 16.1GB. [2024-01-30 14:23:39,888 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.23ms. Allocated memory is still 125.8MB. Free memory was 98.8MB in the beginning and 83.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.47ms. Allocated memory is still 125.8MB. Free memory was 83.5MB in the beginning and 81.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.21ms. Allocated memory is still 125.8MB. Free memory was 81.4MB in the beginning and 78.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 681.56ms. Allocated memory was 125.8MB in the beginning and 184.5MB in the end (delta: 58.7MB). Free memory was 78.7MB in the beginning and 139.5MB in the end (delta: -60.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3221.57ms. Allocated memory was 184.5MB in the beginning and 467.7MB in the end (delta: 283.1MB). Free memory was 138.5MB in the beginning and 143.7MB in the end (delta: -5.3MB). Peak memory consumption was 281.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 86]: invariant of correctness witness can be violated invariant of correctness witness can be violated We found a FailurePath: [L38] 0 int length_0, to_int_1, length_2, to_int_3, length_4, to_int_5, result_6, result_7, result_8; [L61] 0 pthread_t t1, t2, t3; VAL [length_0=0, length_2=0, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=0, to_int_3=0, to_int_5=0] [L64] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_0],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L64] 0 length_0 = __VERIFIER_nondet_int() [L65] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_1],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L65] 0 to_int_1 = __VERIFIER_nondet_int() [L66] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_2],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L66] 0 length_2 = __VERIFIER_nondet_int() [L67] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_3],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L67] 0 to_int_3 = __VERIFIER_nondet_int() [L68] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[length_4],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L68] 0 length_4 = __VERIFIER_nondet_int() [L69] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[to_int_5],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L69] 0 to_int_5 = __VERIFIER_nondet_int() [L72] 0 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[LOGICAND,BinaryExpression[COMPEQ,IdentifierExpression[result_6],IntegerLiteral[0]],BinaryExpression[COMPEQ,IdentifierExpression[result_7],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[result_8],IntegerLiteral[0]]]]] [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, t1={5:0}, t2={6:0}, t3={3:0}, to_int_1=-2, to_int_3=0, to_int_5=0] [L43] 1 length_0 == 0 ? (length_2 == 0 ? 0 : 1) : (length_2 == 0 ? -1 : minus(to_int_1, to_int_3)) VAL [_argptr={0:0}, _argptr={0:0}, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=-2, to_int_3=0, to_int_5=0] [L43] 1 length_2 == 0 ? -1 : minus(to_int_1, to_int_3) [L43] CALL 1 minus(to_int_1, to_int_3) [L86] 1 CodeAnnotStmt[Assertion[BinaryExpression[LOGICAND,BinaryExpression[COMPLEQ,IntegerLiteral[1],IdentifierExpression[b]],BinaryExpression[COMPNEQ,IdentifierExpression[b],IntegerLiteral[0]]]]] VAL [\old(a)=-2, \old(b)=0, a=-2, b=0, length_0=1, length_2=1, length_4=0, result_6=0, result_7=0, result_8=0, to_int_1=-2, to_int_3=0, to_int_5=0] - UnprovableResult [Line: 45]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: 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: 87]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 86]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 87]: 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: 72]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 80]: 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: 74]: 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: 72]: 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: 73]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 105 locations, 29 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: 3.1s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 141 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 617 IncrementalHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 25 mSDtfsCounter, 617 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=0, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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:39,909 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