./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stack-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/stack-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7c74aec 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-2.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/stack-2.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.fix-undeclared-acsl-variable-e7c74ae-m [2024-02-07 19:22:51,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 19:22:51,419 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 19:22:51,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 19:22:51,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 19:22:51,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 19:22:51,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 19:22:51,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 19:22:51,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 19:22:51,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 19:22:51,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 19:22:51,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 19:22:51,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 19:22:51,459 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 19:22:51,459 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 19:22:51,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 19:22:51,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 19:22:51,459 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 19:22:51,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 19:22:51,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 19:22:51,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 19:22:51,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 19:22:51,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 19:22:51,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 19:22:51,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 19:22:51,461 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 19:22:51,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 19:22:51,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 19:22:51,462 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 19:22:51,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 19:22:51,463 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 19:22:51,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 19:22:51,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:22:51,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 19:22:51,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 19:22:51,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 19:22:51,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 19:22:51,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 19:22:51,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 19:22:51,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 19:22:51,464 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 19:22:51,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 19:22:51,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 19:22:51,465 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-02-07 19:22:51,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 19:22:51,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 19:22:51,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 19:22:51,712 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 19:22:51,713 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 19:22:51,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/stack-2.yml/witness.yml [2024-02-07 19:22:51,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 19:22:51,812 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 19:22:51,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2024-02-07 19:22:52,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 19:22:53,127 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 19:22:53,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2024-02-07 19:22:53,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad12eb2f/efaeda1f16ce4d4ea1a4d1422875d0bc/FLAG0eee4ddab [2024-02-07 19:22:53,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad12eb2f/efaeda1f16ce4d4ea1a4d1422875d0bc [2024-02-07 19:22:53,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 19:22:53,156 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 19:22:53,158 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 19:22:53,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 19:22:53,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 19:22:53,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:22:51" (1/2) ... [2024-02-07 19:22:53,164 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d45617 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:22:53, skipping insertion in model container [2024-02-07 19:22:53,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:22:51" (1/2) ... [2024-02-07 19:22:53,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4762f8f8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 07:22:53, skipping insertion in model container [2024-02-07 19:22:53,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:22:53" (2/2) ... [2024-02-07 19:22:53,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d45617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53, skipping insertion in model container [2024-02-07 19:22:53,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 07:22:53" (2/2) ... [2024-02-07 19:22:53,166 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 19:22:53,187 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 19:22:53,188 INFO L76 edCorrectnessWitness]: Location invariant before [L1013-L1013] flag == (_Bool)1 [2024-02-07 19:22:53,189 INFO L76 edCorrectnessWitness]: Location invariant before [L1000-L1000] flag == (_Bool)1 [2024-02-07 19:22:53,189 INFO L76 edCorrectnessWitness]: Location invariant before [L1010-L1010] flag == (_Bool)0 || flag == (_Bool)1 [2024-02-07 19:22:53,230 INFO L181 MainTranslator]: Built tables and reachable declarations [2024-02-07 19:22:53,579 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2024-02-07 19:22:53,616 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:22:53,631 INFO L206 MainTranslator]: Completed pre-run [2024-02-07 19:22:53,666 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 19:22:53,710 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-07 19:22:53,749 INFO L211 MainTranslator]: Completed translation [2024-02-07 19:22:53,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53 WrapperNode [2024-02-07 19:22:53,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 19:22:53,750 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 19:22:53,750 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 19:22:53,750 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 19:22:53,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,786 INFO L138 Inliner]: procedures = 278, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 170 [2024-02-07 19:22:53,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 19:22:53,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 19:22:53,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 19:22:53,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 19:22:53,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,814 INFO L175 MemorySlicer]: Split 18 memory accesses to 5 slices as follows [2, 7, 5, 2, 2]. 39 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 5, 5, 0, 0]. The 3 writes are split as follows [0, 1, 0, 1, 1]. [2024-02-07 19:22:53,814 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,814 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,819 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 19:22:53,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 19:22:53,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 19:22:53,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 19:22:53,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (1/1) ... [2024-02-07 19:22:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 19:22:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:22:53,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-07 19:22:53,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-07 19:22:53,884 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-02-07 19:22:53,884 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-02-07 19:22:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-02-07 19:22:53,885 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-02-07 19:22:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 19:22:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 19:22:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-07 19:22:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 19:22:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 19:22:53,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 19:22:53,886 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-07 19:22:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 19:22:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 19:22:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 19:22:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 19:22:53,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 19:22:53,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 19:22:53,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 19:22:53,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 19:22:53,894 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-07 19:22:54,003 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 19:22:54,005 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 19:22:54,182 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 19:22:54,182 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 19:22:54,359 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 19:22:54,360 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-07 19:22:54,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:22:54 BoogieIcfgContainer [2024-02-07 19:22:54,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 19:22:54,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 19:22:54,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 19:22:54,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 19:22:54,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 07:22:51" (1/4) ... [2024-02-07 19:22:54,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646c4ffa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 07:22:54, skipping insertion in model container [2024-02-07 19:22:54,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 07:22:53" (2/4) ... [2024-02-07 19:22:54,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646c4ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:22:54, skipping insertion in model container [2024-02-07 19:22:54,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 07:22:53" (3/4) ... [2024-02-07 19:22:54,366 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646c4ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 07:22:54, skipping insertion in model container [2024-02-07 19:22:54,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 07:22:54" (4/4) ... [2024-02-07 19:22:54,367 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2024-02-07 19:22:54,380 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 19:22:54,380 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-02-07 19:22:54,380 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 19:22:54,429 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 19:22:54,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 98 flow [2024-02-07 19:22:54,484 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2024-02-07 19:22:54,485 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 19:22:54,489 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 5. Compared 87 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 36. Up to 3 conditions per place. [2024-02-07 19:22:54,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 42 transitions, 98 flow [2024-02-07 19:22:54,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 85 flow [2024-02-07 19:22:54,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 19:22:54,516 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;@5b4fb017, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 19:22:54,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-02-07 19:22:54,527 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 19:22:54,527 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-02-07 19:22:54,527 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 19:22:54,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:54,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:54,528 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:54,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:54,532 INFO L85 PathProgramCache]: Analyzing trace with hash -561789230, now seen corresponding path program 1 times [2024-02-07 19:22:54,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:54,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411617038] [2024-02-07 19:22:54,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:54,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:54,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411617038] [2024-02-07 19:22:54,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411617038] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:54,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:54,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:22:54,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280578772] [2024-02-07 19:22:54,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:54,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 19:22:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:54,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 19:22:54,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 19:22:54,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:54,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:54,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:54,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:54,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:55,198 INFO L124 PetriNetUnfolderBase]: 365/751 cut-off events. [2024-02-07 19:22:55,226 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-02-07 19:22:55,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 751 events. 365/751 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3920 event pairs, 86 based on Foata normal form. 46/700 useless extension candidates. Maximal degree in co-relation 1239. Up to 375 conditions per place. [2024-02-07 19:22:55,232 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 48 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-02-07 19:22:55,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 248 flow [2024-02-07 19:22:55,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 19:22:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 19:22:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-02-07 19:22:55,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2024-02-07 19:22:55,252 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 85 flow. Second operand 4 states and 116 transitions. [2024-02-07 19:22:55,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 248 flow [2024-02-07 19:22:55,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 64 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-02-07 19:22:55,261 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 96 flow [2024-02-07 19:22:55,263 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2024-02-07 19:22:55,267 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-02-07 19:22:55,268 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 96 flow [2024-02-07 19:22:55,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:55,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:55,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:55,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 19:22:55,269 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:55,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash -235595492, now seen corresponding path program 1 times [2024-02-07 19:22:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35631962] [2024-02-07 19:22:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:55,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:55,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35631962] [2024-02-07 19:22:55,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35631962] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:55,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:55,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 19:22:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947438904] [2024-02-07 19:22:55,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:55,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:22:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:55,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:22:55,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:22:55,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-02-07 19:22:55,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:55,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:55,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-02-07 19:22:55,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:55,558 INFO L124 PetriNetUnfolderBase]: 467/923 cut-off events. [2024-02-07 19:22:55,558 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-02-07 19:22:55,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1928 conditions, 923 events. 467/923 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4696 event pairs, 177 based on Foata normal form. 58/894 useless extension candidates. Maximal degree in co-relation 1335. Up to 458 conditions per place. [2024-02-07 19:22:55,567 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 44 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2024-02-07 19:22:55,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 219 flow [2024-02-07 19:22:55,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:22:55,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:22:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-02-07 19:22:55,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.626984126984127 [2024-02-07 19:22:55,572 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 96 flow. Second operand 3 states and 79 transitions. [2024-02-07 19:22:55,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 219 flow [2024-02-07 19:22:55,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:55,579 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 106 flow [2024-02-07 19:22:55,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2024-02-07 19:22:55,580 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-02-07 19:22:55,580 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 106 flow [2024-02-07 19:22:55,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:55,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:55,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:55,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 19:22:55,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:55,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 234752153, now seen corresponding path program 1 times [2024-02-07 19:22:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:55,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107428512] [2024-02-07 19:22:55,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:55,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:55,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:55,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:55,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107428512] [2024-02-07 19:22:55,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107428512] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:55,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:55,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 19:22:55,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517973651] [2024-02-07 19:22:55,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:55,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:22:55,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:55,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:22:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:22:55,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-02-07 19:22:55,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:55,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:55,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-02-07 19:22:55,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:55,798 INFO L124 PetriNetUnfolderBase]: 394/742 cut-off events. [2024-02-07 19:22:55,799 INFO L125 PetriNetUnfolderBase]: For 90/100 co-relation queries the response was YES. [2024-02-07 19:22:55,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1603 conditions, 742 events. 394/742 cut-off events. For 90/100 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3265 event pairs, 141 based on Foata normal form. 15/700 useless extension candidates. Maximal degree in co-relation 1213. Up to 492 conditions per place. [2024-02-07 19:22:55,802 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 36 selfloop transitions, 2 changer transitions 3/48 dead transitions. [2024-02-07 19:22:55,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 207 flow [2024-02-07 19:22:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:22:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:22:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-02-07 19:22:55,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2024-02-07 19:22:55,806 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 106 flow. Second operand 3 states and 76 transitions. [2024-02-07 19:22:55,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 207 flow [2024-02-07 19:22:55,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:55,808 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 105 flow [2024-02-07 19:22:55,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2024-02-07 19:22:55,810 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-02-07 19:22:55,810 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 105 flow [2024-02-07 19:22:55,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:55,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:55,810 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:55,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 19:22:55,811 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:55,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:55,811 INFO L85 PathProgramCache]: Analyzing trace with hash 408043371, now seen corresponding path program 1 times [2024-02-07 19:22:55,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:55,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044861836] [2024-02-07 19:22:55,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:55,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:55,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:55,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044861836] [2024-02-07 19:22:55,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044861836] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:22:55,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184189058] [2024-02-07 19:22:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:55,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:22:55,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:22:55,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:22:55,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-07 19:22:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:56,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 19:22:56,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:22:56,073 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-02-07 19:22:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,149 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:22:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184189058] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:22:56,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:22:56,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-02-07 19:22:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140670302] [2024-02-07 19:22:56,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:22:56,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-07 19:22:56,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:56,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-07 19:22:56,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-02-07 19:22:56,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:56,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 105 flow. Second operand has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:56,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:56,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:56,526 INFO L124 PetriNetUnfolderBase]: 994/2078 cut-off events. [2024-02-07 19:22:56,526 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2024-02-07 19:22:56,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 2078 events. 994/2078 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 11639 event pairs, 81 based on Foata normal form. 0/1968 useless extension candidates. Maximal degree in co-relation 3699. Up to 383 conditions per place. [2024-02-07 19:22:56,536 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 142 selfloop transitions, 18 changer transitions 3/174 dead transitions. [2024-02-07 19:22:56,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 174 transitions, 764 flow [2024-02-07 19:22:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 19:22:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 19:22:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 347 transitions. [2024-02-07 19:22:56,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6884920634920635 [2024-02-07 19:22:56,538 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 105 flow. Second operand 12 states and 347 transitions. [2024-02-07 19:22:56,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 174 transitions, 764 flow [2024-02-07 19:22:56,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 174 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:56,541 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 250 flow [2024-02-07 19:22:56,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=250, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-02-07 19:22:56,542 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2024-02-07 19:22:56,542 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 250 flow [2024-02-07 19:22:56,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.444444444444443) internal successors, (166), 9 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:56,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:56,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-07 19:22:56,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:22:56,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:56,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:56,751 INFO L85 PathProgramCache]: Analyzing trace with hash -734573376, now seen corresponding path program 1 times [2024-02-07 19:22:56,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:56,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715965928] [2024-02-07 19:22:56,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:56,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715965928] [2024-02-07 19:22:56,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715965928] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:56,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:56,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 19:22:56,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935853822] [2024-02-07 19:22:56,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:56,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 19:22:56,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:56,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 19:22:56,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 19:22:56,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:56,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:56,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:56,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:56,960 INFO L124 PetriNetUnfolderBase]: 593/1357 cut-off events. [2024-02-07 19:22:56,960 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-02-07 19:22:56,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 1357 events. 593/1357 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7092 event pairs, 198 based on Foata normal form. 60/1396 useless extension candidates. Maximal degree in co-relation 2865. Up to 607 conditions per place. [2024-02-07 19:22:56,965 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 44 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-02-07 19:22:56,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 328 flow [2024-02-07 19:22:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 19:22:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 19:22:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 19:22:56,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-02-07 19:22:56,967 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 250 flow. Second operand 3 states and 81 transitions. [2024-02-07 19:22:56,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 328 flow [2024-02-07 19:22:56,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 298 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-02-07 19:22:56,971 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 185 flow [2024-02-07 19:22:56,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-02-07 19:22:56,972 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2024-02-07 19:22:56,972 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 185 flow [2024-02-07 19:22:56,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:56,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:56,973 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-02-07 19:22:56,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 19:22:56,973 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:56,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:56,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1257846231, now seen corresponding path program 1 times [2024-02-07 19:22:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:56,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688270786] [2024-02-07 19:22:56,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:56,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:57,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:57,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688270786] [2024-02-07 19:22:57,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688270786] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 19:22:57,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 19:22:57,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 19:22:57,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824948946] [2024-02-07 19:22:57,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 19:22:57,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 19:22:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:57,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 19:22:57,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 19:22:57,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:57,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:57,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:57,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:57,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:57,463 INFO L124 PetriNetUnfolderBase]: 651/1460 cut-off events. [2024-02-07 19:22:57,463 INFO L125 PetriNetUnfolderBase]: For 465/465 co-relation queries the response was YES. [2024-02-07 19:22:57,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 1460 events. 651/1460 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7760 event pairs, 162 based on Foata normal form. 0/1431 useless extension candidates. Maximal degree in co-relation 2872. Up to 878 conditions per place. [2024-02-07 19:22:57,468 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 62 selfloop transitions, 5 changer transitions 3/81 dead transitions. [2024-02-07 19:22:57,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 417 flow [2024-02-07 19:22:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 19:22:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 19:22:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-02-07 19:22:57,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-02-07 19:22:57,470 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 185 flow. Second operand 5 states and 134 transitions. [2024-02-07 19:22:57,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 417 flow [2024-02-07 19:22:57,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 19:22:57,473 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 217 flow [2024-02-07 19:22:57,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-02-07 19:22:57,473 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2024-02-07 19:22:57,474 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 217 flow [2024-02-07 19:22:57,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:57,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:57,474 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:57,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 19:22:57,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:57,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:57,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1774331902, now seen corresponding path program 1 times [2024-02-07 19:22:57,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:57,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381495176] [2024-02-07 19:22:57,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:57,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:57,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:57,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 19:22:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381495176] [2024-02-07 19:22:57,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381495176] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 19:22:57,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782802880] [2024-02-07 19:22:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:57,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 19:22:57,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 19:22:57,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-07 19:22:57,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-07 19:22:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 19:22:57,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-07 19:22:57,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 19:22:57,938 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-02-07 19:22:57,979 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-02-07 19:22:58,070 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-02-07 19:22:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:58,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 19:22:58,468 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-02-07 19:22:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-07 19:22:58,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782802880] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 19:22:58,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 19:22:58,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-02-07 19:22:58,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811874244] [2024-02-07 19:22:58,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 19:22:58,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-02-07 19:22:58,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 19:22:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-02-07 19:22:58,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-02-07 19:22:58,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 19:22:58,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 217 flow. Second operand has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:58,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 19:22:58,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 19:22:58,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 19:22:59,147 INFO L124 PetriNetUnfolderBase]: 1235/2794 cut-off events. [2024-02-07 19:22:59,148 INFO L125 PetriNetUnfolderBase]: For 1168/1168 co-relation queries the response was YES. [2024-02-07 19:22:59,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6173 conditions, 2794 events. 1235/2794 cut-off events. For 1168/1168 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 16512 event pairs, 258 based on Foata normal form. 0/2752 useless extension candidates. Maximal degree in co-relation 4917. Up to 415 conditions per place. [2024-02-07 19:22:59,161 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 144 selfloop transitions, 28 changer transitions 0/183 dead transitions. [2024-02-07 19:22:59,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 183 transitions, 976 flow [2024-02-07 19:22:59,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 19:22:59,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 19:22:59,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 338 transitions. [2024-02-07 19:22:59,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6706349206349206 [2024-02-07 19:22:59,163 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 217 flow. Second operand 12 states and 338 transitions. [2024-02-07 19:22:59,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 183 transitions, 976 flow [2024-02-07 19:22:59,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 183 transitions, 971 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 19:22:59,171 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 369 flow [2024-02-07 19:22:59,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=369, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2024-02-07 19:22:59,171 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2024-02-07 19:22:59,171 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 369 flow [2024-02-07 19:22:59,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.857142857142858) internal successors, (264), 14 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-07 19:22:59,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 19:22:59,172 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:59,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-07 19:22:59,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-07 19:22:59,384 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 19:22:59,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 19:22:59,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2101428351, now seen corresponding path program 1 times [2024-02-07 19:22:59,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 19:22:59,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341202407] [2024-02-07 19:22:59,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 19:22:59,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 19:22:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:22:59,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 19:22:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 19:22:59,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 19:22:59,526 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 19:22:59,527 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2024-02-07 19:22:59,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 12 remaining) [2024-02-07 19:22:59,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 12 remaining) [2024-02-07 19:22:59,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2024-02-07 19:22:59,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 12 remaining) [2024-02-07 19:22:59,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 12 remaining) [2024-02-07 19:22:59,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 12 remaining) [2024-02-07 19:22:59,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2024-02-07 19:22:59,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2024-02-07 19:22:59,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 12 remaining) [2024-02-07 19:22:59,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 12 remaining) [2024-02-07 19:22:59,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 12 remaining) [2024-02-07 19:22:59,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 19:22:59,533 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 19:22:59,537 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 19:22:59,537 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 19:22:59,594 INFO L503 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-02-07 19:22:59,594 INFO L504 ceAbstractionStarter]: WitnessConsidered=3 [2024-02-07 19:22:59,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 07:22:59 BasicIcfg [2024-02-07 19:22:59,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 19:22:59,595 INFO L158 Benchmark]: Toolchain (without parser) took 6438.89ms. Allocated memory was 153.1MB in the beginning and 339.7MB in the end (delta: 186.6MB). Free memory was 123.7MB in the beginning and 287.4MB in the end (delta: -163.7MB). Peak memory consumption was 172.7MB. Max. memory is 16.1GB. [2024-02-07 19:22:59,595 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:22:59,596 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 19:22:59,596 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.20ms. Allocated memory is still 153.1MB. Free memory was 123.7MB in the beginning and 89.7MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 19:22:59,596 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.69ms. Allocated memory is still 153.1MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 19:22:59,597 INFO L158 Benchmark]: Boogie Preprocessor took 39.63ms. Allocated memory is still 153.1MB. Free memory was 86.9MB in the beginning and 84.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 19:22:59,597 INFO L158 Benchmark]: RCFGBuilder took 533.04ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 107.8MB in the end (delta: -23.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2024-02-07 19:22:59,598 INFO L158 Benchmark]: TraceAbstraction took 5233.25ms. Allocated memory was 153.1MB in the beginning and 339.7MB in the end (delta: 186.6MB). Free memory was 106.9MB in the beginning and 287.4MB in the end (delta: -180.5MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. [2024-02-07 19:22:59,601 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 591.20ms. Allocated memory is still 153.1MB. Free memory was 123.7MB in the beginning and 89.7MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.69ms. Allocated memory is still 153.1MB. Free memory was 89.7MB in the beginning and 86.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.63ms. Allocated memory is still 153.1MB. Free memory was 86.9MB in the beginning and 84.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 533.04ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 107.8MB in the end (delta: -23.7MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5233.25ms. Allocated memory was 153.1MB in the beginning and 339.7MB in the end (delta: 186.6MB). Free memory was 106.9MB in the beginning and 287.4MB in the end (delta: -180.5MB). Peak memory consumption was 156.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [L936] 0 static unsigned int arr[(5)]; [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); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={6:0}, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={6:0}, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1000] 1 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L1010] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] 2 CodeAnnotStmt[Assertion[BinaryExpression[LOGICOR,BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[0]]],BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]]] VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: 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: 1024]: 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: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 68 locations, 12 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: 5.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 559 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1116 IncrementalHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 11 mSDtfsCounter, 1116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=7, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 8 QuantifiedInterpolants, 1880 SizeOfPredicates, 21 NumberOfNonLiveVariables, 370 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 0/33 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-02-07 19:22:59,623 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