./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/stack_longest-1.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_longest-1.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 958ec4d9 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_longest-1.i ./goblint.2024-02-07_10-47-16.files/SV-COMP24_unreach-call/stack_longest-1.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-dev-958ec4d-m [2024-02-07 14:44:02,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-07 14:44:02,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-07 14:44:02,523 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-07 14:44:02,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-07 14:44:02,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-07 14:44:02,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-07 14:44:02,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-07 14:44:02,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-07 14:44:02,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-07 14:44:02,542 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-07 14:44:02,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-07 14:44:02,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-07 14:44:02,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-07 14:44:02,544 INFO L153 SettingsManager]: * Use SBE=true [2024-02-07 14:44:02,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-07 14:44:02,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-07 14:44:02,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-07 14:44:02,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-07 14:44:02,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-07 14:44:02,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-07 14:44:02,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-07 14:44:02,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-07 14:44:02,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-07 14:44:02,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-07 14:44:02,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-07 14:44:02,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-07 14:44:02,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-07 14:44:02,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-07 14:44:02,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-07 14:44:02,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-07 14:44:02,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-07 14:44:02,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:44:02,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-07 14:44:02,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-07 14:44:02,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-07 14:44:02,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-07 14:44:02,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-07 14:44:02,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-07 14:44:02,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-07 14:44:02,553 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-07 14:44:02,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-07 14:44:02,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-07 14:44:02,553 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 14:44:02,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-07 14:44:02,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-07 14:44:02,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-07 14:44:02,789 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-02-07 14:44:02,790 INFO L274 PluginConnector]: Witness Parser initialized [2024-02-07 14:44:02,790 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_longest-1.yml/witness.yml [2024-02-07 14:44:02,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-07 14:44:02,850 INFO L274 PluginConnector]: CDTParser initialized [2024-02-07 14:44:02,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2024-02-07 14:44:03,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-07 14:44:04,302 INFO L384 CDTParser]: Found 1 translation units. [2024-02-07 14:44:04,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2024-02-07 14:44:04,318 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12e7b68a/82dbc000e2a747efbb6213cb1d8b39b6/FLAG0bb3057a4 [2024-02-07 14:44:04,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d12e7b68a/82dbc000e2a747efbb6213cb1d8b39b6 [2024-02-07 14:44:04,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-07 14:44:04,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-07 14:44:04,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-07 14:44:04,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-07 14:44:04,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-07 14:44:04,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:44:02" (1/2) ... [2024-02-07 14:44:04,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a48497e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:44:04, skipping insertion in model container [2024-02-07 14:44:04,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:44:02" (1/2) ... [2024-02-07 14:44:04,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@588248e1 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 07.02 02:44:04, skipping insertion in model container [2024-02-07 14:44:04,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:44:04" (2/2) ... [2024-02-07 14:44:04,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a48497e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04, skipping insertion in model container [2024-02-07 14:44:04,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 02:44:04" (2/2) ... [2024-02-07 14:44:04,343 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-02-07 14:44:04,366 INFO L74 edCorrectnessWitness]: Found the following entries in the witness: [2024-02-07 14:44:04,367 INFO L76 edCorrectnessWitness]: Location invariant before [L999-L999] flag == (_Bool)1 [2024-02-07 14:44:04,367 INFO L76 edCorrectnessWitness]: Location invariant before [L1012-L1012] flag == (_Bool)1 [2024-02-07 14:44:04,367 INFO L76 edCorrectnessWitness]: Location invariant before [L1009-L1009] flag == (_Bool)0 || flag == (_Bool)1 [2024-02-07 14:44:04,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2024-02-07 14:44:04,719 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_longest-1.i[41530,41543] [2024-02-07 14:44:04,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:44:04,751 INFO L203 MainTranslator]: Completed pre-run [2024-02-07 14:44:04,778 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_longest-1.i[41530,41543] Start Parsing Local Start Parsing Local Start Parsing Local [2024-02-07 14:44:04,808 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-07 14:44:04,856 INFO L207 MainTranslator]: Completed translation [2024-02-07 14:44:04,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04 WrapperNode [2024-02-07 14:44:04,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-07 14:44:04,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-07 14:44:04,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-07 14:44:04,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-07 14:44:04,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,923 INFO L138 Inliner]: procedures = 278, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 166 [2024-02-07 14:44:04,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-07 14:44:04,925 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-07 14:44:04,925 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-07 14:44:04,925 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-07 14:44:04,934 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,948 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,964 INFO L175 MemorySlicer]: Split 14 memory accesses to 5 slices as follows [2, 2, 2, 5, 3]. 36 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 0, 5, 0]. The 4 writes are split as follows [0, 1, 1, 0, 2]. [2024-02-07 14:44:04,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:04,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-07 14:44:04,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-07 14:44:04,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-07 14:44:04,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-07 14:44:04,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (1/1) ... [2024-02-07 14:44:05,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-07 14:44:05,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:44:05,023 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 14:44:05,049 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 14:44:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-02-07 14:44:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-02-07 14:44:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-02-07 14:44:05,060 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-02-07 14:44:05,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-07 14:44:05,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-07 14:44:05,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-07 14:44:05,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-07 14:44:05,063 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 14:44:05,195 INFO L244 CfgBuilder]: Building ICFG [2024-02-07 14:44:05,197 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-07 14:44:05,396 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-07 14:44:05,396 INFO L293 CfgBuilder]: Performing block encoding [2024-02-07 14:44:05,604 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-07 14:44:05,604 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-07 14:44:05,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:44:05 BoogieIcfgContainer [2024-02-07 14:44:05,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-07 14:44:05,608 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-07 14:44:05,608 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-07 14:44:05,611 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-07 14:44:05,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 07.02 02:44:02" (1/4) ... [2024-02-07 14:44:05,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c69e518 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 07.02 02:44:05, skipping insertion in model container [2024-02-07 14:44:05,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 02:44:04" (2/4) ... [2024-02-07 14:44:05,613 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c69e518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:44:05, skipping insertion in model container [2024-02-07 14:44:05,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 02:44:04" (3/4) ... [2024-02-07 14:44:05,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c69e518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 02:44:05, skipping insertion in model container [2024-02-07 14:44:05,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.02 02:44:05" (4/4) ... [2024-02-07 14:44:05,615 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2024-02-07 14:44:05,629 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-07 14:44:05,629 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-02-07 14:44:05,629 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-07 14:44:05,680 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-07 14:44:05,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 98 flow [2024-02-07 14:44:05,751 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2024-02-07 14:44:05,751 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-07 14:44:05,755 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 91 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 14:44:05,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 42 transitions, 98 flow [2024-02-07 14:44:05,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 85 flow [2024-02-07 14:44:05,766 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-07 14:44:05,772 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;@475840ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-07 14:44:05,772 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-02-07 14:44:05,777 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-07 14:44:05,778 INFO L124 PetriNetUnfolderBase]: 1/18 cut-off events. [2024-02-07 14:44:05,778 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-07 14:44:05,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:05,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:05,779 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 14:44:05,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1500794892, now seen corresponding path program 1 times [2024-02-07 14:44:05,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:05,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997258265] [2024-02-07 14:44:05,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:06,177 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 14:44:06,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:06,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997258265] [2024-02-07 14:44:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997258265] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:06,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:44:06,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969389048] [2024-02-07 14:44:06,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:06,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-07 14:44:06,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:06,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-07 14:44:06,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-07 14:44:06,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 14:44:06,217 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 14:44:06,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:06,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 14:44:06,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:06,453 INFO L124 PetriNetUnfolderBase]: 360/763 cut-off events. [2024-02-07 14:44:06,453 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-02-07 14:44:06,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1409 conditions, 763 events. 360/763 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4023 event pairs, 82 based on Foata normal form. 46/722 useless extension candidates. Maximal degree in co-relation 1244. Up to 375 conditions per place. [2024-02-07 14:44:06,463 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 48 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-02-07 14:44:06,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 64 transitions, 248 flow [2024-02-07 14:44:06,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-07 14:44:06,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-07 14:44:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-02-07 14:44:06,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2024-02-07 14:44:06,477 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 85 flow. Second operand 4 states and 116 transitions. [2024-02-07 14:44:06,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 64 transitions, 248 flow [2024-02-07 14:44:06,481 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 14:44:06,485 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 96 flow [2024-02-07 14:44:06,487 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 14:44:06,490 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2024-02-07 14:44:06,490 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 96 flow [2024-02-07 14:44:06,491 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 14:44:06,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:06,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:06,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-07 14:44:06,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 14:44:06,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1097704522, now seen corresponding path program 1 times [2024-02-07 14:44:06,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:06,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839702045] [2024-02-07 14:44:06,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:06,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:06,577 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 14:44:06,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:06,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839702045] [2024-02-07 14:44:06,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839702045] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:06,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-02-07 14:44:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693641286] [2024-02-07 14:44:06,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:06,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:44:06,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:06,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:44:06,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:44:06,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 42 [2024-02-07 14:44:06,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 96 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 14:44:06,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:06,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 42 [2024-02-07 14:44:06,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:06,745 INFO L124 PetriNetUnfolderBase]: 441/856 cut-off events. [2024-02-07 14:44:06,745 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-02-07 14:44:06,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 856 events. 441/856 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4184 event pairs, 177 based on Foata normal form. 19/826 useless extension candidates. Maximal degree in co-relation 1352. Up to 559 conditions per place. [2024-02-07 14:44:06,749 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 37 selfloop transitions, 2 changer transitions 3/51 dead transitions. [2024-02-07 14:44:06,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 209 flow [2024-02-07 14:44:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:44:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:44:06,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-02-07 14:44:06,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2024-02-07 14:44:06,750 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 96 flow. Second operand 3 states and 77 transitions. [2024-02-07 14:44:06,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 209 flow [2024-02-07 14:44:06,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:44:06,752 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 108 flow [2024-02-07 14:44:06,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2024-02-07 14:44:06,753 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2024-02-07 14:44:06,753 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 39 transitions, 108 flow [2024-02-07 14:44:06,753 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 14:44:06,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:06,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:06,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-07 14:44:06,753 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 10 more)] === [2024-02-07 14:44:06,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash -719997158, now seen corresponding path program 1 times [2024-02-07 14:44:06,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:06,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332011242] [2024-02-07 14:44:06,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:06,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:06,809 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 14:44:06,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:06,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332011242] [2024-02-07 14:44:06,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332011242] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:06,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:06,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-07 14:44:06,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988462433] [2024-02-07 14:44:06,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:06,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:44:06,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:06,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:44:06,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:44:06,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 42 [2024-02-07 14:44:06,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 39 transitions, 108 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 14:44:06,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:06,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 42 [2024-02-07 14:44:06,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:06,918 INFO L124 PetriNetUnfolderBase]: 357/720 cut-off events. [2024-02-07 14:44:06,918 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-02-07 14:44:06,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1531 conditions, 720 events. 357/720 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3310 event pairs, 137 based on Foata normal form. 72/749 useless extension candidates. Maximal degree in co-relation 1106. Up to 398 conditions per place. [2024-02-07 14:44:06,921 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 36 selfloop transitions, 1 changer transitions 3/48 dead transitions. [2024-02-07 14:44:06,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 48 transitions, 207 flow [2024-02-07 14:44:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:44:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:44:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-02-07 14:44:06,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2024-02-07 14:44:06,923 INFO L175 Difference]: Start difference. First operand has 44 places, 39 transitions, 108 flow. Second operand 3 states and 74 transitions. [2024-02-07 14:44:06,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 48 transitions, 207 flow [2024-02-07 14:44:06,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:44:06,925 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 103 flow [2024-02-07 14:44:06,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2024-02-07 14:44:06,925 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-02-07 14:44:06,926 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 103 flow [2024-02-07 14:44:06,926 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 14:44:06,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:06,926 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:06,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-07 14:44:06,926 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 14:44:06,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash -439063899, now seen corresponding path program 1 times [2024-02-07 14:44:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115072896] [2024-02-07 14:44:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:06,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:07,054 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 14:44:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115072896] [2024-02-07 14:44:07,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115072896] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:44:07,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779388767] [2024-02-07 14:44:07,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:07,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:44:07,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:44:07,061 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 14:44:07,086 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 14:44:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:07,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-07 14:44:07,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:44:07,212 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 14:44:07,276 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 14:44:07,277 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:44:07,342 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 14:44:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779388767] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:44:07,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:44:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-02-07 14:44:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691899801] [2024-02-07 14:44:07,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:44:07,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-07 14:44:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-07 14:44:07,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-02-07 14:44:07,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 14:44:07,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 103 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 14:44:07,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:07,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 14:44:07,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:07,774 INFO L124 PetriNetUnfolderBase]: 1009/2134 cut-off events. [2024-02-07 14:44:07,774 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2024-02-07 14:44:07,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4350 conditions, 2134 events. 1009/2134 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 12019 event pairs, 83 based on Foata normal form. 0/2033 useless extension candidates. Maximal degree in co-relation 3754. Up to 408 conditions per place. [2024-02-07 14:44:07,784 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 142 selfloop transitions, 18 changer transitions 3/174 dead transitions. [2024-02-07 14:44:07,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 174 transitions, 762 flow [2024-02-07 14:44:07,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 14:44:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 14:44:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 347 transitions. [2024-02-07 14:44:07,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6884920634920635 [2024-02-07 14:44:07,788 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 103 flow. Second operand 12 states and 347 transitions. [2024-02-07 14:44:07,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 174 transitions, 762 flow [2024-02-07 14:44:07,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 174 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:44:07,793 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 249 flow [2024-02-07 14:44:07,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=42, 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=249, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-02-07 14:44:07,793 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-02-07 14:44:07,794 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 249 flow [2024-02-07 14:44:07,794 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 14:44:07,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:07,794 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 14:44:07,809 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 14:44:08,006 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 14:44:08,007 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 14:44:08,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1086110993, now seen corresponding path program 1 times [2024-02-07 14:44:08,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654930342] [2024-02-07 14:44:08,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,064 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 14:44:08,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654930342] [2024-02-07 14:44:08,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654930342] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-07 14:44:08,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602638265] [2024-02-07 14:44:08,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-07 14:44:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-07 14:44:08,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-07 14:44:08,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 14:44:08,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 249 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 14:44:08,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 14:44:08,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,222 INFO L124 PetriNetUnfolderBase]: 593/1362 cut-off events. [2024-02-07 14:44:08,222 INFO L125 PetriNetUnfolderBase]: For 477/477 co-relation queries the response was YES. [2024-02-07 14:44:08,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 1362 events. 593/1362 cut-off events. For 477/477 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7040 event pairs, 198 based on Foata normal form. 60/1405 useless extension candidates. Maximal degree in co-relation 2860. Up to 607 conditions per place. [2024-02-07 14:44:08,230 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 44 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2024-02-07 14:44:08,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 59 transitions, 327 flow [2024-02-07 14:44:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-07 14:44:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-07 14:44:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2024-02-07 14:44:08,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2024-02-07 14:44:08,231 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 249 flow. Second operand 3 states and 81 transitions. [2024-02-07 14:44:08,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 59 transitions, 327 flow [2024-02-07 14:44:08,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 303 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-02-07 14:44:08,238 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 190 flow [2024-02-07 14:44:08,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=190, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2024-02-07 14:44:08,240 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2024-02-07 14:44:08,240 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 190 flow [2024-02-07 14:44:08,240 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 14:44:08,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,240 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 14:44:08,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-07 14:44:08,241 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 14:44:08,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,241 INFO L85 PathProgramCache]: Analyzing trace with hash 295389780, now seen corresponding path program 1 times [2024-02-07 14:44:08,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965739543] [2024-02-07 14:44:08,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:08,630 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 14:44:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:08,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965739543] [2024-02-07 14:44:08,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965739543] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-07 14:44:08,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-07 14:44:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-07 14:44:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279947357] [2024-02-07 14:44:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-07 14:44:08,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-07 14:44:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-07 14:44:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-07 14:44:08,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 14:44:08,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 190 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 14:44:08,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:08,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 14:44:08,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:08,838 INFO L124 PetriNetUnfolderBase]: 651/1474 cut-off events. [2024-02-07 14:44:08,838 INFO L125 PetriNetUnfolderBase]: For 509/509 co-relation queries the response was YES. [2024-02-07 14:44:08,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1474 events. 651/1474 cut-off events. For 509/509 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 7845 event pairs, 162 based on Foata normal form. 0/1451 useless extension candidates. Maximal degree in co-relation 2903. Up to 878 conditions per place. [2024-02-07 14:44:08,845 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 62 selfloop transitions, 5 changer transitions 3/81 dead transitions. [2024-02-07 14:44:08,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 422 flow [2024-02-07 14:44:08,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-07 14:44:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-07 14:44:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-02-07 14:44:08,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-02-07 14:44:08,846 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 190 flow. Second operand 5 states and 134 transitions. [2024-02-07 14:44:08,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 422 flow [2024-02-07 14:44:08,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 81 transitions, 412 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-02-07 14:44:08,849 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 222 flow [2024-02-07 14:44:08,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=222, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2024-02-07 14:44:08,849 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2024-02-07 14:44:08,849 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 222 flow [2024-02-07 14:44:08,850 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 14:44:08,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:08,850 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 14:44:08,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-07 14:44:08,850 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 14:44:08,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -878511727, now seen corresponding path program 1 times [2024-02-07 14:44:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:08,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027958057] [2024-02-07 14:44:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:09,184 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 14:44:09,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-07 14:44:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027958057] [2024-02-07 14:44:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027958057] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-07 14:44:09,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896473262] [2024-02-07 14:44:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:09,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-07 14:44:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-07 14:44:09,187 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 14:44:09,211 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 14:44:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-07 14:44:09,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-07 14:44:09,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-07 14:44:09,315 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 14:44:09,360 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 14:44:09,431 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 14:44:09,470 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 14:44:09,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-07 14:44:09,831 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 14:44:09,879 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 14:44:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896473262] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-07 14:44:09,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-07 14:44:09,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-02-07 14:44:09,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931570869] [2024-02-07 14:44:09,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-07 14:44:09,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-07 14:44:09,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-07 14:44:09,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-07 14:44:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-02-07 14:44:09,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 42 [2024-02-07 14:44:09,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 222 flow. Second operand has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 states have internal predecessors, (242), 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 14:44:09,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-07 14:44:09,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 42 [2024-02-07 14:44:09,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-07 14:44:10,444 INFO L124 PetriNetUnfolderBase]: 1198/2725 cut-off events. [2024-02-07 14:44:10,444 INFO L125 PetriNetUnfolderBase]: For 1276/1276 co-relation queries the response was YES. [2024-02-07 14:44:10,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 2725 events. 1198/2725 cut-off events. For 1276/1276 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 16096 event pairs, 258 based on Foata normal form. 0/2689 useless extension candidates. Maximal degree in co-relation 4886. Up to 415 conditions per place. [2024-02-07 14:44:10,456 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 142 selfloop transitions, 27 changer transitions 0/180 dead transitions. [2024-02-07 14:44:10,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 180 transitions, 981 flow [2024-02-07 14:44:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-07 14:44:10,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-07 14:44:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 335 transitions. [2024-02-07 14:44:10,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6646825396825397 [2024-02-07 14:44:10,459 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 222 flow. Second operand 12 states and 335 transitions. [2024-02-07 14:44:10,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 180 transitions, 981 flow [2024-02-07 14:44:10,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 180 transitions, 976 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-02-07 14:44:10,465 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 388 flow [2024-02-07 14:44:10,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, 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=388, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2024-02-07 14:44:10,465 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2024-02-07 14:44:10,466 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 388 flow [2024-02-07 14:44:10,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 18.615384615384617) internal successors, (242), 13 states have internal predecessors, (242), 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 14:44:10,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-02-07 14:44:10,466 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 14:44:10,482 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 14:44:10,682 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 14:44:10,683 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 14:44:10,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-07 14:44:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2098065904, now seen corresponding path program 1 times [2024-02-07 14:44:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-07 14:44:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203353481] [2024-02-07 14:44:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-07 14:44:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-07 14:44:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:44:10,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-07 14:44:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-07 14:44:10,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-07 14:44:10,746 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-02-07 14:44:10,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err2ASSERT_VIOLATIONERROR_FUNCTION (11 of 12 remaining) [2024-02-07 14:44:10,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 12 remaining) [2024-02-07 14:44:10,748 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 12 remaining) [2024-02-07 14:44:10,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (8 of 12 remaining) [2024-02-07 14:44:10,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 12 remaining) [2024-02-07 14:44:10,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (6 of 12 remaining) [2024-02-07 14:44:10,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 12 remaining) [2024-02-07 14:44:10,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err2ASSERT_VIOLATIONERROR_FUNCTION (4 of 12 remaining) [2024-02-07 14:44:10,749 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 12 remaining) [2024-02-07 14:44:10,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 12 remaining) [2024-02-07 14:44:10,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 12 remaining) [2024-02-07 14:44:10,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err1ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 12 remaining) [2024-02-07 14:44:10,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-07 14:44:10,750 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-02-07 14:44:10,755 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-07 14:44:10,755 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-02-07 14:44:10,786 INFO L503 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-02-07 14:44:10,786 INFO L504 ceAbstractionStarter]: WitnessConsidered=3 [2024-02-07 14:44:10,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 02:44:10 BasicIcfg [2024-02-07 14:44:10,787 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-07 14:44:10,787 INFO L158 Benchmark]: Toolchain (without parser) took 6457.16ms. Allocated memory was 140.5MB in the beginning and 318.8MB in the end (delta: 178.3MB). Free memory was 107.0MB in the beginning and 158.7MB in the end (delta: -51.7MB). Peak memory consumption was 128.1MB. Max. memory is 16.1GB. [2024-02-07 14:44:10,787 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 37.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:44:10,787 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 92.3MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-07 14:44:10,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.63ms. Allocated memory is still 140.5MB. Free memory was 107.0MB in the beginning and 73.1MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-02-07 14:44:10,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.93ms. Allocated memory is still 140.5MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-02-07 14:44:10,788 INFO L158 Benchmark]: Boogie Preprocessor took 72.09ms. Allocated memory is still 140.5MB. Free memory was 70.4MB in the beginning and 67.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-07 14:44:10,788 INFO L158 Benchmark]: RCFGBuilder took 608.36ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 67.3MB in the beginning and 113.1MB in the end (delta: -45.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-02-07 14:44:10,789 INFO L158 Benchmark]: TraceAbstraction took 5178.64ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 113.1MB in the beginning and 158.7MB in the end (delta: -45.6MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2024-02-07 14:44:10,790 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.16ms. Allocated memory is still 92.3MB. Free memory is still 37.4MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.33ms. Allocated memory is still 92.3MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.63ms. Allocated memory is still 140.5MB. Free memory was 107.0MB in the beginning and 73.1MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.93ms. Allocated memory is still 140.5MB. Free memory was 73.1MB in the beginning and 70.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.09ms. Allocated memory is still 140.5MB. Free memory was 70.4MB in the beginning and 67.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 608.36ms. Allocated memory was 140.5MB in the beginning and 184.5MB in the end (delta: 44.0MB). Free memory was 67.3MB in the beginning and 113.1MB in the end (delta: -45.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5178.64ms. Allocated memory was 184.5MB in the beginning and 318.8MB in the end (delta: 134.2MB). Free memory was 113.1MB in the beginning and 158.7MB in the end (delta: -45.6MB). Peak memory consumption was 87.6MB. 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[(800)]; [L936] 0 static unsigned int arr[(800)]; [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); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L999] 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] [L1009] 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] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1009] 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] [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] 2 CodeAnnotStmt[Assertion[BinaryExpression[COMPEQ,IdentifierExpression[flag],CastExpression[ACSLType[_Bool],IntegerLiteral[1]]]]] [L1012] 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: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 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: 999]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 1012]: 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.0s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 517 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1105 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 10 mSDtfsCounter, 1105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred 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.9s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 190 ConstructedInterpolants, 8 QuantifiedInterpolants, 2088 SizeOfPredicates, 21 NumberOfNonLiveVariables, 354 ConjunctsInSsa, 16 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 14:44:10,811 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