./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/arithmetic_prog_bad.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i ./goblint.2024-06-19_11-23-25.files/protection/arithmetic_prog_bad.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 19:12:16,340 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 19:12:16,412 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 19:12:16,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 19:12:16,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 19:12:16,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 19:12:16,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 19:12:16,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 19:12:16,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 19:12:16,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 19:12:16,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 19:12:16,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 19:12:16,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 19:12:16,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 19:12:16,453 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 19:12:16,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 19:12:16,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 19:12:16,454 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 19:12:16,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 19:12:16,454 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 19:12:16,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 19:12:16,455 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 19:12:16,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 19:12:16,455 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 19:12:16,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 19:12:16,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 19:12:16,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 19:12:16,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 19:12:16,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 19:12:16,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 19:12:16,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 19:12:16,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 19:12:16,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:12:16,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 19:12:16,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 19:12:16,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 19:12:16,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 19:12:16,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 19:12:16,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 19:12:16,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 19:12:16,459 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 19:12:16,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 19:12:16,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 19:12:16,460 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 19:12:16,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 19:12:16,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 19:12:16,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 19:12:16,697 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 19:12:16,697 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 19:12:16,698 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/arithmetic_prog_bad.yml/witness.yml [2024-06-27 19:12:16,819 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 19:12:16,820 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 19:12:16,820 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-06-27 19:12:17,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 19:12:18,092 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 19:12:18,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2024-06-27 19:12:18,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8c05cb0d/c7d3d3d37a0045a7a8aeef08f4039f94/FLAG80b8fe219 [2024-06-27 19:12:18,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8c05cb0d/c7d3d3d37a0045a7a8aeef08f4039f94 [2024-06-27 19:12:18,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 19:12:18,134 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 19:12:18,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 19:12:18,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 19:12:18,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 19:12:18,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:12:16" (1/2) ... [2024-06-27 19:12:18,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c59d78 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:18, skipping insertion in model container [2024-06-27 19:12:18,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:12:16" (1/2) ... [2024-06-27 19:12:18,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@850edfc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 07:12:18, skipping insertion in model container [2024-06-27 19:12:18,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:12:18" (2/2) ... [2024-06-27 19:12:18,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66c59d78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18, skipping insertion in model container [2024-06-27 19:12:18,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 07:12:18" (2/2) ... [2024-06-27 19:12:18,147 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 19:12:18,188 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 19:12:18,189 INFO L97 edCorrectnessWitness]: Location invariant before [L914-L914] (! multithreaded || (flag == 0 || flag == 1)) && (! multithreaded || (0 <= num && num <= 1)) [2024-06-27 19:12:18,190 INFO L97 edCorrectnessWitness]: Location invariant before [L915-L915] (! multithreaded || (flag == 0 || flag == 1)) && (! multithreaded || (0 <= num && num <= 1)) [2024-06-27 19:12:18,190 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 19:12:18,190 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-27 19:12:18,190 INFO L106 edCorrectnessWitness]: ghost_update [L893-L893] m_locked = 1; [2024-06-27 19:12:18,191 INFO L106 edCorrectnessWitness]: ghost_update [L883-L883] m_locked = 0; [2024-06-27 19:12:18,191 INFO L106 edCorrectnessWitness]: ghost_update [L881-L881] m_locked = 0; [2024-06-27 19:12:18,191 INFO L106 edCorrectnessWitness]: ghost_update [L881-L881] m_locked = 1; [2024-06-27 19:12:18,191 INFO L106 edCorrectnessWitness]: ghost_update [L895-L895] m_locked = 0; [2024-06-27 19:12:18,191 INFO L106 edCorrectnessWitness]: ghost_update [L895-L895] m_locked = 1; [2024-06-27 19:12:18,192 INFO L106 edCorrectnessWitness]: ghost_update [L913-L913] multithreaded = 1; [2024-06-27 19:12:18,192 INFO L106 edCorrectnessWitness]: ghost_update [L879-L879] m_locked = 1; [2024-06-27 19:12:18,192 INFO L106 edCorrectnessWitness]: ghost_update [L898-L898] m_locked = 0; [2024-06-27 19:12:18,231 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 19:12:18,506 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-06-27 19:12:18,512 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:12:18,525 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 19:12:18,658 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i[39758,39771] [2024-06-27 19:12:18,659 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 19:12:18,705 INFO L206 MainTranslator]: Completed translation [2024-06-27 19:12:18,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18 WrapperNode [2024-06-27 19:12:18,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 19:12:18,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 19:12:18,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 19:12:18,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 19:12:18,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,757 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2024-06-27 19:12:18,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 19:12:18,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 19:12:18,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 19:12:18,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 19:12:18,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,794 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2024-06-27 19:12:18,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 19:12:18,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 19:12:18,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 19:12:18,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 19:12:18,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (1/1) ... [2024-06-27 19:12:18,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 19:12:18,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:12:18,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 19:12:18,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 19:12:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-27 19:12:18,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-27 19:12:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-27 19:12:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 19:12:18,881 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 19:12:18,881 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 19:12:18,882 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 19:12:18,882 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 19:12:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 19:12:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 19:12:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 19:12:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 19:12:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 19:12:18,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 19:12:18,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 19:12:18,884 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 19:12:19,029 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 19:12:19,030 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 19:12:19,258 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 19:12:19,258 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 19:12:19,386 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 19:12:19,386 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-27 19:12:19,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:12:19 BoogieIcfgContainer [2024-06-27 19:12:19,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 19:12:19,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 19:12:19,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 19:12:19,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 19:12:19,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 07:12:16" (1/4) ... [2024-06-27 19:12:19,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b20947 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 07:12:19, skipping insertion in model container [2024-06-27 19:12:19,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 07:12:18" (2/4) ... [2024-06-27 19:12:19,391 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b20947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:12:19, skipping insertion in model container [2024-06-27 19:12:19,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 07:12:18" (3/4) ... [2024-06-27 19:12:19,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32b20947 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 07:12:19, skipping insertion in model container [2024-06-27 19:12:19,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 07:12:19" (4/4) ... [2024-06-27 19:12:19,398 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-06-27 19:12:19,411 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 19:12:19,412 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 19:12:19,412 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 19:12:19,441 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 19:12:19,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 100 flow [2024-06-27 19:12:19,480 INFO L124 PetriNetUnfolderBase]: 6/41 cut-off events. [2024-06-27 19:12:19,481 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 19:12:19,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 41 events. 6/41 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 31. Up to 3 conditions per place. [2024-06-27 19:12:19,483 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 100 flow [2024-06-27 19:12:19,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 37 transitions, 86 flow [2024-06-27 19:12:19,492 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 19:12:19,497 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;@f961d17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 19:12:19,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 19:12:19,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 19:12:19,501 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-27 19:12:19,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 19:12:19,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:19,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 19:12:19,502 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 19:12:19,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:19,506 INFO L85 PathProgramCache]: Analyzing trace with hash 356815930, now seen corresponding path program 1 times [2024-06-27 19:12:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:19,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851178827] [2024-06-27 19:12:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:19,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:19,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851178827] [2024-06-27 19:12:19,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851178827] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:19,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:19,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 19:12:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835833947] [2024-06-27 19:12:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:19,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:12:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:19,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:12:19,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:12:19,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-06-27 19:12:19,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:19,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:19,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-06-27 19:12:19,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:19,974 INFO L124 PetriNetUnfolderBase]: 507/856 cut-off events. [2024-06-27 19:12:19,974 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-06-27 19:12:19,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1683 conditions, 856 events. 507/856 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3636 event pairs, 157 based on Foata normal form. 30/826 useless extension candidates. Maximal degree in co-relation 1593. Up to 674 conditions per place. [2024-06-27 19:12:19,980 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 39 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2024-06-27 19:12:19,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 204 flow [2024-06-27 19:12:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:12:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:12:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-06-27 19:12:19,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6589147286821705 [2024-06-27 19:12:19,993 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 3 states and 85 transitions. [2024-06-27 19:12:19,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 204 flow [2024-06-27 19:12:19,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 19:12:19,997 INFO L231 Difference]: Finished difference. Result has 39 places, 39 transitions, 103 flow [2024-06-27 19:12:19,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=39, PETRI_TRANSITIONS=39} [2024-06-27 19:12:20,002 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-06-27 19:12:20,002 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 39 transitions, 103 flow [2024-06-27 19:12:20,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:20,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:20,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 19:12:20,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 19:12:20,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash -4554325, now seen corresponding path program 1 times [2024-06-27 19:12:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:20,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877296545] [2024-06-27 19:12:20,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:20,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877296545] [2024-06-27 19:12:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877296545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:20,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:20,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 19:12:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884187301] [2024-06-27 19:12:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:20,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 19:12:20,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:20,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 19:12:20,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 19:12:20,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 43 [2024-06-27 19:12:20,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 39 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:20,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 43 [2024-06-27 19:12:20,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:20,263 INFO L124 PetriNetUnfolderBase]: 497/931 cut-off events. [2024-06-27 19:12:20,263 INFO L125 PetriNetUnfolderBase]: For 202/202 co-relation queries the response was YES. [2024-06-27 19:12:20,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1956 conditions, 931 events. 497/931 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4130 event pairs, 150 based on Foata normal form. 161/1076 useless extension candidates. Maximal degree in co-relation 587. Up to 391 conditions per place. [2024-06-27 19:12:20,269 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 52 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2024-06-27 19:12:20,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 67 transitions, 284 flow [2024-06-27 19:12:20,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 19:12:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 19:12:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-06-27 19:12:20,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-06-27 19:12:20,271 INFO L175 Difference]: Start difference. First operand has 39 places, 39 transitions, 103 flow. Second operand 4 states and 112 transitions. [2024-06-27 19:12:20,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 67 transitions, 284 flow [2024-06-27 19:12:20,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 67 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:20,273 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 140 flow [2024-06-27 19:12:20,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2024-06-27 19:12:20,274 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-06-27 19:12:20,274 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 140 flow [2024-06-27 19:12:20,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:20,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:20,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 19:12:20,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 19:12:20,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:20,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1673040369, now seen corresponding path program 1 times [2024-06-27 19:12:20,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:20,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880959672] [2024-06-27 19:12:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:20,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:20,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880959672] [2024-06-27 19:12:20,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880959672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:20,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:20,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:12:20,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443654978] [2024-06-27 19:12:20,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:20,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:12:20,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:20,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:12:20,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:12:20,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-06-27 19:12:20,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 140 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-06-27 19:12:20,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:20,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-06-27 19:12:20,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:20,434 INFO L124 PetriNetUnfolderBase]: 596/1185 cut-off events. [2024-06-27 19:12:20,434 INFO L125 PetriNetUnfolderBase]: For 642/656 co-relation queries the response was YES. [2024-06-27 19:12:20,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2682 conditions, 1185 events. 596/1185 cut-off events. For 642/656 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5673 event pairs, 281 based on Foata normal form. 30/1196 useless extension candidates. Maximal degree in co-relation 841. Up to 635 conditions per place. [2024-06-27 19:12:20,439 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 42 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2024-06-27 19:12:20,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 56 transitions, 274 flow [2024-06-27 19:12:20,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:12:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:12:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-06-27 19:12:20,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7131782945736435 [2024-06-27 19:12:20,440 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 140 flow. Second operand 3 states and 92 transitions. [2024-06-27 19:12:20,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 56 transitions, 274 flow [2024-06-27 19:12:20,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:20,442 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 142 flow [2024-06-27 19:12:20,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2024-06-27 19:12:20,443 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-06-27 19:12:20,443 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 142 flow [2024-06-27 19:12:20,444 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-06-27 19:12:20,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:20,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:20,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 19:12:20,444 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 19:12:20,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:20,445 INFO L85 PathProgramCache]: Analyzing trace with hash 707966612, now seen corresponding path program 1 times [2024-06-27 19:12:20,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:20,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308559855] [2024-06-27 19:12:20,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:20,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:20,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308559855] [2024-06-27 19:12:20,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308559855] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 19:12:20,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 19:12:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 19:12:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226029179] [2024-06-27 19:12:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 19:12:20,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 19:12:20,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 19:12:20,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 19:12:20,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 43 [2024-06-27 19:12:20,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:20,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 43 [2024-06-27 19:12:20,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:20,604 INFO L124 PetriNetUnfolderBase]: 332/758 cut-off events. [2024-06-27 19:12:20,605 INFO L125 PetriNetUnfolderBase]: For 414/420 co-relation queries the response was YES. [2024-06-27 19:12:20,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 758 events. 332/758 cut-off events. For 414/420 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3305 event pairs, 131 based on Foata normal form. 46/797 useless extension candidates. Maximal degree in co-relation 475. Up to 311 conditions per place. [2024-06-27 19:12:20,609 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 33 selfloop transitions, 8 changer transitions 0/53 dead transitions. [2024-06-27 19:12:20,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 270 flow [2024-06-27 19:12:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 19:12:20,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 19:12:20,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-06-27 19:12:20,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2024-06-27 19:12:20,610 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 142 flow. Second operand 3 states and 90 transitions. [2024-06-27 19:12:20,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 270 flow [2024-06-27 19:12:20,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:20,612 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 156 flow [2024-06-27 19:12:20,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2024-06-27 19:12:20,613 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-06-27 19:12:20,613 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 156 flow [2024-06-27 19:12:20,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:20,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:20,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 19:12:20,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 19:12:20,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash -391816611, now seen corresponding path program 1 times [2024-06-27 19:12:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143499172] [2024-06-27 19:12:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:20,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143499172] [2024-06-27 19:12:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143499172] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 19:12:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684499131] [2024-06-27 19:12:20,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:20,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 19:12:20,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:12:20,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 19:12:20,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 19:12:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:20,751 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-27 19:12:20,754 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 19:12:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:20,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 19:12:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 19:12:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684499131] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 19:12:20,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 19:12:20,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-06-27 19:12:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444659823] [2024-06-27 19:12:20,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 19:12:20,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 19:12:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:20,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 19:12:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-06-27 19:12:20,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 43 [2024-06-27 19:12:20,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:20,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 43 [2024-06-27 19:12:20,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:20,954 INFO L124 PetriNetUnfolderBase]: 615/1270 cut-off events. [2024-06-27 19:12:20,954 INFO L125 PetriNetUnfolderBase]: For 942/960 co-relation queries the response was YES. [2024-06-27 19:12:20,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3221 conditions, 1270 events. 615/1270 cut-off events. For 942/960 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5470 event pairs, 73 based on Foata normal form. 72/1338 useless extension candidates. Maximal degree in co-relation 1044. Up to 318 conditions per place. [2024-06-27 19:12:20,960 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 65 selfloop transitions, 5 changer transitions 2/83 dead transitions. [2024-06-27 19:12:20,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 467 flow [2024-06-27 19:12:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 19:12:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 19:12:20,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-27 19:12:20,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6976744186046512 [2024-06-27 19:12:20,964 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 156 flow. Second operand 5 states and 150 transitions. [2024-06-27 19:12:20,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 467 flow [2024-06-27 19:12:20,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:20,968 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 182 flow [2024-06-27 19:12:20,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-27 19:12:20,971 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2024-06-27 19:12:20,971 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 182 flow [2024-06-27 19:12:20,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:20,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:20,971 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:20,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 19:12:21,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 19:12:21,185 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 19:12:21,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:21,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1587034059, now seen corresponding path program 1 times [2024-06-27 19:12:21,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:21,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802121863] [2024-06-27 19:12:21,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:21,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-06-27 19:12:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 19:12:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802121863] [2024-06-27 19:12:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802121863] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 19:12:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112214978] [2024-06-27 19:12:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:21,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 19:12:21,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 19:12:21,435 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 19:12:21,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 19:12:21,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 19:12:21,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 17 conjunts are in the unsatisfiable core [2024-06-27 19:12:21,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 19:12:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-06-27 19:12:21,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 19:12:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-06-27 19:12:21,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112214978] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 19:12:21,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 19:12:21,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 11 [2024-06-27 19:12:21,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240426484] [2024-06-27 19:12:21,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 19:12:21,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 19:12:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 19:12:21,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 19:12:21,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-06-27 19:12:21,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-06-27 19:12:21,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 182 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:21,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 19:12:21,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-06-27 19:12:21,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 19:12:22,060 INFO L124 PetriNetUnfolderBase]: 861/1723 cut-off events. [2024-06-27 19:12:22,060 INFO L125 PetriNetUnfolderBase]: For 1875/1875 co-relation queries the response was YES. [2024-06-27 19:12:22,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4471 conditions, 1723 events. 861/1723 cut-off events. For 1875/1875 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7732 event pairs, 316 based on Foata normal form. 26/1741 useless extension candidates. Maximal degree in co-relation 2459. Up to 764 conditions per place. [2024-06-27 19:12:22,066 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 50 selfloop transitions, 7 changer transitions 0/65 dead transitions. [2024-06-27 19:12:22,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 368 flow [2024-06-27 19:12:22,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 19:12:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 19:12:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-06-27 19:12:22,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4496124031007752 [2024-06-27 19:12:22,068 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 182 flow. Second operand 6 states and 116 transitions. [2024-06-27 19:12:22,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 368 flow [2024-06-27 19:12:22,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 356 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-06-27 19:12:22,071 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 186 flow [2024-06-27 19:12:22,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=186, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2024-06-27 19:12:22,071 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2024-06-27 19:12:22,071 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 186 flow [2024-06-27 19:12:22,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 19:12:22,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 19:12:22,072 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:22,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-27 19:12:22,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-06-27 19:12:22,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 19:12:22,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 19:12:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1861310608, now seen corresponding path program 1 times [2024-06-27 19:12:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 19:12:22,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571238305] [2024-06-27 19:12:22,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 19:12:22,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 19:12:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:12:22,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 19:12:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 19:12:22,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 19:12:22,379 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 19:12:22,380 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 19:12:22,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 19:12:22,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 19:12:22,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 19:12:22,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 19:12:22,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 19:12:22,381 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-06-27 19:12:22,389 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 19:12:22,389 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 19:12:22,447 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 19:12:22,448 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 19:12:22,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 07:12:22 BasicIcfg [2024-06-27 19:12:22,448 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 19:12:22,449 INFO L158 Benchmark]: Toolchain (without parser) took 4314.69ms. Allocated memory was 142.6MB in the beginning and 243.3MB in the end (delta: 100.7MB). Free memory was 65.5MB in the beginning and 148.1MB in the end (delta: -82.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-06-27 19:12:22,449 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:12:22,449 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 142.6MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 19:12:22,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.57ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 65.1MB in the beginning and 134.6MB in the end (delta: -69.5MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-06-27 19:12:22,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 180.4MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 19:12:22,450 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 180.4MB. Free memory was 132.5MB in the beginning and 129.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 19:12:22,450 INFO L158 Benchmark]: RCFGBuilder took 564.61ms. Allocated memory is still 180.4MB. Free memory was 129.4MB in the beginning and 89.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-27 19:12:22,450 INFO L158 Benchmark]: TraceAbstraction took 3060.03ms. Allocated memory was 180.4MB in the beginning and 243.3MB in the end (delta: 62.9MB). Free memory was 88.5MB in the beginning and 148.1MB in the end (delta: -59.7MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2024-06-27 19:12:22,451 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 105.2MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 142.6MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 569.57ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 65.1MB in the beginning and 134.6MB in the end (delta: -69.5MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.73ms. Allocated memory is still 180.4MB. Free memory was 134.6MB in the beginning and 132.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 180.4MB. Free memory was 132.5MB in the beginning and 129.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 564.61ms. Allocated memory is still 180.4MB. Free memory was 129.4MB in the beginning and 89.5MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3060.03ms. Allocated memory was 180.4MB in the beginning and 243.3MB in the end (delta: 62.9MB). Free memory was 88.5MB in the beginning and 148.1MB in the end (delta: -59.7MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L1] 0 //@ ghost int m_locked = 0; [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] 0 //@ ghost multithreaded = 1; VAL [flag=0, m={3:0}, num=0, t1=-2, total=0] [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\old(arg)={0:0}, flag=0, m={3:0}, num=0, t1=-2, total=0] [L876] 1 int i; [L877] 1 i = 0 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, total=0] [L879] 1 //@ ghost m_locked = 1; [L914] 0 //@ assert ((!multithreaded || ((flag == 0) || (flag == 1))) && (!multithreaded || ((0 <= num) && (num <= 1)))); [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, flag=0, i=0, m={3:0}, num=0, t1=-2, t2=-1, total=0] [L890] 2 int j; [L891] 2 j = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=0, j=0, m={3:0}, num=1, total=0] [L883] 1 //@ ghost m_locked = 0; [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=1, total=0] [L893] 2 //@ ghost m_locked = 1; [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L915] 0 //@ assert ((!multithreaded || ((flag == 0) || (flag == 1))) && (!multithreaded || ((0 <= num) && (num <= 1)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, t1=-2, t2=-1, total=0] [L898] 2 //@ ghost m_locked = 0; [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=0, m={3:0}, num=0, total=0] [L879] 1 //@ ghost m_locked = 1; [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=0, total=0] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=1, j=1, m={3:0}, num=1, total=0] [L883] 1 //@ ghost m_locked = 0; [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=1, total=0] [L893] 2 //@ ghost m_locked = 1; [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L898] 2 //@ ghost m_locked = 0; [L878] COND TRUE 1 i < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=1, m={3:0}, num=0, total=1] [L879] 1 //@ ghost m_locked = 1; [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L892] COND TRUE 2 j < 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=0, total=1] [L880] COND FALSE 1 !(num > 0) [L882] 1 num++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=2, j=2, m={3:0}, num=1, total=1] [L883] 1 //@ ghost m_locked = 0; [L885] 1 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=1, total=1] [L893] 2 //@ ghost m_locked = 1; [L894] COND FALSE 2 !(num == 0) [L896] 2 total = total + j [L897] 2 num-- VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, total=3] [L878] COND FALSE 1 !(i < 3) [L887] 1 return ((void *)0); [L915] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=2, m={3:0}, num=0, t1=-2, t2=-1, total=3] [L898] 2 //@ ghost m_locked = 0; [L900] 2 j++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=0, i=3, j=3, m={3:0}, num=0, total=3] [L892] COND FALSE 2 !(j < 3) [L902] 2 total = total + j [L903] 2 flag = 1 [L904] 2 return ((void *)0); [L916] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L917] COND TRUE 0 \read(flag) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L918] COND FALSE 0 !(total != ((3 * (3 + 1)) / 2)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] [L919] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, flag=1, i=3, j=3, m={3:0}, num=0, t1=-2, t2=-1, total=6] - UnprovableResult [Line: 914]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 915]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 914]: 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: 913]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 60 locations, 5 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: 2.9s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 290 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 267 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 606 IncrementalHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 5 mSDtfsCounter, 606 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=6, InterpolantAutomatonStates: 24, 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.8s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1045 SizeOfPredicates, 1 NumberOfNonLiveVariables, 518 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 98/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 19:12:22,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE