./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-mts.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 80b1b132 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-mts.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-?-80b1b13-m [2024-01-31 17:09:57,503 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:09:57,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:09:57,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:09:57,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:09:57,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:09:57,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:09:57,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:09:57,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:09:57,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:09:57,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:09:57,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:09:57,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:09:57,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:09:57,594 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:09:57,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:09:57,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:09:57,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:09:57,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:09:57,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:09:57,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:09:57,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:09:57,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:09:57,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:09:57,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:09:57,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:09:57,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:09:57,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:09:57,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:09:57,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:09:57,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:09:57,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:09:57,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:09:57,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:09:57,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:09:57,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:09:57,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:09:57,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:09:57,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:09:57,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:09:57,599 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:09:57,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:09:57,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:09:57,599 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:09:57,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:09:57,873 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:09:57,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:09:57,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:09:57,875 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:09:57,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-01-31 17:09:58,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:09:58,988 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:09:58,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-01-31 17:09:59,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7db865f/b5fd962bbca44e0bbffc68be19118afb/FLAG4e2964451 [2024-01-31 17:09:59,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b7db865f/b5fd962bbca44e0bbffc68be19118afb [2024-01-31 17:09:59,016 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:09:59,016 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:09:59,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-mts.wvr.yml/witness.yml [2024-01-31 17:09:59,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:09:59,139 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:09:59,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:09:59,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:09:59,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:09:59,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:09:59" (1/2) ... [2024-01-31 17:09:59,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a4cdf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:09:59, skipping insertion in model container [2024-01-31 17:09:59,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:09:59" (1/2) ... [2024-01-31 17:09:59,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@75372af3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:09:59, skipping insertion in model container [2024-01-31 17:09:59,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:09:59" (2/2) ... [2024-01-31 17:09:59,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a4cdf8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59, skipping insertion in model container [2024-01-31 17:09:59,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:09:59" (2/2) ... [2024-01-31 17:09:59,147 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:09:59,186 INFO L93 nessWitnessExtractor]: Witness did not contain any usable entries. [2024-01-31 17:09:59,203 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:09:59,340 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2572,2585] [2024-01-31 17:09:59,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:09:59,355 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:09:59,369 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2572,2585] [2024-01-31 17:09:59,372 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:09:59,382 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:09:59,382 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59 WrapperNode [2024-01-31 17:09:59,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:09:59,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:09:59,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:09:59,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:09:59,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,427 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 234 [2024-01-31 17:09:59,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:09:59,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:09:59,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:09:59,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:09:59,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,456 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 2, 2, 8, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:09:59,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,470 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,472 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:09:59,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:09:59,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:09:59,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:09:59,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (1/1) ... [2024-01-31 17:09:59,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:09:59,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:09:59,494 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:09:59,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:09:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:09:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:09:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:09:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:09:59,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:09:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:09:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:09:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 17:09:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 17:09:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 17:09:59,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 17:09:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 17:09:59,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 17:09:59,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 17:09:59,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 17:09:59,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 17:09:59,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 17:09:59,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 17:09:59,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:09:59,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:09:59,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:09:59,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:09:59,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:09:59,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:09:59,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:09:59,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-31 17:09:59,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:09:59,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:09:59,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:09:59,563 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:09:59,651 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:09:59,653 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:09:59,884 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:09:59,885 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:10:00,117 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:10:00,118 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 17:10:00,119 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:10:00 BoogieIcfgContainer [2024-01-31 17:10:00,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:10:00,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:10:00,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:10:00,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:10:00,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:09:59" (1/4) ... [2024-01-31 17:10:00,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d417356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:10:00, skipping insertion in model container [2024-01-31 17:10:00,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:09:59" (2/4) ... [2024-01-31 17:10:00,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d417356 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:10:00, skipping insertion in model container [2024-01-31 17:10:00,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:09:59" (3/4) ... [2024-01-31 17:10:00,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d417356 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:10:00, skipping insertion in model container [2024-01-31 17:10:00,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:10:00" (4/4) ... [2024-01-31 17:10:00,126 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-01-31 17:10:00,139 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:10:00,139 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-31 17:10:00,139 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:10:00,192 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-31 17:10:00,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 83 flow [2024-01-31 17:10:00,299 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-01-31 17:10:00,300 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 17:10:00,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 20 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-01-31 17:10:00,302 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 83 flow [2024-01-31 17:10:00,304 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 27 transitions, 72 flow [2024-01-31 17:10:00,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:10:00,330 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;@46a7a7dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:10:00,331 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-31 17:10:00,342 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:10:00,342 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-01-31 17:10:00,343 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 17:10:00,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:10:00,343 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-01-31 17:10:00,344 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:10:00,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:10:00,348 INFO L85 PathProgramCache]: Analyzing trace with hash -524449101, now seen corresponding path program 1 times [2024-01-31 17:10:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:10:00,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028489125] [2024-01-31 17:10:00,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:10:00,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:10:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:10:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:10:00,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:10:00,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028489125] [2024-01-31 17:10:00,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028489125] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:10:00,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:10:00,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:10:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093859877] [2024-01-31 17:10:00,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:10:00,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:10:00,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:10:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:10:00,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:10:00,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-01-31 17:10:00,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:10:00,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:10:00,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-01-31 17:10:00,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:10:01,012 INFO L124 PetriNetUnfolderBase]: 488/738 cut-off events. [2024-01-31 17:10:01,013 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-01-31 17:10:01,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 738 events. 488/738 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2605 event pairs, 138 based on Foata normal form. 1/612 useless extension candidates. Maximal degree in co-relation 1176. Up to 474 conditions per place. [2024-01-31 17:10:01,021 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 39 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-01-31 17:10:01,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 213 flow [2024-01-31 17:10:01,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:10:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:10:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-01-31 17:10:01,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-01-31 17:10:01,032 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 72 flow. Second operand 3 states and 60 transitions. [2024-01-31 17:10:01,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 213 flow [2024-01-31 17:10:01,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 191 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-31 17:10:01,041 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 86 flow [2024-01-31 17:10:01,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2024-01-31 17:10:01,046 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2024-01-31 17:10:01,046 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 86 flow [2024-01-31 17:10:01,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:10:01,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:10:01,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:10:01,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:10:01,048 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:10:01,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:10:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1014919779, now seen corresponding path program 1 times [2024-01-31 17:10:01,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:10:01,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140724145] [2024-01-31 17:10:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:10:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:10:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:10:01,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:10:01,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:10:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140724145] [2024-01-31 17:10:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140724145] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:10:01,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:10:01,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:10:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797485454] [2024-01-31 17:10:01,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:10:01,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:10:01,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:10:01,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:10:01,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:10:01,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-01-31 17:10:01,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:10:01,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:10:01,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-01-31 17:10:01,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:10:01,304 INFO L124 PetriNetUnfolderBase]: 488/755 cut-off events. [2024-01-31 17:10:01,304 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2024-01-31 17:10:01,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 755 events. 488/755 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2657 event pairs, 321 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 557. Up to 718 conditions per place. [2024-01-31 17:10:01,307 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 27 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-01-31 17:10:01,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 31 transitions, 146 flow [2024-01-31 17:10:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:10:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:10:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-01-31 17:10:01,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-01-31 17:10:01,312 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 86 flow. Second operand 3 states and 42 transitions. [2024-01-31 17:10:01,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 31 transitions, 146 flow [2024-01-31 17:10:01,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:10:01,317 INFO L231 Difference]: Finished difference. Result has 32 places, 31 transitions, 94 flow [2024-01-31 17:10:01,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2024-01-31 17:10:01,318 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -1 predicate places. [2024-01-31 17:10:01,318 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 94 flow [2024-01-31 17:10:01,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:10:01,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:10:01,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:10:01,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:10:01,319 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:10:01,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:10:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 93359912, now seen corresponding path program 1 times [2024-01-31 17:10:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:10:01,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828379678] [2024-01-31 17:10:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:10:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:10:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:10:01,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:10:01,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:10:01,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828379678] [2024-01-31 17:10:01,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828379678] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:10:01,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:10:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:10:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196696349] [2024-01-31 17:10:01,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:10:01,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:10:01,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:10:01,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:10:01,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:10:01,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:10:01,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-01-31 17:10:01,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:10:01,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:10:01,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:10:01,518 INFO L124 PetriNetUnfolderBase]: 601/881 cut-off events. [2024-01-31 17:10:01,518 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2024-01-31 17:10:01,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2002 conditions, 881 events. 601/881 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2850 event pairs, 186 based on Foata normal form. 0/854 useless extension candidates. Maximal degree in co-relation 1989. Up to 468 conditions per place. [2024-01-31 17:10:01,522 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 40 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-01-31 17:10:01,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 220 flow [2024-01-31 17:10:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:10:01,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:10:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2024-01-31 17:10:01,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-01-31 17:10:01,525 INFO L175 Difference]: Start difference. First operand has 32 places, 31 transitions, 94 flow. Second operand 4 states and 55 transitions. [2024-01-31 17:10:01,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 220 flow [2024-01-31 17:10:01,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 214 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-31 17:10:01,527 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 109 flow [2024-01-31 17:10:01,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-01-31 17:10:01,529 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-01-31 17:10:01,529 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 109 flow [2024-01-31 17:10:01,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-01-31 17:10:01,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:10:01,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:10:01,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:10:01,530 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:10:01,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:10:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1732050716, now seen corresponding path program 1 times [2024-01-31 17:10:01,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:10:01,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376588088] [2024-01-31 17:10:01,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:10:01,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:10:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:10:01,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:10:01,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:10:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376588088] [2024-01-31 17:10:01,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376588088] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:10:01,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795894596] [2024-01-31 17:10:01,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:10:01,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:10:01,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:10:01,608 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-01-31 17:10:01,612 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-01-31 17:10:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:10:01,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2024-01-31 17:10:01,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:10:01,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:10:01,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:10:01,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:10:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795894596] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-31 17:10:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-01-31 17:10:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2024-01-31 17:10:01,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009270496] [2024-01-31 17:10:01,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:10:01,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:10:01,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:10:01,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:10:01,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:10:01,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-01-31 17:10:01,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:10:01,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:10:01,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-01-31 17:10:01,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:10:01,900 INFO L124 PetriNetUnfolderBase]: 472/718 cut-off events. [2024-01-31 17:10:01,900 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-01-31 17:10:01,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1864 conditions, 718 events. 472/718 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2400 event pairs, 222 based on Foata normal form. 50/768 useless extension candidates. Maximal degree in co-relation 1844. Up to 513 conditions per place. [2024-01-31 17:10:01,904 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 39 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2024-01-31 17:10:01,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 249 flow [2024-01-31 17:10:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-31 17:10:01,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-31 17:10:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2024-01-31 17:10:01,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-01-31 17:10:01,906 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 109 flow. Second operand 5 states and 65 transitions. [2024-01-31 17:10:01,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 249 flow [2024-01-31 17:10:01,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:10:01,909 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 126 flow [2024-01-31 17:10:01,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-01-31 17:10:01,911 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2024-01-31 17:10:01,911 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 126 flow [2024-01-31 17:10:01,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:10:01,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:10:01,911 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:10:01,926 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-01-31 17:10:02,126 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-01-31 17:10:02,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:10:02,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:10:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1255150857, now seen corresponding path program 1 times [2024-01-31 17:10:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:10:02,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966197318] [2024-01-31 17:10:02,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:10:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:10:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:10:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:10:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:10:02,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966197318] [2024-01-31 17:10:02,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966197318] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:10:02,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357531480] [2024-01-31 17:10:02,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:10:02,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:10:02,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:10:02,883 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-01-31 17:10:02,912 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-01-31 17:10:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:10:02,987 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-31 17:10:02,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:10:03,054 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 15 treesize of output 1 [2024-01-31 17:10:03,389 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 66 treesize of output 38 [2024-01-31 17:10:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:10:03,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:10:04,547 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 416 treesize of output 376 [2024-01-31 17:10:04,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:10:04,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 691 treesize of output 675 [2024-01-31 17:10:47,856 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-31 17:10:53,932 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-01-31 17:12:53,641 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 98 treesize of output 90 [2024-01-31 17:12:53,653 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-01-31 17:12:53,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 1 [2024-01-31 17:12:53,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:12:53,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357531480] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:12:53,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:12:53,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2024-01-31 17:12:53,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976588331] [2024-01-31 17:12:53,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:12:53,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-31 17:12:53,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:12:53,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-31 17:12:53,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-01-31 17:12:53,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-01-31 17:12:53,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 126 flow. Second operand has 23 states, 23 states have (on average 8.130434782608695) internal successors, (187), 23 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:12:53,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:12:53,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-01-31 17:12:53,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:12:54,633 INFO L124 PetriNetUnfolderBase]: 865/1356 cut-off events. [2024-01-31 17:12:54,635 INFO L125 PetriNetUnfolderBase]: For 915/933 co-relation queries the response was YES. [2024-01-31 17:12:54,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3787 conditions, 1356 events. 865/1356 cut-off events. For 915/933 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5648 event pairs, 58 based on Foata normal form. 19/1375 useless extension candidates. Maximal degree in co-relation 2882. Up to 765 conditions per place. [2024-01-31 17:12:54,643 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 81 selfloop transitions, 23 changer transitions 1/108 dead transitions. [2024-01-31 17:12:54,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 108 transitions, 574 flow [2024-01-31 17:12:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:12:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:12:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-01-31 17:12:54,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-01-31 17:12:54,647 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 126 flow. Second operand 10 states and 155 transitions. [2024-01-31 17:12:54,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 108 transitions, 574 flow [2024-01-31 17:12:54,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 108 transitions, 558 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-01-31 17:12:54,652 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 274 flow [2024-01-31 17:12:54,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2024-01-31 17:12:54,654 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2024-01-31 17:12:54,654 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 274 flow [2024-01-31 17:12:54,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.130434782608695) internal successors, (187), 23 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:12:54,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:12:54,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:12:54,666 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-01-31 17:12:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:12:54,868 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:12:54,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:12:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1098108613, now seen corresponding path program 2 times [2024-01-31 17:12:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:12:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091541135] [2024-01-31 17:12:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:12:54,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:12:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:12:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:12:55,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:12:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091541135] [2024-01-31 17:12:55,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091541135] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:12:55,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570619489] [2024-01-31 17:12:55,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:12:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:12:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:12:55,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:12:55,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-01-31 17:12:55,743 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 17:12:55,743 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:12:55,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjunts are in the unsatisfiable core [2024-01-31 17:12:55,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:12:55,774 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 15 treesize of output 1 [2024-01-31 17:12:56,143 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 66 treesize of output 38 [2024-01-31 17:12:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:12:56,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:12:57,157 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 69 treesize of output 61 [2024-01-31 17:12:57,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 92 treesize of output 84 [2024-01-31 17:12:57,211 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 96 treesize of output 86 [2024-01-31 17:12:57,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 125 treesize of output 115 [2024-01-31 17:12:57,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:12:57,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570619489] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:12:57,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:12:57,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2024-01-31 17:12:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697991244] [2024-01-31 17:12:57,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:12:57,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-31 17:12:57,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:12:57,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-31 17:12:57,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2024-01-31 17:12:57,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:12:57,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 274 flow. Second operand has 28 states, 28 states have (on average 6.678571428571429) internal successors, (187), 28 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:12:57,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:12:57,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:12:57,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:12:58,461 INFO L124 PetriNetUnfolderBase]: 1503/2214 cut-off events. [2024-01-31 17:12:58,462 INFO L125 PetriNetUnfolderBase]: For 2483/2483 co-relation queries the response was YES. [2024-01-31 17:12:58,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 2214 events. 1503/2214 cut-off events. For 2483/2483 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8940 event pairs, 252 based on Foata normal form. 2/2216 useless extension candidates. Maximal degree in co-relation 6132. Up to 1540 conditions per place. [2024-01-31 17:12:58,473 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 126 selfloop transitions, 62 changer transitions 2/191 dead transitions. [2024-01-31 17:12:58,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 191 transitions, 1216 flow [2024-01-31 17:12:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-01-31 17:12:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-01-31 17:12:58,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 264 transitions. [2024-01-31 17:12:58,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3870967741935484 [2024-01-31 17:12:58,475 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 274 flow. Second operand 22 states and 264 transitions. [2024-01-31 17:12:58,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 191 transitions, 1216 flow [2024-01-31 17:12:58,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 191 transitions, 1155 flow, removed 15 selfloop flow, removed 2 redundant places. [2024-01-31 17:12:58,480 INFO L231 Difference]: Finished difference. Result has 81 places, 100 transitions, 737 flow [2024-01-31 17:12:58,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=737, PETRI_PLACES=81, PETRI_TRANSITIONS=100} [2024-01-31 17:12:58,481 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 48 predicate places. [2024-01-31 17:12:58,481 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 100 transitions, 737 flow [2024-01-31 17:12:58,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.678571428571429) internal successors, (187), 28 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:12:58,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:12:58,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:12:58,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-31 17:12:58,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:12:58,696 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:12:58,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:12:58,697 INFO L85 PathProgramCache]: Analyzing trace with hash -150532185, now seen corresponding path program 3 times [2024-01-31 17:12:58,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:12:58,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603642460] [2024-01-31 17:12:58,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:12:58,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:12:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:12:59,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:12:59,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:12:59,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603642460] [2024-01-31 17:12:59,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603642460] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:12:59,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869171860] [2024-01-31 17:12:59,220 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-31 17:12:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:12:59,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:12:59,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:12:59,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-01-31 17:12:59,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-31 17:12:59,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:12:59,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 40 conjunts are in the unsatisfiable core [2024-01-31 17:12:59,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:12:59,344 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 15 treesize of output 1 [2024-01-31 17:12:59,562 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 66 treesize of output 38 [2024-01-31 17:12:59,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:12:59,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:13:01,006 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 183 treesize of output 165 [2024-01-31 17:13:01,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:13:01,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 261 [2024-01-31 17:13:02,771 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 118 treesize of output 108 [2024-01-31 17:13:02,793 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-01-31 17:13:02,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 135 [2024-01-31 17:13:03,174 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 251 treesize of output 227 [2024-01-31 17:13:03,207 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:13:03,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 423 treesize of output 387 [2024-01-31 17:13:04,793 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 60 treesize of output 54 [2024-01-31 17:13:04,801 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-01-31 17:13:04,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 1 [2024-01-31 17:13:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:04,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869171860] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:13:04,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:13:04,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-01-31 17:13:04,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865099894] [2024-01-31 17:13:04,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:13:04,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-01-31 17:13:04,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:13:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-01-31 17:13:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-01-31 17:13:04,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:13:04,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 100 transitions, 737 flow. Second operand has 22 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:04,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:13:04,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:13:04,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:13:05,830 INFO L124 PetriNetUnfolderBase]: 1739/2555 cut-off events. [2024-01-31 17:13:05,831 INFO L125 PetriNetUnfolderBase]: For 7974/7974 co-relation queries the response was YES. [2024-01-31 17:13:05,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10734 conditions, 2555 events. 1739/2555 cut-off events. For 7974/7974 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10586 event pairs, 443 based on Foata normal form. 1/2556 useless extension candidates. Maximal degree in co-relation 10468. Up to 2014 conditions per place. [2024-01-31 17:13:05,847 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 109 selfloop transitions, 46 changer transitions 1/157 dead transitions. [2024-01-31 17:13:05,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 157 transitions, 1344 flow [2024-01-31 17:13:05,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:13:05,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:13:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2024-01-31 17:13:05,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2024-01-31 17:13:05,849 INFO L175 Difference]: Start difference. First operand has 81 places, 100 transitions, 737 flow. Second operand 10 states and 137 transitions. [2024-01-31 17:13:05,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 157 transitions, 1344 flow [2024-01-31 17:13:05,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 157 transitions, 1263 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-01-31 17:13:05,860 INFO L231 Difference]: Finished difference. Result has 90 places, 111 transitions, 886 flow [2024-01-31 17:13:05,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=886, PETRI_PLACES=90, PETRI_TRANSITIONS=111} [2024-01-31 17:13:05,860 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 57 predicate places. [2024-01-31 17:13:05,860 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 111 transitions, 886 flow [2024-01-31 17:13:05,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:05,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:05,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:13:05,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-01-31 17:13:06,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:13:06,068 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:06,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:06,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1235581127, now seen corresponding path program 4 times [2024-01-31 17:13:06,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:13:06,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675353146] [2024-01-31 17:13:06,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:13:06,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:13:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:13:06,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:06,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:13:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675353146] [2024-01-31 17:13:06,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675353146] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:13:06,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421411941] [2024-01-31 17:13:06,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-31 17:13:06,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:13:06,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:13:06,701 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:13:06,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-01-31 17:13:06,791 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-31 17:13:06,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:13:06,792 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 36 conjunts are in the unsatisfiable core [2024-01-31 17:13:06,794 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:06,834 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 15 treesize of output 1 [2024-01-31 17:13:07,099 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 66 treesize of output 38 [2024-01-31 17:13:07,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:07,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:13:08,181 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 98 treesize of output 90 [2024-01-31 17:13:08,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:13:08,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 124 [2024-01-31 17:13:08,871 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 241 treesize of output 219 [2024-01-31 17:13:08,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:13:08,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 359 treesize of output 373 [2024-01-31 17:13:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:14,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421411941] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:13:14,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:13:14,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2024-01-31 17:13:14,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893512521] [2024-01-31 17:13:14,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:13:14,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-01-31 17:13:14,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:13:14,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-01-31 17:13:14,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-01-31 17:13:14,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:13:14,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 111 transitions, 886 flow. Second operand has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:14,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:13:14,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:13:14,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:13:15,408 INFO L124 PetriNetUnfolderBase]: 1915/2812 cut-off events. [2024-01-31 17:13:15,408 INFO L125 PetriNetUnfolderBase]: For 10062/10062 co-relation queries the response was YES. [2024-01-31 17:13:15,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12380 conditions, 2812 events. 1915/2812 cut-off events. For 10062/10062 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 11956 event pairs, 419 based on Foata normal form. 1/2813 useless extension candidates. Maximal degree in co-relation 12137. Up to 2231 conditions per place. [2024-01-31 17:13:15,428 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 118 selfloop transitions, 43 changer transitions 1/163 dead transitions. [2024-01-31 17:13:15,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 163 transitions, 1455 flow [2024-01-31 17:13:15,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:13:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:13:15,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 131 transitions. [2024-01-31 17:13:15,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46953405017921146 [2024-01-31 17:13:15,429 INFO L175 Difference]: Start difference. First operand has 90 places, 111 transitions, 886 flow. Second operand 9 states and 131 transitions. [2024-01-31 17:13:15,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 163 transitions, 1455 flow [2024-01-31 17:13:15,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 163 transitions, 1402 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-01-31 17:13:15,442 INFO L231 Difference]: Finished difference. Result has 96 places, 116 transitions, 1000 flow [2024-01-31 17:13:15,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1000, PETRI_PLACES=96, PETRI_TRANSITIONS=116} [2024-01-31 17:13:15,442 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 63 predicate places. [2024-01-31 17:13:15,442 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 116 transitions, 1000 flow [2024-01-31 17:13:15,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.125) internal successors, (171), 24 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:15,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:15,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:13:15,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-01-31 17:13:15,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:13:15,650 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:15,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1018813069, now seen corresponding path program 5 times [2024-01-31 17:13:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:13:15,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978960825] [2024-01-31 17:13:15,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:13:15,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:13:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:13:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:13:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978960825] [2024-01-31 17:13:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978960825] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:13:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218034548] [2024-01-31 17:13:16,377 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-31 17:13:16,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:13:16,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:13:16,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:13:16,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-01-31 17:13:16,474 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-31 17:13:16,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:13:16,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 34 conjunts are in the unsatisfiable core [2024-01-31 17:13:16,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:16,507 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 15 treesize of output 1 [2024-01-31 17:13:16,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:13:16,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 81 [2024-01-31 17:13:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:17,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:13:18,826 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 50 treesize of output 44 [2024-01-31 17:13:18,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 66 treesize of output 60 [2024-01-31 17:13:18,835 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 35 treesize of output 31 [2024-01-31 17:13:18,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 43 [2024-01-31 17:13:18,846 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 69 treesize of output 61 [2024-01-31 17:13:18,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 92 treesize of output 84 [2024-01-31 17:13:18,895 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 62 treesize of output 56 [2024-01-31 17:13:18,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 77 treesize of output 71 [2024-01-31 17:13:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218034548] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:13:18,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:13:18,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2024-01-31 17:13:18,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334484943] [2024-01-31 17:13:18,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:13:18,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-31 17:13:18,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:13:18,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-31 17:13:18,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=616, Unknown=0, NotChecked=0, Total=756 [2024-01-31 17:13:18,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:13:18,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 116 transitions, 1000 flow. Second operand has 28 states, 28 states have (on average 6.678571428571429) internal successors, (187), 28 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:18,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:13:18,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:13:18,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:13:21,520 INFO L124 PetriNetUnfolderBase]: 3076/4462 cut-off events. [2024-01-31 17:13:21,521 INFO L125 PetriNetUnfolderBase]: For 20175/20175 co-relation queries the response was YES. [2024-01-31 17:13:21,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20673 conditions, 4462 events. 3076/4462 cut-off events. For 20175/20175 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 20375 event pairs, 390 based on Foata normal form. 3/4465 useless extension candidates. Maximal degree in co-relation 20426. Up to 2852 conditions per place. [2024-01-31 17:13:21,552 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 216 selfloop transitions, 142 changer transitions 3/362 dead transitions. [2024-01-31 17:13:21,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 362 transitions, 3447 flow [2024-01-31 17:13:21,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-01-31 17:13:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-01-31 17:13:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 428 transitions. [2024-01-31 17:13:21,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39447004608294933 [2024-01-31 17:13:21,555 INFO L175 Difference]: Start difference. First operand has 96 places, 116 transitions, 1000 flow. Second operand 35 states and 428 transitions. [2024-01-31 17:13:21,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 362 transitions, 3447 flow [2024-01-31 17:13:21,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 362 transitions, 3366 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-01-31 17:13:21,584 INFO L231 Difference]: Finished difference. Result has 136 places, 210 transitions, 2213 flow [2024-01-31 17:13:21,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2213, PETRI_PLACES=136, PETRI_TRANSITIONS=210} [2024-01-31 17:13:21,585 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 103 predicate places. [2024-01-31 17:13:21,585 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 210 transitions, 2213 flow [2024-01-31 17:13:21,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.678571428571429) internal successors, (187), 28 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:21,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:21,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:13:21,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-01-31 17:13:21,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:13:21,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:21,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:21,797 INFO L85 PathProgramCache]: Analyzing trace with hash 812051853, now seen corresponding path program 6 times [2024-01-31 17:13:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:13:21,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884905288] [2024-01-31 17:13:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:13:21,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:13:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:13:22,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:22,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:13:22,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884905288] [2024-01-31 17:13:22,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884905288] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:13:22,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636863777] [2024-01-31 17:13:22,329 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-31 17:13:22,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:13:22,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:13:22,330 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-01-31 17:13:22,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-01-31 17:13:22,433 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-01-31 17:13:22,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:13:22,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2024-01-31 17:13:22,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:22,457 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 15 treesize of output 1 [2024-01-31 17:13:22,694 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 66 treesize of output 38 [2024-01-31 17:13:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:22,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:13:24,099 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 251 treesize of output 227 [2024-01-31 17:13:24,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:13:24,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 423 treesize of output 387 [2024-01-31 17:13:29,118 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-01-31 17:13:29,120 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 101 [2024-01-31 17:13:29,121 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-01-31 17:13:29,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-01-31 17:13:29,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:13:29,322 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:516) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-01-31 17:13:29,327 INFO L158 Benchmark]: Toolchain (without parser) took 210187.52ms. Allocated memory was 153.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 113.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 975.8MB. Max. memory is 16.1GB. [2024-01-31 17:13:29,327 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:13:29,327 INFO L158 Benchmark]: Witness Parser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-01-31 17:13:29,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.56ms. Allocated memory is still 153.1MB. Free memory was 113.6MB in the beginning and 98.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-01-31 17:13:29,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.07ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 95.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-01-31 17:13:29,327 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 92.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-01-31 17:13:29,327 INFO L158 Benchmark]: RCFGBuilder took 647.03ms. Allocated memory is still 153.1MB. Free memory was 92.6MB in the beginning and 51.4MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-01-31 17:13:29,328 INFO L158 Benchmark]: TraceAbstraction took 209205.30ms. Allocated memory was 153.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 50.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 914.7MB. Max. memory is 16.1GB. [2024-01-31 17:13:29,328 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 78.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.14ms. Allocated memory is still 153.1MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.56ms. Allocated memory is still 153.1MB. Free memory was 113.6MB in the beginning and 98.0MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.07ms. Allocated memory is still 153.1MB. Free memory was 98.0MB in the beginning and 95.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 153.1MB. Free memory was 95.6MB in the beginning and 92.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 647.03ms. Allocated memory is still 153.1MB. Free memory was 92.6MB in the beginning and 51.4MB in the end (delta: 41.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 209205.30ms. Allocated memory was 153.1MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 50.3MB in the beginning and 1.1GB in the end (delta: -1.1GB). Peak memory consumption was 914.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-mts.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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-?-80b1b13-m [2024-01-31 17:13:31,044 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:13:31,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-01-31 17:13:31,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:13:31,131 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:13:31,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:13:31,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:13:31,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:13:31,151 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:13:31,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:13:31,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:13:31,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:13:31,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:13:31,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:13:31,157 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:13:31,157 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:13:31,157 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:13:31,157 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:13:31,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:13:31,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:13:31,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:13:31,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:13:31,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:13:31,159 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-01-31 17:13:31,160 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-01-31 17:13:31,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:13:31,160 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-01-31 17:13:31,161 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:13:31,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:13:31,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:13:31,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:13:31,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:13:31,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:13:31,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:13:31,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:13:31,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:13:31,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:13:31,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:13:31,164 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-01-31 17:13:31,164 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-01-31 17:13:31,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:13:31,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:13:31,165 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:13:31,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:13:31,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:13:31,166 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-01-31 17:13:31,166 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-01-31 17:13:31,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:13:31,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:13:31,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:13:31,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:13:31,449 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:13:31,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-01-31 17:13:32,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:13:32,576 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:13:32,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2024-01-31 17:13:32,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43be3ca7/d3aedcde4b09443d85b29044c19e50a4/FLAG2b9f5ea83 [2024-01-31 17:13:32,596 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e43be3ca7/d3aedcde4b09443d85b29044c19e50a4 [2024-01-31 17:13:32,598 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:13:32,598 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:13:32,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-more-mts.wvr.yml/witness.yml [2024-01-31 17:13:32,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:13:32,723 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:13:32,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:13:32,726 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:13:32,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:13:32,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:13:32" (1/2) ... [2024-01-31 17:13:32,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd019d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:13:32, skipping insertion in model container [2024-01-31 17:13:32,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:13:32" (1/2) ... [2024-01-31 17:13:32,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2d475bce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:13:32, skipping insertion in model container [2024-01-31 17:13:32,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:13:32" (2/2) ... [2024-01-31 17:13:32,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cd019d9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:32, skipping insertion in model container [2024-01-31 17:13:32,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:13:32" (2/2) ... [2024-01-31 17:13:32,733 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:13:32,768 INFO L93 nessWitnessExtractor]: Witness did not contain any usable entries. [2024-01-31 17:13:32,786 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:13:32,949 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2572,2585] [2024-01-31 17:13:32,967 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:13:32,979 INFO L201 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-01-31 17:13:32,987 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:13:33,010 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2572,2585] [2024-01-31 17:13:33,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:13:33,021 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:13:33,051 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2572,2585] [2024-01-31 17:13:33,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:13:33,073 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:13:33,073 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33 WrapperNode [2024-01-31 17:13:33,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:13:33,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:13:33,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:13:33,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:13:33,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,123 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 227 [2024-01-31 17:13:33,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:13:33,124 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:13:33,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:13:33,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:13:33,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,167 INFO L175 MemorySlicer]: Split 16 memory accesses to 5 slices as follows [2, 2, 8, 2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-01-31 17:13:33,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,188 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,190 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:13:33,190 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:13:33,191 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:13:33,191 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:13:33,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (1/1) ... [2024-01-31 17:13:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:13:33,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:13:33,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-01-31 17:13:33,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-01-31 17:13:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:13:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-01-31 17:13:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-01-31 17:13:33,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-01-31 17:13:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-01-31 17:13:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-01-31 17:13:33,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:13:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-01-31 17:13:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-01-31 17:13:33,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-01-31 17:13:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-01-31 17:13:33,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-01-31 17:13:33,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 17:13:33,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 17:13:33,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 17:13:33,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 17:13:33,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 17:13:33,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 17:13:33,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:13:33,272 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:13:33,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-31 17:13:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:13:33,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:13:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:13:33,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-01-31 17:13:33,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-01-31 17:13:33,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-01-31 17:13:33,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-01-31 17:13:33,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-01-31 17:13:33,278 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-31 17:13:33,399 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:13:33,401 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:13:33,748 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:13:33,748 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:13:34,047 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:13:34,048 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-01-31 17:13:34,049 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:13:34 BoogieIcfgContainer [2024-01-31 17:13:34,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:13:34,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:13:34,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:13:34,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:13:34,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:13:32" (1/4) ... [2024-01-31 17:13:34,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c1029f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:13:34, skipping insertion in model container [2024-01-31 17:13:34,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:13:32" (2/4) ... [2024-01-31 17:13:34,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c1029f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:13:34, skipping insertion in model container [2024-01-31 17:13:34,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:13:33" (3/4) ... [2024-01-31 17:13:34,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12c1029f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:13:34, skipping insertion in model container [2024-01-31 17:13:34,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:13:34" (4/4) ... [2024-01-31 17:13:34,056 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2024-01-31 17:13:34,069 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:13:34,069 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-31 17:13:34,069 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:13:34,115 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-31 17:13:34,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 83 flow [2024-01-31 17:13:34,163 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-01-31 17:13:34,164 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 17:13:34,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2024-01-31 17:13:34,169 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 31 transitions, 83 flow [2024-01-31 17:13:34,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 27 transitions, 72 flow [2024-01-31 17:13:34,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:13:34,187 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;@3b87e0a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:13:34,187 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-31 17:13:34,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:13:34,197 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2024-01-31 17:13:34,197 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 17:13:34,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:34,205 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-01-31 17:13:34,205 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:34,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1581705799, now seen corresponding path program 1 times [2024-01-31 17:13:34,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-31 17:13:34,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336606718] [2024-01-31 17:13:34,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:13:34,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:34,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-31 17:13:34,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-31 17:13:34,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-01-31 17:13:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:13:34,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-31 17:13:34,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:34,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 17:13:34,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-31 17:13:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336606718] [2024-01-31 17:13:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336606718] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:13:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:13:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:13:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79081123] [2024-01-31 17:13:34,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:13:34,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:13:34,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-31 17:13:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:13:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:13:34,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-01-31 17:13:34,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:34,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:13:34,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-01-31 17:13:34,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:13:34,882 INFO L124 PetriNetUnfolderBase]: 488/729 cut-off events. [2024-01-31 17:13:34,883 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-01-31 17:13:34,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 729 events. 488/729 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2518 event pairs, 138 based on Foata normal form. 1/594 useless extension candidates. Maximal degree in co-relation 1167. Up to 474 conditions per place. [2024-01-31 17:13:34,892 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 39 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2024-01-31 17:13:34,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 46 transitions, 213 flow [2024-01-31 17:13:34,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:13:34,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:13:34,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-01-31 17:13:34,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-01-31 17:13:34,903 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 72 flow. Second operand 3 states and 60 transitions. [2024-01-31 17:13:34,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 46 transitions, 213 flow [2024-01-31 17:13:34,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 191 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-31 17:13:34,910 INFO L231 Difference]: Finished difference. Result has 30 places, 30 transitions, 86 flow [2024-01-31 17:13:34,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=30, PETRI_TRANSITIONS=30} [2024-01-31 17:13:34,915 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2024-01-31 17:13:34,915 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 30 transitions, 86 flow [2024-01-31 17:13:34,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:34,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:34,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:13:34,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-01-31 17:13:35,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:35,119 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:35,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash 139193438, now seen corresponding path program 1 times [2024-01-31 17:13:35,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-31 17:13:35,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424225348] [2024-01-31 17:13:35,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:13:35,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:35,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-31 17:13:35,122 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-31 17:13:35,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-01-31 17:13:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:13:35,241 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-31 17:13:35,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:13:35,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 17:13:35,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-31 17:13:35,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424225348] [2024-01-31 17:13:35,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424225348] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:13:35,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:13:35,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-31 17:13:35,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742372083] [2024-01-31 17:13:35,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:13:35,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-31 17:13:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-31 17:13:35,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-31 17:13:35,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-01-31 17:13:35,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-01-31 17:13:35,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 30 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:35,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:13:35,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-01-31 17:13:35,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:13:35,705 INFO L124 PetriNetUnfolderBase]: 490/736 cut-off events. [2024-01-31 17:13:35,705 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2024-01-31 17:13:35,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1765 conditions, 736 events. 490/736 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2639 event pairs, 197 based on Foata normal form. 78/802 useless extension candidates. Maximal degree in co-relation 700. Up to 494 conditions per place. [2024-01-31 17:13:35,708 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 44 selfloop transitions, 9 changer transitions 0/55 dead transitions. [2024-01-31 17:13:35,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 55 transitions, 271 flow [2024-01-31 17:13:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:13:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:13:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2024-01-31 17:13:35,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41935483870967744 [2024-01-31 17:13:35,710 INFO L175 Difference]: Start difference. First operand has 30 places, 30 transitions, 86 flow. Second operand 6 states and 78 transitions. [2024-01-31 17:13:35,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 55 transitions, 271 flow [2024-01-31 17:13:35,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 260 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-31 17:13:35,712 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 135 flow [2024-01-31 17:13:35,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2024-01-31 17:13:35,713 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2024-01-31 17:13:35,713 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 135 flow [2024-01-31 17:13:35,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:35,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:35,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:13:35,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-01-31 17:13:35,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:35,919 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:35,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1566358258, now seen corresponding path program 2 times [2024-01-31 17:13:35,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-31 17:13:35,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102550484] [2024-01-31 17:13:35,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:13:35,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:35,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-31 17:13:35,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-31 17:13:35,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-01-31 17:13:36,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-01-31 17:13:36,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:13:36,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-31 17:13:36,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:36,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:13:36,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 17:13:36,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-31 17:13:36,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102550484] [2024-01-31 17:13:36,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102550484] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:13:36,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:13:36,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:13:36,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812774825] [2024-01-31 17:13:36,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:13:36,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:13:36,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-31 17:13:36,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:13:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:13:36,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-01-31 17:13:36,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:36,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:13:36,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-01-31 17:13:36,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:13:36,189 INFO L124 PetriNetUnfolderBase]: 490/748 cut-off events. [2024-01-31 17:13:36,189 INFO L125 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2024-01-31 17:13:36,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 748 events. 490/748 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2662 event pairs, 305 based on Foata normal form. 1/739 useless extension candidates. Maximal degree in co-relation 942. Up to 711 conditions per place. [2024-01-31 17:13:36,193 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 32 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-01-31 17:13:36,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 205 flow [2024-01-31 17:13:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:13:36,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:13:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-01-31 17:13:36,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45161290322580644 [2024-01-31 17:13:36,195 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 135 flow. Second operand 3 states and 42 transitions. [2024-01-31 17:13:36,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 205 flow [2024-01-31 17:13:36,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 194 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-01-31 17:13:36,197 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 136 flow [2024-01-31 17:13:36,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2024-01-31 17:13:36,198 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2024-01-31 17:13:36,198 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 136 flow [2024-01-31 17:13:36,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:13:36,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:36,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:13:36,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-01-31 17:13:36,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:36,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:36,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash -520714400, now seen corresponding path program 1 times [2024-01-31 17:13:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-31 17:13:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22253380] [2024-01-31 17:13:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:13:36,404 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:36,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-31 17:13:36,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-31 17:13:36,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-01-31 17:13:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:13:36,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-31 17:13:36,581 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:13:36,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:13:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:13:36,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-31 17:13:36,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22253380] [2024-01-31 17:13:36,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22253380] provided 1 perfect and 1 imperfect interpolant sequences [2024-01-31 17:13:36,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 17:13:36,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-01-31 17:13:36,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901177438] [2024-01-31 17:13:36,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:13:36,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:13:36,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-31 17:13:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:13:36,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:13:36,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:13:36,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-01-31 17:13:36,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:13:36,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:13:36,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:13:36,987 INFO L124 PetriNetUnfolderBase]: 653/945 cut-off events. [2024-01-31 17:13:36,988 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2024-01-31 17:13:36,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2612 conditions, 945 events. 653/945 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3015 event pairs, 201 based on Foata normal form. 40/984 useless extension candidates. Maximal degree in co-relation 2597. Up to 513 conditions per place. [2024-01-31 17:13:36,992 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 44 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2024-01-31 17:13:36,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 289 flow [2024-01-31 17:13:36,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:13:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:13:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2024-01-31 17:13:36,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4435483870967742 [2024-01-31 17:13:36,993 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 136 flow. Second operand 4 states and 55 transitions. [2024-01-31 17:13:36,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 289 flow [2024-01-31 17:13:36,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 285 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-31 17:13:36,995 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 161 flow [2024-01-31 17:13:36,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2024-01-31 17:13:36,996 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2024-01-31 17:13:36,996 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 161 flow [2024-01-31 17:13:36,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 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-01-31 17:13:36,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:13:36,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:13:37,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-01-31 17:13:37,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:37,200 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:13:37,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:13:37,200 INFO L85 PathProgramCache]: Analyzing trace with hash -2091842145, now seen corresponding path program 1 times [2024-01-31 17:13:37,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-31 17:13:37,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945095228] [2024-01-31 17:13:37,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:13:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:13:37,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-31 17:13:37,202 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-31 17:13:37,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-01-31 17:13:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:13:37,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 24 conjunts are in the unsatisfiable core [2024-01-31 17:13:37,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:13:38,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:13:38,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:13:38,034 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:13:38,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:13:38,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:13:38,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:13:38,038 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:13:38,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:13:38,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:13:38,041 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:13:38,053 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:13:38,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 246 treesize of output 90 [2024-01-31 17:13:38,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:13:38,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:13:39,343 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2024-01-31 17:13:39,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 675 treesize of output 233 [2024-01-31 17:13:58,914 WARN L293 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 569 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:14:37,147 WARN L293 SmtUtils]: Spent 7.66s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:15:10,365 WARN L293 SmtUtils]: Spent 10.01s on a formula simplification that was a NOOP. DAG size: 581 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:15:33,115 WARN L293 SmtUtils]: Spent 9.65s on a formula simplification that was a NOOP. DAG size: 583 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:15:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:15:33,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-31 17:15:33,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945095228] [2024-01-31 17:15:33,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945095228] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:15:33,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-31 17:15:33,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2024-01-31 17:15:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829120637] [2024-01-31 17:15:33,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-31 17:15:33,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-31 17:15:33,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-31 17:15:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-31 17:15:33,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=212, Unknown=4, NotChecked=0, Total=272 [2024-01-31 17:15:37,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:15:37,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:15:37,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 161 flow. Second operand has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:15:37,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:15:37,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:15:37,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:15:56,980 WARN L293 SmtUtils]: Spent 12.52s on a formula simplification. DAG size of input: 597 DAG size of output: 249 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:15:59,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:16,078 WARN L293 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 595 DAG size of output: 246 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:16:20,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:22,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:24,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:27,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:28,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:33,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:34,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:42,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:48,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:16:52,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:54,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:16:57,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:00,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:09,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:11,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:13,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:14,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:17,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:23,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:24,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:25,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:27,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:17:30,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:32,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:35,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:36,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:39,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:43,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:46,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:49,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:51,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:53,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:17:59,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:18:00,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:18:02,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:18:05,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:18:06,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:18:09,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:18:12,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:18:16,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:18:18,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:18:19,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:18:20,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:18:20,402 INFO L124 PetriNetUnfolderBase]: 1226/1781 cut-off events. [2024-01-31 17:18:20,403 INFO L125 PetriNetUnfolderBase]: For 1406/1406 co-relation queries the response was YES. [2024-01-31 17:18:20,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5414 conditions, 1781 events. 1226/1781 cut-off events. For 1406/1406 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6943 event pairs, 93 based on Foata normal form. 1/1782 useless extension candidates. Maximal degree in co-relation 4042. Up to 1002 conditions per place. [2024-01-31 17:18:20,412 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 90 selfloop transitions, 25 changer transitions 1/117 dead transitions. [2024-01-31 17:18:20,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 117 transitions, 691 flow [2024-01-31 17:18:20,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-01-31 17:18:20,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-01-31 17:18:20,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-01-31 17:18:20,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5053763440860215 [2024-01-31 17:18:20,464 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 161 flow. Second operand 9 states and 141 transitions. [2024-01-31 17:18:20,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 117 transitions, 691 flow [2024-01-31 17:18:20,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 117 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:18:20,468 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 334 flow [2024-01-31 17:18:20,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=334, PETRI_PLACES=51, PETRI_TRANSITIONS=56} [2024-01-31 17:18:20,469 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2024-01-31 17:18:20,470 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 334 flow [2024-01-31 17:18:20,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 17 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:18:20,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:20,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:20,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-01-31 17:18:20,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:18:20,674 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-01-31 17:18:20,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:20,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1495834195, now seen corresponding path program 2 times [2024-01-31 17:18:20,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-01-31 17:18:20,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765754670] [2024-01-31 17:18:20,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:18:20,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-01-31 17:18:20,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-01-31 17:18:20,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-01-31 17:18:20,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-01-31 17:18:20,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 17:18:20,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:18:20,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjunts are in the unsatisfiable core [2024-01-31 17:18:20,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:24,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:18:24,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:18:24,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:18:24,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:18:24,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:18:24,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:18:24,334 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:18:24,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-01-31 17:18:24,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:18:24,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-01-31 17:18:24,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:18:24,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 246 treesize of output 90 [2024-01-31 17:18:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:25,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:18:27,720 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2024-01-31 17:18:27,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 675 treesize of output 233 [2024-01-31 17:18:56,003 WARN L293 SmtUtils]: Spent 7.05s on a formula simplification that was a NOOP. DAG size: 569 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:19:23,525 WARN L293 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:20:00,371 WARN L293 SmtUtils]: Spent 7.57s on a formula simplification that was a NOOP. DAG size: 567 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:20:37,052 WARN L293 SmtUtils]: Spent 9.52s on a formula simplification that was a NOOP. DAG size: 570 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:21:07,480 WARN L293 SmtUtils]: Spent 9.18s on a formula simplification that was a NOOP. DAG size: 569 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:21:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:21:51,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-01-31 17:21:51,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765754670] [2024-01-31 17:21:51,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765754670] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:21:51,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-01-31 17:21:51,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-01-31 17:21:51,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589775187] [2024-01-31 17:21:51,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-01-31 17:21:51,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-31 17:21:51,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-01-31 17:21:51,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-31 17:21:51,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=281, Unknown=5, NotChecked=0, Total=380 [2024-01-31 17:21:57,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:21:57,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 31 [2024-01-31 17:21:57,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 334 flow. Second operand has 20 states, 20 states have (on average 6.5) internal successors, (130), 20 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:21:57,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:21:57,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 31 [2024-01-31 17:21:57,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:22:11,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:22:15,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:22:44,336 WARN L293 SmtUtils]: Spent 19.34s on a formula simplification. DAG size of input: 609 DAG size of output: 485 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-31 17:22:57,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:23:01,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:23:05,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-01-31 17:23:11,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:23:12,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:23:14,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-01-31 17:23:15,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] Killed by 15