./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stack_longer-1.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/stack_longer-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/stack_longer-1.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/stack_longer-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:10:23,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:10:23,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:10:23,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:10:23,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:10:23,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:10:23,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:10:23,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:10:23,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:10:23,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:10:23,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:10:23,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:10:23,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:10:23,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:10:23,888 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:10:23,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:10:23,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:10:23,889 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:10:23,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:10:23,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:10:23,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:10:23,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:10:23,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:10:23,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:10:23,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:10:23,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:10:23,892 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:10:23,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:10:23,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:10:23,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:10:23,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:10:23,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:10:23,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:10:23,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:10:23,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:10:23,895 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:10:23,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:10:23,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:10:23,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:10:23,896 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:10:23,896 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:10:23,896 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:10:23,896 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:10:23,897 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-05-12 11:10:24,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:10:24,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:10:24,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:10:24,198 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:10:24,200 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:10:24,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/stack_longer-1.yml/witness.yml [2024-05-12 11:10:24,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:10:24,307 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:10:24,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2024-05-12 11:10:25,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:10:25,797 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:10:25,798 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2024-05-12 11:10:25,817 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c88a754/a6bb660336fb4aaaa5efbf4fee255b10/FLAG123f7199c [2024-05-12 11:10:25,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7c88a754/a6bb660336fb4aaaa5efbf4fee255b10 [2024-05-12 11:10:25,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:10:25,832 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:10:25,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:10:25,835 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:10:25,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:10:25,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:24" (1/2) ... [2024-05-12 11:10:25,842 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2259c6ef and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:25, skipping insertion in model container [2024-05-12 11:10:25,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:24" (1/2) ... [2024-05-12 11:10:25,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7b55296e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:25, skipping insertion in model container [2024-05-12 11:10:25,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:10:25" (2/2) ... [2024-05-12 11:10:25,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2259c6ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:25, skipping insertion in model container [2024-05-12 11:10:25,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:10:25" (2/2) ... [2024-05-12 11:10:25,845 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:10:25,876 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:10:25,877 INFO L97 edCorrectnessWitness]: Location invariant before [L1022-L1022] ! multithreaded || (m_locked || (long long )flag + (long long )top >= 0LL) [2024-05-12 11:10:25,877 INFO L97 edCorrectnessWitness]: Location invariant before [L1023-L1023] ! multithreaded || (m_locked || (long long )flag + (long long )top >= 0LL) [2024-05-12 11:10:25,877 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-05-12 11:10:25,877 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:10:25,878 INFO L106 edCorrectnessWitness]: ghost_update [L998-L998] m_locked = 0; [2024-05-12 11:10:25,878 INFO L106 edCorrectnessWitness]: ghost_update [L1021-L1021] multithreaded = 1; [2024-05-12 11:10:25,878 INFO L106 edCorrectnessWitness]: ghost_update [L1013-L1013] m_locked = 0; [2024-05-12 11:10:25,879 INFO L106 edCorrectnessWitness]: ghost_update [L1007-L1007] m_locked = 1; [2024-05-12 11:10:25,879 INFO L106 edCorrectnessWitness]: ghost_update [L992-L992] m_locked = 1; [2024-05-12 11:10:25,925 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:10:26,314 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2024-05-12 11:10:26,365 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:10:26,377 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local [2024-05-12 11:10:26,472 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:10:26,506 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:10:26,652 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:10:26,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26 WrapperNode [2024-05-12 11:10:26,653 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:10:26,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:10:26,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:10:26,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:10:26,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,707 INFO L138 Inliner]: procedures = 278, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 175 [2024-05-12 11:10:26,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:10:26,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:10:26,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:10:26,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:10:26,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,723 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,738 INFO L175 MemorySlicer]: Split 14 memory accesses to 5 slices as follows [3, 2, 2, 5, 2]. 36 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [0, 2, 0, 5, 0]. The 4 writes are split as follows [2, 0, 1, 0, 1]. [2024-05-12 11:10:26,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,752 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:10:26,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:10:26,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:10:26,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:10:26,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (1/1) ... [2024-05-12 11:10:26,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:10:26,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:26,792 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-05-12 11:10:26,794 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-05-12 11:10:26,824 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-12 11:10:26,824 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-12 11:10:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-12 11:10:26,825 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-12 11:10:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:10:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:10:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-12 11:10:26,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-05-12 11:10:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-05-12 11:10:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-05-12 11:10:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-05-12 11:10:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-05-12 11:10:26,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:10:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:10:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:10:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 11:10:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-05-12 11:10:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-12 11:10:26,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:10:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:10:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:10:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:10:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 11:10:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-05-12 11:10:26,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:10:26,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:10:26,830 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:10:26,989 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:10:26,990 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:10:27,186 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:10:27,186 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:10:27,478 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:10:27,479 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-12 11:10:27,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:10:27 BoogieIcfgContainer [2024-05-12 11:10:27,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:10:27,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:10:27,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:10:27,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:10:27,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:24" (1/4) ... [2024-05-12 11:10:27,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c278b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:10:27, skipping insertion in model container [2024-05-12 11:10:27,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:10:25" (2/4) ... [2024-05-12 11:10:27,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c278b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:10:27, skipping insertion in model container [2024-05-12 11:10:27,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:26" (3/4) ... [2024-05-12 11:10:27,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3c278b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:10:27, skipping insertion in model container [2024-05-12 11:10:27,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:10:27" (4/4) ... [2024-05-12 11:10:27,492 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2024-05-12 11:10:27,510 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:10:27,510 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 11:10:27,511 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:10:27,570 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-12 11:10:27,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 98 flow [2024-05-12 11:10:27,643 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2024-05-12 11:10:27,643 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-05-12 11:10:27,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 5/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 34. Up to 3 conditions per place. [2024-05-12 11:10:27,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 42 transitions, 98 flow [2024-05-12 11:10:27,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 85 flow [2024-05-12 11:10:27,669 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:10:27,678 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;@326f0005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:10:27,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-05-12 11:10:27,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:10:27,683 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-05-12 11:10:27,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:10:27,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:27,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:10:27,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:27,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:27,690 INFO L85 PathProgramCache]: Analyzing trace with hash 266301342, now seen corresponding path program 1 times [2024-05-12 11:10:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:27,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997747131] [2024-05-12 11:10:27,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:27,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997747131] [2024-05-12 11:10:28,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997747131] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:28,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:28,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:10:28,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104332622] [2024-05-12 11:10:28,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:28,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:10:28,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:28,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:10:28,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:10:28,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-05-12 11:10:28,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-05-12 11:10:28,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:28,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-05-12 11:10:28,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:28,394 INFO L124 PetriNetUnfolderBase]: 661/1159 cut-off events. [2024-05-12 11:10:28,394 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-05-12 11:10:28,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2255 conditions, 1159 events. 661/1159 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5943 event pairs, 201 based on Foata normal form. 80/1075 useless extension candidates. Maximal degree in co-relation 2087. Up to 761 conditions per place. [2024-05-12 11:10:28,405 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 45 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-05-12 11:10:28,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 217 flow [2024-05-12 11:10:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:10:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:10:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-05-12 11:10:28,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-05-12 11:10:28,418 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 85 flow. Second operand 3 states and 79 transitions. [2024-05-12 11:10:28,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 217 flow [2024-05-12 11:10:28,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 209 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 11:10:28,425 INFO L231 Difference]: Finished difference. Result has 40 places, 37 transitions, 90 flow [2024-05-12 11:10:28,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=37} [2024-05-12 11:10:28,430 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2024-05-12 11:10:28,431 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 37 transitions, 90 flow [2024-05-12 11:10:28,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-05-12 11:10:28,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:28,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:28,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:10:28,432 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:28,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash 779648380, now seen corresponding path program 1 times [2024-05-12 11:10:28,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:28,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096537123] [2024-05-12 11:10:28,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:28,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:28,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:28,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096537123] [2024-05-12 11:10:28,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096537123] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:28,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:10:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086599003] [2024-05-12 11:10:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:28,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:10:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:10:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:10:28,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-05-12 11:10:28,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-05-12 11:10:28,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:28,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-05-12 11:10:28,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:28,805 INFO L124 PetriNetUnfolderBase]: 760/1441 cut-off events. [2024-05-12 11:10:28,806 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-05-12 11:10:28,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2842 conditions, 1441 events. 760/1441 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7900 event pairs, 264 based on Foata normal form. 41/1375 useless extension candidates. Maximal degree in co-relation 1426. Up to 619 conditions per place. [2024-05-12 11:10:28,816 INFO L140 encePairwiseOnDemand]: 34/42 looper letters, 48 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-05-12 11:10:28,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 254 flow [2024-05-12 11:10:28,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:10:28,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:10:28,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-05-12 11:10:28,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714285714285714 [2024-05-12 11:10:28,824 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 90 flow. Second operand 5 states and 99 transitions. [2024-05-12 11:10:28,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 254 flow [2024-05-12 11:10:28,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:10:28,828 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 129 flow [2024-05-12 11:10:28,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=129, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2024-05-12 11:10:28,829 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2024-05-12 11:10:28,829 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 129 flow [2024-05-12 11:10:28,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-05-12 11:10:28,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:28,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:28,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:10:28,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:28,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 809261641, now seen corresponding path program 1 times [2024-05-12 11:10:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:28,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515797264] [2024-05-12 11:10:28,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:28,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:28,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:28,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515797264] [2024-05-12 11:10:28,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515797264] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:28,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:28,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:10:29,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602087699] [2024-05-12 11:10:29,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:29,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:10:29,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:29,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:10:29,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:10:29,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-05-12 11:10:29,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-05-12 11:10:29,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:29,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-05-12 11:10:29,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:29,251 INFO L124 PetriNetUnfolderBase]: 869/1596 cut-off events. [2024-05-12 11:10:29,251 INFO L125 PetriNetUnfolderBase]: For 752/752 co-relation queries the response was YES. [2024-05-12 11:10:29,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 1596 events. 869/1596 cut-off events. For 752/752 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8717 event pairs, 215 based on Foata normal form. 0/1467 useless extension candidates. Maximal degree in co-relation 2661. Up to 990 conditions per place. [2024-05-12 11:10:29,262 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 66 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2024-05-12 11:10:29,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 372 flow [2024-05-12 11:10:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:10:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:10:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2024-05-12 11:10:29,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2024-05-12 11:10:29,268 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 129 flow. Second operand 4 states and 99 transitions. [2024-05-12 11:10:29,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 372 flow [2024-05-12 11:10:29,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 76 transitions, 369 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:29,271 INFO L231 Difference]: Finished difference. Result has 47 places, 42 transitions, 140 flow [2024-05-12 11:10:29,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=47, PETRI_TRANSITIONS=42} [2024-05-12 11:10:29,273 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-05-12 11:10:29,273 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 140 flow [2024-05-12 11:10:29,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-05-12 11:10:29,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:29,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:10:29,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:29,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash -677406096, now seen corresponding path program 1 times [2024-05-12 11:10:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103268867] [2024-05-12 11:10:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:29,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:29,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:29,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103268867] [2024-05-12 11:10:29,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103268867] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:29,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:29,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:10:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898371522] [2024-05-12 11:10:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:29,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:10:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:10:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:10:29,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-05-12 11:10:29,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-05-12 11:10:29,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:29,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-05-12 11:10:29,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:29,577 INFO L124 PetriNetUnfolderBase]: 719/1320 cut-off events. [2024-05-12 11:10:29,578 INFO L125 PetriNetUnfolderBase]: For 827/833 co-relation queries the response was YES. [2024-05-12 11:10:29,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3147 conditions, 1320 events. 719/1320 cut-off events. For 827/833 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6765 event pairs, 205 based on Foata normal form. 42/1254 useless extension candidates. Maximal degree in co-relation 2149. Up to 847 conditions per place. [2024-05-12 11:10:29,586 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2024-05-12 11:10:29,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 289 flow [2024-05-12 11:10:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:10:29,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:10:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-05-12 11:10:29,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2024-05-12 11:10:29,587 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 140 flow. Second operand 4 states and 83 transitions. [2024-05-12 11:10:29,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 289 flow [2024-05-12 11:10:29,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 285 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:29,593 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 128 flow [2024-05-12 11:10:29,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-05-12 11:10:29,595 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2024-05-12 11:10:29,595 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 128 flow [2024-05-12 11:10:29,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-05-12 11:10:29,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:29,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:10:29,596 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:29,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash 526902392, now seen corresponding path program 1 times [2024-05-12 11:10:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:29,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874237472] [2024-05-12 11:10:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:29,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:29,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874237472] [2024-05-12 11:10:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874237472] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:29,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:29,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:10:29,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106830468] [2024-05-12 11:10:29,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:29,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:10:29,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:29,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:10:29,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:10:29,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-05-12 11:10:29,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-05-12 11:10:29,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:29,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-05-12 11:10:29,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:29,882 INFO L124 PetriNetUnfolderBase]: 748/1330 cut-off events. [2024-05-12 11:10:29,882 INFO L125 PetriNetUnfolderBase]: For 693/693 co-relation queries the response was YES. [2024-05-12 11:10:29,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 1330 events. 748/1330 cut-off events. For 693/693 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6549 event pairs, 286 based on Foata normal form. 15/1254 useless extension candidates. Maximal degree in co-relation 2371. Up to 864 conditions per place. [2024-05-12 11:10:29,891 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 46 selfloop transitions, 2 changer transitions 3/57 dead transitions. [2024-05-12 11:10:29,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 283 flow [2024-05-12 11:10:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:10:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:10:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-05-12 11:10:29,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-05-12 11:10:29,893 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 128 flow. Second operand 3 states and 76 transitions. [2024-05-12 11:10:29,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 283 flow [2024-05-12 11:10:29,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:29,895 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 137 flow [2024-05-12 11:10:29,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=137, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2024-05-12 11:10:29,897 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2024-05-12 11:10:29,898 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 137 flow [2024-05-12 11:10:29,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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-05-12 11:10:29,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:29,898 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:29,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:10:29,898 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:29,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:29,899 INFO L85 PathProgramCache]: Analyzing trace with hash 482406012, now seen corresponding path program 1 times [2024-05-12 11:10:29,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:29,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463519226] [2024-05-12 11:10:29,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:29,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463519226] [2024-05-12 11:10:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463519226] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826204437] [2024-05-12 11:10:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:30,024 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-05-12 11:10:30,030 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-05-12 11:10:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:30,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2024-05-12 11:10:30,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:30,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-12 11:10:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:30,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:30,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826204437] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:30,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:30,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-05-12 11:10:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694472585] [2024-05-12 11:10:30,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:30,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 11:10:30,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:30,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 11:10:30,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-05-12 11:10:30,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-05-12 11:10:30,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 137 flow. Second operand has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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-05-12 11:10:30,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:30,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-05-12 11:10:30,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:31,029 INFO L124 PetriNetUnfolderBase]: 2205/4049 cut-off events. [2024-05-12 11:10:31,029 INFO L125 PetriNetUnfolderBase]: For 2002/2002 co-relation queries the response was YES. [2024-05-12 11:10:31,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9777 conditions, 4049 events. 2205/4049 cut-off events. For 2002/2002 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 23777 event pairs, 178 based on Foata normal form. 0/3862 useless extension candidates. Maximal degree in co-relation 8400. Up to 864 conditions per place. [2024-05-12 11:10:31,059 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 190 selfloop transitions, 18 changer transitions 3/219 dead transitions. [2024-05-12 11:10:31,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 219 transitions, 1132 flow [2024-05-12 11:10:31,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:10:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:10:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 297 transitions. [2024-05-12 11:10:31,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5892857142857143 [2024-05-12 11:10:31,061 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 137 flow. Second operand 12 states and 297 transitions. [2024-05-12 11:10:31,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 219 transitions, 1132 flow [2024-05-12 11:10:31,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 219 transitions, 1130 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:10:31,066 INFO L231 Difference]: Finished difference. Result has 62 places, 59 transitions, 282 flow [2024-05-12 11:10:31,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=282, PETRI_PLACES=62, PETRI_TRANSITIONS=59} [2024-05-12 11:10:31,067 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-05-12 11:10:31,067 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 59 transitions, 282 flow [2024-05-12 11:10:31,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.545454545454545) internal successors, (138), 11 states have internal predecessors, (138), 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-05-12 11:10:31,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:31,068 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] [2024-05-12 11:10:31,086 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-05-12 11:10:31,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-12 11:10:31,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:31,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1591313209, now seen corresponding path program 1 times [2024-05-12 11:10:31,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:31,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429686205] [2024-05-12 11:10:31,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:31,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429686205] [2024-05-12 11:10:31,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429686205] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:31,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:10:31,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213019480] [2024-05-12 11:10:31,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:31,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:10:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:10:31,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:10:31,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-05-12 11:10:31,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 59 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-05-12 11:10:31,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:31,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-05-12 11:10:31,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:31,596 INFO L124 PetriNetUnfolderBase]: 996/1973 cut-off events. [2024-05-12 11:10:31,596 INFO L125 PetriNetUnfolderBase]: For 1490/1490 co-relation queries the response was YES. [2024-05-12 11:10:31,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 1973 events. 996/1973 cut-off events. For 1490/1490 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10441 event pairs, 349 based on Foata normal form. 90/2036 useless extension candidates. Maximal degree in co-relation 4767. Up to 936 conditions per place. [2024-05-12 11:10:31,609 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 50 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2024-05-12 11:10:31,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 62 transitions, 360 flow [2024-05-12 11:10:31,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:10:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:10:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2024-05-12 11:10:31,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5952380952380952 [2024-05-12 11:10:31,611 INFO L175 Difference]: Start difference. First operand has 62 places, 59 transitions, 282 flow. Second operand 3 states and 75 transitions. [2024-05-12 11:10:31,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 62 transitions, 360 flow [2024-05-12 11:10:31,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 62 transitions, 323 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 11:10:31,619 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 194 flow [2024-05-12 11:10:31,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2024-05-12 11:10:31,620 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-05-12 11:10:31,620 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 194 flow [2024-05-12 11:10:31,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-05-12 11:10:31,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:31,620 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-05-12 11:10:31,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:10:31,621 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:31,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 25238858, now seen corresponding path program 1 times [2024-05-12 11:10:31,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:31,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146351926] [2024-05-12 11:10:31,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:32,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:32,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146351926] [2024-05-12 11:10:32,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146351926] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:32,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:10:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357921905] [2024-05-12 11:10:32,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:32,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:10:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:32,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:10:32,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:10:32,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-05-12 11:10:32,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:10:32,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:32,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-05-12 11:10:32,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:32,386 INFO L124 PetriNetUnfolderBase]: 1098/2147 cut-off events. [2024-05-12 11:10:32,386 INFO L125 PetriNetUnfolderBase]: For 1084/1084 co-relation queries the response was YES. [2024-05-12 11:10:32,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5088 conditions, 2147 events. 1098/2147 cut-off events. For 1084/1084 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11425 event pairs, 235 based on Foata normal form. 0/2111 useless extension candidates. Maximal degree in co-relation 4477. Up to 1362 conditions per place. [2024-05-12 11:10:32,401 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 72 selfloop transitions, 5 changer transitions 3/88 dead transitions. [2024-05-12 11:10:32,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 467 flow [2024-05-12 11:10:32,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:10:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:10:32,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-05-12 11:10:32,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-05-12 11:10:32,403 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 194 flow. Second operand 5 states and 114 transitions. [2024-05-12 11:10:32,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 467 flow [2024-05-12 11:10:32,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 445 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:32,408 INFO L231 Difference]: Finished difference. Result has 61 places, 52 transitions, 222 flow [2024-05-12 11:10:32,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=222, PETRI_PLACES=61, PETRI_TRANSITIONS=52} [2024-05-12 11:10:32,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-05-12 11:10:32,410 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 52 transitions, 222 flow [2024-05-12 11:10:32,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 11:10:32,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:32,411 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:32,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:10:32,413 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:32,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:32,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2140279095, now seen corresponding path program 1 times [2024-05-12 11:10:32,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:32,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878600199] [2024-05-12 11:10:32,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:32,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878600199] [2024-05-12 11:10:32,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878600199] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173174832] [2024-05-12 11:10:32,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:32,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:32,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:32,991 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-05-12 11:10:33,015 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-05-12 11:10:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:33,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-12 11:10:33,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:33,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-12 11:10:33,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-05-12 11:10:33,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 32 [2024-05-12 11:10:33,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:33,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:33,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-05-12 11:10:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:33,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173174832] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:33,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:33,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-05-12 11:10:33,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668844309] [2024-05-12 11:10:33,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:33,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:10:33,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:33,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:10:33,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:10:33,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 42 [2024-05-12 11:10:33,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 52 transitions, 222 flow. Second operand has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-05-12 11:10:33,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:33,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 42 [2024-05-12 11:10:33,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:34,578 INFO L124 PetriNetUnfolderBase]: 1532/2991 cut-off events. [2024-05-12 11:10:34,578 INFO L125 PetriNetUnfolderBase]: For 1290/1290 co-relation queries the response was YES. [2024-05-12 11:10:34,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6833 conditions, 2991 events. 1532/2991 cut-off events. For 1290/1290 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 16166 event pairs, 245 based on Foata normal form. 0/2953 useless extension candidates. Maximal degree in co-relation 5444. Up to 432 conditions per place. [2024-05-12 11:10:34,594 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 159 selfloop transitions, 20 changer transitions 0/187 dead transitions. [2024-05-12 11:10:34,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 187 transitions, 952 flow [2024-05-12 11:10:34,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 11:10:34,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 11:10:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 284 transitions. [2024-05-12 11:10:34,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5634920634920635 [2024-05-12 11:10:34,597 INFO L175 Difference]: Start difference. First operand has 61 places, 52 transitions, 222 flow. Second operand 12 states and 284 transitions. [2024-05-12 11:10:34,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 187 transitions, 952 flow [2024-05-12 11:10:34,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 187 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:34,604 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 332 flow [2024-05-12 11:10:34,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=332, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2024-05-12 11:10:34,605 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 35 predicate places. [2024-05-12 11:10:34,605 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 332 flow [2024-05-12 11:10:34,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 13.076923076923077) internal successors, (170), 13 states have internal predecessors, (170), 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-05-12 11:10:34,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:34,605 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:34,626 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-05-12 11:10:34,819 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,SelfDestructingSolverStorable8 [2024-05-12 11:10:34,819 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-05-12 11:10:34,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:34,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1408585173, now seen corresponding path program 1 times [2024-05-12 11:10:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200419324] [2024-05-12 11:10:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 11:10:34,855 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 11:10:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 11:10:34,918 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 11:10:34,918 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 11:10:34,919 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2024-05-12 11:10:34,920 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 8 remaining) [2024-05-12 11:10:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 8 remaining) [2024-05-12 11:10:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2024-05-12 11:10:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 8 remaining) [2024-05-12 11:10:34,921 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-05-12 11:10:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-05-12 11:10:34,922 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-05-12 11:10:34,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 11:10:34,922 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:34,928 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 11:10:34,928 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 11:10:34,981 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 11:10:34,981 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 11:10:34,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 11:10:34 BasicIcfg [2024-05-12 11:10:34,982 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 11:10:34,983 INFO L158 Benchmark]: Toolchain (without parser) took 9151.14ms. Allocated memory was 140.5MB in the beginning and 325.1MB in the end (delta: 184.5MB). Free memory was 79.7MB in the beginning and 122.5MB in the end (delta: -42.8MB). Peak memory consumption was 142.5MB. Max. memory is 16.1GB. [2024-05-12 11:10:34,983 INFO L158 Benchmark]: Witness Parser took 0.21ms. Allocated memory is still 140.5MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 11:10:34,983 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 140.5MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 11:10:34,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 818.39ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 79.7MB in the beginning and 155.2MB in the end (delta: -75.4MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-05-12 11:10:34,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.20ms. Allocated memory is still 195.0MB. Free memory was 155.2MB in the beginning and 152.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 11:10:34,984 INFO L158 Benchmark]: Boogie Preprocessor took 49.80ms. Allocated memory is still 195.0MB. Free memory was 152.0MB in the beginning and 148.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-05-12 11:10:34,984 INFO L158 Benchmark]: RCFGBuilder took 721.98ms. Allocated memory is still 195.0MB. Free memory was 148.8MB in the beginning and 103.7MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-05-12 11:10:34,984 INFO L158 Benchmark]: TraceAbstraction took 7498.76ms. Allocated memory was 195.0MB in the beginning and 325.1MB in the end (delta: 130.0MB). Free memory was 102.7MB in the beginning and 122.5MB in the end (delta: -19.8MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2024-05-12 11:10:34,986 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.21ms. Allocated memory is still 140.5MB. Free memory is still 102.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.20ms. Allocated memory is still 140.5MB. Free memory is still 99.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 818.39ms. Allocated memory was 140.5MB in the beginning and 195.0MB in the end (delta: 54.5MB). Free memory was 79.7MB in the beginning and 155.2MB in the end (delta: -75.4MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.20ms. Allocated memory is still 195.0MB. Free memory was 155.2MB in the beginning and 152.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.80ms. Allocated memory is still 195.0MB. Free memory was 152.0MB in the beginning and 148.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 721.98ms. Allocated memory is still 195.0MB. Free memory was 148.8MB in the beginning and 103.7MB in the end (delta: 45.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7498.76ms. Allocated memory was 195.0MB in the beginning and 325.1MB in the end (delta: 130.0MB). Free memory was 102.7MB in the beginning and 122.5MB in the end (delta: -19.8MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 940]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int m_locked = 0; [L1] 0 //@ ghost int multithreaded = 0; [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] 0 //@ ghost multithreaded = 1; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] 1 //@ ghost m_locked = 1; [L1022] 0 //@ assert (!multithreaded || (m_locked || (((long long) flag + (long long) top) >= 0LL))); [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=399, top=1] [L998] 1 //@ ghost m_locked = 0; [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1007] 2 //@ ghost m_locked = 1; [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1013] 2 //@ ghost m_locked = 0; [L1005] 2 i++ VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) VAL [\old(arg)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] 2 //@ ghost m_locked = 1; [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1022]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1023]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1021]: 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: 1022]: 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: 940]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 62 locations, 8 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: 7.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 753 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 5 mSDtfsCounter, 1412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 216 ConstructedInterpolants, 7 QuantifiedInterpolants, 2077 SizeOfPredicates, 21 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 0/30 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-05-12 11:10:35,019 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