./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-send-receive.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-send-receive.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-send-receive.wvr.c ./goblint.2023-12-19_14-39-08.files/SV-COMP24_unreach-call/popl20-send-receive.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:18:00,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-31 17:18:00,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-31 17:18:00,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-31 17:18:00,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-31 17:18:00,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-31 17:18:00,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-31 17:18:00,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-31 17:18:00,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-31 17:18:00,381 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-31 17:18:00,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-31 17:18:00,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-31 17:18:00,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-31 17:18:00,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-31 17:18:00,384 INFO L153 SettingsManager]: * Use SBE=true [2024-01-31 17:18:00,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-31 17:18:00,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-31 17:18:00,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-31 17:18:00,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-31 17:18:00,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-31 17:18:00,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-31 17:18:00,386 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-31 17:18:00,386 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-31 17:18:00,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-31 17:18:00,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-31 17:18:00,387 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-31 17:18:00,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-31 17:18:00,387 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-31 17:18:00,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-31 17:18:00,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-31 17:18:00,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-31 17:18:00,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-31 17:18:00,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:18:00,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-31 17:18:00,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-31 17:18:00,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-31 17:18:00,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-31 17:18:00,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-31 17:18:00,390 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-31 17:18:00,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-31 17:18:00,391 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-31 17:18:00,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-31 17:18:00,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-31 17:18:00,391 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:18:00,615 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-31 17:18:00,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-31 17:18:00,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-31 17:18:00,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-31 17:18:00,631 INFO L274 PluginConnector]: CDTParser initialized [2024-01-31 17:18:00,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2024-01-31 17:18:01,695 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-31 17:18:01,845 INFO L384 CDTParser]: Found 1 translation units. [2024-01-31 17:18:01,845 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2024-01-31 17:18:01,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356bfa0a9/87be5ee48e664cbd997b501a48d7b876/FLAG480dd0f38 [2024-01-31 17:18:01,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/356bfa0a9/87be5ee48e664cbd997b501a48d7b876 [2024-01-31 17:18:01,862 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-01-31 17:18:01,874 INFO L274 PluginConnector]: Witness Parser initialized [2024-01-31 17:18:01,877 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-send-receive.wvr.yml/witness.yml [2024-01-31 17:18:02,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-31 17:18:02,012 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-31 17:18:02,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-31 17:18:02,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-31 17:18:02,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-31 17:18:02,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:18:01" (1/2) ... [2024-01-31 17:18:02,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726d5787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:18:02, skipping insertion in model container [2024-01-31 17:18:02,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:18:01" (1/2) ... [2024-01-31 17:18:02,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c9e5d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:18:02, skipping insertion in model container [2024-01-31 17:18:02,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:18:02" (2/2) ... [2024-01-31 17:18:02,019 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@726d5787 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:18:02, skipping insertion in model container [2024-01-31 17:18:02,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:18:02" (2/2) ... [2024-01-31 17:18:02,020 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-01-31 17:18:02,064 INFO L96 nessWitnessExtractor]: Found the following entries in the witness: [2024-01-31 17:18:02,065 INFO L98 nessWitnessExtractor]: Location invariant after [L49-L49] ((unsigned long )_argptr == 0UL) && (v_assert == (_Bool)0 || v_assert == (_Bool)1) [2024-01-31 17:18:02,065 INFO L98 nessWitnessExtractor]: Location invariant after [L68-L68] ((((_Bool)1 == b) && (b == (_Bool)1)) && ((unsigned long )_argptr == 0UL)) && (v_assert == (_Bool)0 || v_assert == (_Bool)1) [2024-01-31 17:18:02,065 INFO L98 nessWitnessExtractor]: Location invariant after [L66-L66] ((unsigned long )_argptr == 0UL) && (b == (_Bool)0 || b == (_Bool)1) [2024-01-31 17:18:02,083 INFO L179 MainTranslator]: Built tables and reachable declarations [2024-01-31 17:18:02,228 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-send-receive.wvr.c[3146,3159] [2024-01-31 17:18:02,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:18:02,274 INFO L204 MainTranslator]: Completed pre-run [2024-01-31 17:18:02,283 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 17:18:02,284 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 17:18:02,285 WARN L424 MainDispatcher]: Unable to annotate _Bool with a witness entry [2024-01-31 17:18:02,289 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-send-receive.wvr.c[3146,3159] [2024-01-31 17:18:02,291 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-31 17:18:02,301 INFO L208 MainTranslator]: Completed translation [2024-01-31 17:18:02,302 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 31.01 05:18:02 WrapperNode [2024-01-31 17:18:02,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-31 17:18:02,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-31 17:18:02,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-31 17:18:02,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-31 17:18:02,307 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:18:02" (1/1) ... [2024-01-31 17:18:02,313 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:18:02" (1/1) ... [2024-01-31 17:18:02,329 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 166 [2024-01-31 17:18:02,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-31 17:18:02,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-31 17:18:02,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-31 17:18:02,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-31 17:18:02,337 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:18:02" (1/1) ... [2024-01-31 17:18:02,338 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:18:02" (1/1) ... [2024-01-31 17:18:02,340 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:18:02" (1/1) ... [2024-01-31 17:18:02,351 INFO L175 MemorySlicer]: Split 12 memory accesses to 5 slices as follows [2, 2, 2, 2, 4]. 33 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:18:02,351 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:18:02" (1/1) ... [2024-01-31 17:18:02,351 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:18:02" (1/1) ... [2024-01-31 17:18:02,356 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:18:02" (1/1) ... [2024-01-31 17:18:02,358 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:18:02" (1/1) ... [2024-01-31 17:18:02,359 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:18:02" (1/1) ... [2024-01-31 17:18:02,360 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:18:02" (1/1) ... [2024-01-31 17:18:02,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-31 17:18:02,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-31 17:18:02,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-31 17:18:02,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-31 17:18:02,363 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:18:02" (1/1) ... [2024-01-31 17:18:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-31 17:18:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:02,387 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:18:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-31 17:18:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-31 17:18:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-31 17:18:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-31 17:18:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-31 17:18:02,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-31 17:18:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-31 17:18:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-31 17:18:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-31 17:18:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-31 17:18:02,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-31 17:18:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-31 17:18:02,449 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-31 17:18:02,449 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-31 17:18:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-31 17:18:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-31 17:18:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-31 17:18:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-31 17:18:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-31 17:18:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-31 17:18:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-31 17:18:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-31 17:18:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-31 17:18:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-31 17:18:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-31 17:18:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-01-31 17:18:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-31 17:18:02,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-31 17:18:02,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-31 17:18:02,454 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:18:02,420 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:18:02,568 INFO L244 CfgBuilder]: Building ICFG [2024-01-31 17:18:02,570 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-31 17:18:02,812 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-31 17:18:02,813 INFO L293 CfgBuilder]: Performing block encoding [2024-01-31 17:18:03,019 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-31 17:18:03,019 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-01-31 17:18:03,021 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:18:03 BoogieIcfgContainer [2024-01-31 17:18:03,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-31 17:18:03,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-31 17:18:03,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-31 17:18:03,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-31 17:18:03,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:18:01" (1/4) ... [2024-01-31 17:18:03,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f742a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:18:03, skipping insertion in model container [2024-01-31 17:18:03,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 31.01 05:18:02" (2/4) ... [2024-01-31 17:18:03,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f742a4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:18:03, skipping insertion in model container [2024-01-31 17:18:03,027 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:18:02" (3/4) ... [2024-01-31 17:18:03,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f742a4 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 31.01 05:18:03, skipping insertion in model container [2024-01-31 17:18:03,028 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:18:03" (4/4) ... [2024-01-31 17:18:03,028 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2024-01-31 17:18:03,040 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-31 17:18:03,041 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-31 17:18:03,041 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-31 17:18:03,085 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-01-31 17:18:03,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 39 transitions, 99 flow [2024-01-31 17:18:03,149 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-01-31 17:18:03,150 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 17:18:03,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-01-31 17:18:03,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 39 transitions, 99 flow [2024-01-31 17:18:03,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2024-01-31 17:18:03,169 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-31 17:18:03,173 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;@6e5249bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-31 17:18:03,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-01-31 17:18:03,189 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-31 17:18:03,190 INFO L124 PetriNetUnfolderBase]: 4/34 cut-off events. [2024-01-31 17:18:03,190 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-01-31 17:18:03,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:03,191 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] [2024-01-31 17:18:03,191 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:18:03,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash -779910303, now seen corresponding path program 1 times [2024-01-31 17:18:03,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:03,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670401765] [2024-01-31 17:18:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:03,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:03,777 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:18:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670401765] [2024-01-31 17:18:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670401765] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:18:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:18:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-31 17:18:03,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632872091] [2024-01-31 17:18:03,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:18:03,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-31 17:18:03,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:03,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-31 17:18:03,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:18:03,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-31 17:18:03,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:03,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:03,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-31 17:18:03,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:04,055 INFO L124 PetriNetUnfolderBase]: 583/994 cut-off events. [2024-01-31 17:18:04,056 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-01-31 17:18:04,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1939 conditions, 994 events. 583/994 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4883 event pairs, 38 based on Foata normal form. 104/1031 useless extension candidates. Maximal degree in co-relation 1861. Up to 280 conditions per place. [2024-01-31 17:18:04,066 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 63 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-01-31 17:18:04,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 78 transitions, 322 flow [2024-01-31 17:18:04,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-31 17:18:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-31 17:18:04,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-01-31 17:18:04,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6367521367521367 [2024-01-31 17:18:04,113 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 88 flow. Second operand 6 states and 149 transitions. [2024-01-31 17:18:04,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 78 transitions, 322 flow [2024-01-31 17:18:04,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 78 transitions, 302 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-01-31 17:18:04,122 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 110 flow [2024-01-31 17:18:04,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-01-31 17:18:04,127 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2024-01-31 17:18:04,128 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 110 flow [2024-01-31 17:18:04,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:04,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:04,128 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, 1] [2024-01-31 17:18:04,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-31 17:18:04,129 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:18:04,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:04,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1650889046, now seen corresponding path program 1 times [2024-01-31 17:18:04,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116244975] [2024-01-31 17:18:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:04,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:04,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:04,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116244975] [2024-01-31 17:18:04,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116244975] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:18:04,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:18:04,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-31 17:18:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473086767] [2024-01-31 17:18:04,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:18:04,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-31 17:18:04,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-31 17:18:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-31 17:18:04,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-01-31 17:18:04,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:18:04,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:04,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-01-31 17:18:04,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:04,296 INFO L124 PetriNetUnfolderBase]: 247/482 cut-off events. [2024-01-31 17:18:04,296 INFO L125 PetriNetUnfolderBase]: For 543/637 co-relation queries the response was YES. [2024-01-31 17:18:04,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1062 conditions, 482 events. 247/482 cut-off events. For 543/637 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2211 event pairs, 87 based on Foata normal form. 110/523 useless extension candidates. Maximal degree in co-relation 462. Up to 317 conditions per place. [2024-01-31 17:18:04,300 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 26 selfloop transitions, 3 changer transitions 2/46 dead transitions. [2024-01-31 17:18:04,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 189 flow [2024-01-31 17:18:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-31 17:18:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-31 17:18:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2024-01-31 17:18:04,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2024-01-31 17:18:04,307 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 110 flow. Second operand 3 states and 79 transitions. [2024-01-31 17:18:04,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 189 flow [2024-01-31 17:18:04,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 46 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:18:04,310 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 125 flow [2024-01-31 17:18:04,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2024-01-31 17:18:04,311 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2024-01-31 17:18:04,311 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 125 flow [2024-01-31 17:18:04,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-31 17:18:04,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:04,312 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, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:04,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-31 17:18:04,312 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:18:04,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:04,314 INFO L85 PathProgramCache]: Analyzing trace with hash -772483127, now seen corresponding path program 1 times [2024-01-31 17:18:04,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:04,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442771668] [2024-01-31 17:18:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:04,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:04,396 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:18:04,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:04,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442771668] [2024-01-31 17:18:04,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442771668] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:18:04,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-31 17:18:04,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-31 17:18:04,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483535964] [2024-01-31 17:18:04,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:18:04,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:18:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:18:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-31 17:18:04,399 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-01-31 17:18:04,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:04,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:04,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-01-31 17:18:04,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:04,491 INFO L124 PetriNetUnfolderBase]: 260/507 cut-off events. [2024-01-31 17:18:04,491 INFO L125 PetriNetUnfolderBase]: For 687/822 co-relation queries the response was YES. [2024-01-31 17:18:04,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 507 events. 260/507 cut-off events. For 687/822 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2325 event pairs, 157 based on Foata normal form. 125/556 useless extension candidates. Maximal degree in co-relation 972. Up to 365 conditions per place. [2024-01-31 17:18:04,494 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 24 selfloop transitions, 2 changer transitions 10/51 dead transitions. [2024-01-31 17:18:04,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 51 transitions, 222 flow [2024-01-31 17:18:04,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:18:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:18:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-01-31 17:18:04,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2024-01-31 17:18:04,495 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 125 flow. Second operand 4 states and 98 transitions. [2024-01-31 17:18:04,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 51 transitions, 222 flow [2024-01-31 17:18:04,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 51 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-31 17:18:04,497 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 136 flow [2024-01-31 17:18:04,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-01-31 17:18:04,498 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2024-01-31 17:18:04,498 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 136 flow [2024-01-31 17:18:04,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 4 states have internal predecessors, (84), 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:04,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:04,498 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, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:04,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-31 17:18:04,499 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:18:04,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -540135417, now seen corresponding path program 1 times [2024-01-31 17:18:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:04,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108737261] [2024-01-31 17:18:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:04,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:18:04,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:04,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108737261] [2024-01-31 17:18:04,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108737261] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:18:04,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981508028] [2024-01-31 17:18:04,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:04,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:18:04,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:04,565 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:18:04,594 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:18:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:04,656 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2024-01-31 17:18:04,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:18:04,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:18:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-31 17:18:04,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981508028] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:18:04,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:18:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 7 [2024-01-31 17:18:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741242372] [2024-01-31 17:18:04,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:18:04,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-01-31 17:18:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:04,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-01-31 17:18:04,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-01-31 17:18:04,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-31 17:18:04,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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:04,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:04,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-31 17:18:04,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:05,012 INFO L124 PetriNetUnfolderBase]: 1093/1765 cut-off events. [2024-01-31 17:18:05,013 INFO L125 PetriNetUnfolderBase]: For 1955/2263 co-relation queries the response was YES. [2024-01-31 17:18:05,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4537 conditions, 1765 events. 1093/1765 cut-off events. For 1955/2263 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 8927 event pairs, 122 based on Foata normal form. 352/2005 useless extension candidates. Maximal degree in co-relation 4520. Up to 540 conditions per place. [2024-01-31 17:18:05,021 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 76 selfloop transitions, 13 changer transitions 15/112 dead transitions. [2024-01-31 17:18:05,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 112 transitions, 597 flow [2024-01-31 17:18:05,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-01-31 17:18:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-01-31 17:18:05,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions. [2024-01-31 17:18:05,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49743589743589745 [2024-01-31 17:18:05,025 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 136 flow. Second operand 10 states and 194 transitions. [2024-01-31 17:18:05,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 112 transitions, 597 flow [2024-01-31 17:18:05,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 112 transitions, 585 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-01-31 17:18:05,031 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 206 flow [2024-01-31 17:18:05,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=206, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2024-01-31 17:18:05,032 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2024-01-31 17:18:05,032 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 206 flow [2024-01-31 17:18:05,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 8 states have internal predecessors, (124), 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:05,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:05,033 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, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:05,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-31 17:18:05,245 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:18:05,245 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:18:05,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1306522521, now seen corresponding path program 2 times [2024-01-31 17:18:05,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:05,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309186777] [2024-01-31 17:18:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:05,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:05,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:05,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309186777] [2024-01-31 17:18:05,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309186777] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:18:05,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952529017] [2024-01-31 17:18:05,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:18:05,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:18:05,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:05,743 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:18:05,769 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:18:05,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 17:18:05,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:18:05,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 31 conjunts are in the unsatisfiable core [2024-01-31 17:18:05,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:05,886 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 23 treesize of output 1 [2024-01-31 17:18:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:06,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:18:06,490 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 61 treesize of output 55 [2024-01-31 17:18:06,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:18:06,502 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 68 [2024-01-31 17:18:06,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:06,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952529017] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:18:06,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:18:06,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 27 [2024-01-31 17:18:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204045477] [2024-01-31 17:18:06,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:18:06,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-01-31 17:18:06,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:06,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-01-31 17:18:06,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2024-01-31 17:18:06,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-01-31 17:18:06,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 206 flow. Second operand has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 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:06,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:06,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-01-31 17:18:06,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:09,468 INFO L124 PetriNetUnfolderBase]: 7482/11585 cut-off events. [2024-01-31 17:18:09,468 INFO L125 PetriNetUnfolderBase]: For 11670/11776 co-relation queries the response was YES. [2024-01-31 17:18:09,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32600 conditions, 11585 events. 7482/11585 cut-off events. For 11670/11776 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 69599 event pairs, 866 based on Foata normal form. 1242/12765 useless extension candidates. Maximal degree in co-relation 18477. Up to 1627 conditions per place. [2024-01-31 17:18:09,502 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 254 selfloop transitions, 76 changer transitions 160/498 dead transitions. [2024-01-31 17:18:09,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 498 transitions, 2910 flow [2024-01-31 17:18:09,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-01-31 17:18:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2024-01-31 17:18:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 872 transitions. [2024-01-31 17:18:09,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658119658119658 [2024-01-31 17:18:09,506 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 206 flow. Second operand 48 states and 872 transitions. [2024-01-31 17:18:09,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 498 transitions, 2910 flow [2024-01-31 17:18:09,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 498 transitions, 2892 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-01-31 17:18:09,545 INFO L231 Difference]: Finished difference. Result has 138 places, 118 transitions, 876 flow [2024-01-31 17:18:09,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=876, PETRI_PLACES=138, PETRI_TRANSITIONS=118} [2024-01-31 17:18:09,546 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 97 predicate places. [2024-01-31 17:18:09,546 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 118 transitions, 876 flow [2024-01-31 17:18:09,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.321428571428571) internal successors, (317), 28 states have internal predecessors, (317), 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:09,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:09,547 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:09,561 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:18:09,759 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:18:09,760 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:09,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:09,760 INFO L85 PathProgramCache]: Analyzing trace with hash 903165389, now seen corresponding path program 3 times [2024-01-31 17:18:09,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:09,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973766648] [2024-01-31 17:18:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:09,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:10,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973766648] [2024-01-31 17:18:10,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973766648] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:18:10,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072165046] [2024-01-31 17:18:10,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-31 17:18:10,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:18:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:10,784 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:18:10,785 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:18:10,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-01-31 17:18:10,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:18:10,876 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjunts are in the unsatisfiable core [2024-01-31 17:18:10,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-31 17:18:11,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:18:11,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:18:11,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 40 treesize of output 24 [2024-01-31 17:18:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-01-31 17:18:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072165046] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:18:11,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:18:11,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 7] total 22 [2024-01-31 17:18:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171375171] [2024-01-31 17:18:11,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:18:11,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-01-31 17:18:11,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:11,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-01-31 17:18:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2024-01-31 17:18:11,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-01-31 17:18:11,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 118 transitions, 876 flow. Second operand has 23 states, 23 states have (on average 12.869565217391305) internal successors, (296), 23 states have internal predecessors, (296), 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:11,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:11,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-01-31 17:18:11,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:14,034 INFO L124 PetriNetUnfolderBase]: 7204/11767 cut-off events. [2024-01-31 17:18:14,035 INFO L125 PetriNetUnfolderBase]: For 165089/165462 co-relation queries the response was YES. [2024-01-31 17:18:14,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58950 conditions, 11767 events. 7204/11767 cut-off events. For 165089/165462 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 75232 event pairs, 532 based on Foata normal form. 531/12114 useless extension candidates. Maximal degree in co-relation 51699. Up to 2225 conditions per place. [2024-01-31 17:18:14,234 INFO L140 encePairwiseOnDemand]: 24/39 looper letters, 309 selfloop transitions, 173 changer transitions 132/639 dead transitions. [2024-01-31 17:18:14,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 639 transitions, 6277 flow [2024-01-31 17:18:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-01-31 17:18:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-01-31 17:18:14,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 885 transitions. [2024-01-31 17:18:14,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828150572831424 [2024-01-31 17:18:14,237 INFO L175 Difference]: Start difference. First operand has 138 places, 118 transitions, 876 flow. Second operand 47 states and 885 transitions. [2024-01-31 17:18:14,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 639 transitions, 6277 flow [2024-01-31 17:18:14,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 639 transitions, 5600 flow, removed 314 selfloop flow, removed 8 redundant places. [2024-01-31 17:18:14,434 INFO L231 Difference]: Finished difference. Result has 196 places, 267 transitions, 2636 flow [2024-01-31 17:18:14,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=2636, PETRI_PLACES=196, PETRI_TRANSITIONS=267} [2024-01-31 17:18:14,435 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 155 predicate places. [2024-01-31 17:18:14,435 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 267 transitions, 2636 flow [2024-01-31 17:18:14,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.869565217391305) internal successors, (296), 23 states have internal predecessors, (296), 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:14,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:14,436 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:14,448 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:18:14,648 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:18:14,649 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:18:14,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:14,649 INFO L85 PathProgramCache]: Analyzing trace with hash -69850660, now seen corresponding path program 4 times [2024-01-31 17:18:14,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:14,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625987282] [2024-01-31 17:18:14,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:14,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:14,705 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-31 17:18:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625987282] [2024-01-31 17:18:14,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625987282] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:18:14,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162972365] [2024-01-31 17:18:14,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-31 17:18:14,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:18:14,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:14,707 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:18:14,709 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:18:14,790 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-31 17:18:14,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:18:14,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjunts are in the unsatisfiable core [2024-01-31 17:18:14,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:14,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-31 17:18:14,814 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 17:18:14,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162972365] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:18:14,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 17:18:14,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2024-01-31 17:18:14,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556641918] [2024-01-31 17:18:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:18:14,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:18:14,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:14,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:18:14,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-01-31 17:18:14,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 39 [2024-01-31 17:18:14,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 267 transitions, 2636 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:14,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:14,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 39 [2024-01-31 17:18:14,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:15,609 INFO L124 PetriNetUnfolderBase]: 2713/5224 cut-off events. [2024-01-31 17:18:15,609 INFO L125 PetriNetUnfolderBase]: For 107050/107527 co-relation queries the response was YES. [2024-01-31 17:18:15,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33009 conditions, 5224 events. 2713/5224 cut-off events. For 107050/107527 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 35064 event pairs, 571 based on Foata normal form. 361/5262 useless extension candidates. Maximal degree in co-relation 30963. Up to 1765 conditions per place. [2024-01-31 17:18:15,659 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 113 selfloop transitions, 64 changer transitions 0/243 dead transitions. [2024-01-31 17:18:15,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 243 transitions, 2765 flow [2024-01-31 17:18:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:18:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:18:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-01-31 17:18:15,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7435897435897436 [2024-01-31 17:18:15,661 INFO L175 Difference]: Start difference. First operand has 196 places, 267 transitions, 2636 flow. Second operand 4 states and 116 transitions. [2024-01-31 17:18:15,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 243 transitions, 2765 flow [2024-01-31 17:18:15,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 243 transitions, 2375 flow, removed 166 selfloop flow, removed 22 redundant places. [2024-01-31 17:18:15,834 INFO L231 Difference]: Finished difference. Result has 161 places, 217 transitions, 2192 flow [2024-01-31 17:18:15,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2192, PETRI_PLACES=161, PETRI_TRANSITIONS=217} [2024-01-31 17:18:15,835 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 120 predicate places. [2024-01-31 17:18:15,835 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 217 transitions, 2192 flow [2024-01-31 17:18:15,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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:15,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:15,836 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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:15,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-01-31 17:18:16,047 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:18:16,047 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:18:16,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:16,048 INFO L85 PathProgramCache]: Analyzing trace with hash -946870677, now seen corresponding path program 5 times [2024-01-31 17:18:16,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:16,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077572391] [2024-01-31 17:18:16,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:16,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:16,171 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-01-31 17:18:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:16,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077572391] [2024-01-31 17:18:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077572391] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:18:16,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119683882] [2024-01-31 17:18:16,173 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-31 17:18:16,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:18:16,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:16,174 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:18:16,176 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:18:16,244 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-01-31 17:18:16,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:18:16,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-31 17:18:16,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-31 17:18:16,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-01-31 17:18:16,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119683882] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-31 17:18:16,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-01-31 17:18:16,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-01-31 17:18:16,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311612908] [2024-01-31 17:18:16,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-31 17:18:16,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-31 17:18:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:16,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-31 17:18:16,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-01-31 17:18:16,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 39 [2024-01-31 17:18:16,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 217 transitions, 2192 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:16,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:16,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 39 [2024-01-31 17:18:16,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:17,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L52-->L56: Formula: (and (= (+ v_~front~0_69 1) v_~front~0_68) (= (+ v_~sum~0_44 (select (select |v_#memory_int#4_42| v_~queue~0.base_62) (+ (* v_~front~0_69 4) v_~queue~0.offset_62))) v_~sum~0_43) (not (= (ite (and (< v_~front~0_69 v_~n~0_52) (< v_~front~0_69 v_~back~0_83) (<= 0 v_~front~0_69)) 1 0) 0))) InVars {~sum~0=v_~sum~0_44, ~queue~0.offset=v_~queue~0.offset_62, ~back~0=v_~back~0_83, ~queue~0.base=v_~queue~0.base_62, ~n~0=v_~n~0_52, #memory_int#4=|v_#memory_int#4_42|, ~front~0=v_~front~0_69} OutVars{~sum~0=v_~sum~0_43, ~queue~0.offset=v_~queue~0.offset_62, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~back~0=v_~back~0_83, ~queue~0.base=v_~queue~0.base_62, ~n~0=v_~n~0_52, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, #memory_int#4=|v_#memory_int#4_42|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|, ~front~0=v_~front~0_68} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~mem1#1, ~front~0][180], [Black: 75#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 277#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 275#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 273#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 279#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), 1140#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 869#(and (= ~back~0 ~front~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2 ~front~0)) (< ~front~0 3)) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 905#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 966#true, Black: 877#(and (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 895#(and (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 40#L86true, Black: 899#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 903#(and (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 893#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 901#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 970#(<= ~back~0 ~front~0), Black: 969#(<= ~back~0 (+ ~front~0 1)), Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 917#(and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 889#(and (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 881#(and (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 64#(= ~back~0 ~front~0), Black: 887#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 891#(and (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 885#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 20#L95true, Black: 523#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 543#(and (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0)), Black: 553#(and (= ~back~0 0) (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= ~front~0 0)), Black: 583#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))), Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 573#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (not (= ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1))) (or (< ~front~0 1) (< ~n~0 2))), Black: 459#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))), Black: 517#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 513#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 525#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 589#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 23#L56true, Black: 529#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 569#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 565#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), 433#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 575#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 577#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (= ~v_assert~0 1)), 37#L112-4true, Black: 555#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (and (<= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1))) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (* ~back~0 4)) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (not (= ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1))) (or (< ~front~0 1) (< ~n~0 2))), Black: 286#true, Black: 557#(and (= ~back~0 0) (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= ~front~0 0)), Black: 567#(and (<= 0 ~sum~0) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 519#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 527#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))))), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 531#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 549#(and (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0)), 625#true]) [2024-01-31 17:18:17,378 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-01-31 17:18:17,378 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2024-01-31 17:18:17,378 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2024-01-31 17:18:17,378 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-01-31 17:18:17,384 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L52-->L56: Formula: (and (= (+ v_~front~0_69 1) v_~front~0_68) (= (+ v_~sum~0_44 (select (select |v_#memory_int#4_42| v_~queue~0.base_62) (+ (* v_~front~0_69 4) v_~queue~0.offset_62))) v_~sum~0_43) (not (= (ite (and (< v_~front~0_69 v_~n~0_52) (< v_~front~0_69 v_~back~0_83) (<= 0 v_~front~0_69)) 1 0) 0))) InVars {~sum~0=v_~sum~0_44, ~queue~0.offset=v_~queue~0.offset_62, ~back~0=v_~back~0_83, ~queue~0.base=v_~queue~0.base_62, ~n~0=v_~n~0_52, #memory_int#4=|v_#memory_int#4_42|, ~front~0=v_~front~0_69} OutVars{~sum~0=v_~sum~0_43, ~queue~0.offset=v_~queue~0.offset_62, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~back~0=v_~back~0_83, ~queue~0.base=v_~queue~0.base_62, ~n~0=v_~n~0_52, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, #memory_int#4=|v_#memory_int#4_42|, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|, ~front~0=v_~front~0_68} AuxVars[] AssignedVars[~sum~0, thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_#t~mem1#1, ~front~0][180], [Black: 75#(= |thread2Thread1of1ForFork0_~cond~1#1| 1), Black: 277#(and (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), Black: 275#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 273#(and (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 279#(and (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256)) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (< 0 (mod ~v_assert~0 256)))), 1140#(= |thread2Thread1of1ForFork0_~b~0#1| 0), Black: 869#(and (= ~back~0 ~front~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 2 ~front~0)) (< ~front~0 3)) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 905#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 966#true, Black: 877#(and (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 895#(and (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), 40#L86true, Black: 899#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 903#(and (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 893#(and (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 901#(and (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0))) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 970#(<= ~back~0 ~front~0), Black: 969#(<= ~back~0 (+ ~front~0 1)), Black: 56#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (= ~sum~0 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 917#(and (<= 0 (+ ~sum~0 1)) (= ~back~0 ~front~0) (<= ~sum~0 0) (<= 1 (mod |thread2Thread1of1ForFork0_~cond~1#1| 256))), Black: 58#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (= ~v_assert~0 1) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 889#(and (= ~v_assert~0 1) (= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= ~sum~0 0) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (= |thread2Thread1of1ForFork0_~b~0#1| 1)), Black: 52#(and (<= (div |thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |thread1Thread1of1ForFork2_~cond~0#1|)), Black: 881#(and (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (= ~back~0 ~front~0))), Black: 64#(= ~back~0 ~front~0), Black: 887#(and (= ~sum~0 1) (= ~v_assert~0 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 891#(and (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), Black: 885#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1) (= |thread2Thread1of1ForFork0_~cond~1#1| 1)), 20#L95true, Black: 523#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 543#(and (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0)), Black: 553#(and (= ~back~0 0) (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= ~front~0 0)), Black: 583#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))), Black: 533#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 573#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (= ~queue~0.offset 0) (not (= ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1))) (or (< ~front~0 1) (< ~n~0 2))), Black: 459#(or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))), 22#L113-1true, Black: 517#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 513#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (<= ~n~0 1)), Black: 525#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1)) (and (= ~back~0 ~front~0) (= ~sum~0 0))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 589#(and (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (<= 1 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256))), 23#L56true, Black: 529#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 569#(and (<= 0 ~sum~0) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 565#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1)), 433#(< 0 (mod |thread1Thread1of1ForFork2_~cond~0#1| 256)), Black: 575#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1)), Black: 577#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (= ~v_assert~0 1)), Black: 555#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (< ~back~0 0) (and (<= (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 0) (<= 0 (+ (select (select |#memory_int#4| ~queue~0.base) (* ~front~0 4)) 1))) (< ~n~0 (+ ~back~0 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (* ~back~0 4)) 1))) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (not (= ~front~0 0)) (or (< ~back~0 0) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ ~back~0 1))) (or (< ~front~0 1) (< ~n~0 2))), Black: 286#true, Black: 557#(and (= ~back~0 0) (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= ~front~0 0)), Black: 567#(and (<= 0 ~sum~0) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 519#(and (<= 0 ~sum~0) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 527#(and (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 581#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~sum~0 1) (= ~v_assert~0 1) (or (= (mod |thread2Thread1of1ForFork0_~b~0#1| 256) 0) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (and (<= (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 0) (<= 0 (+ (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1))))), Black: 521#(and (<= 0 ~sum~0) (or (< ~back~0 0) (and (<= 0 (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)))) (<= (+ ~sum~0 (select (select |#memory_int#4| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) 1)) (not (= (select (select |#memory_int#4| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (< ~n~0 (+ ~back~0 1))) (= ~v_assert~0 1) (<= ~sum~0 1)), Black: 531#(and (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~back~0 ~front~0) (= ~v_assert~0 1) (= ~sum~0 0) (= ~queue~0.offset 0) (= |thread2Thread1of1ForFork0_~b~0#1| 1) (<= ~n~0 1)), Black: 549#(and (= (select (select |#memory_int#4| ~queue~0.base) 0) 1) (= |thread1Thread1of1ForFork2_~cond~0#1| 1) (= ~v_assert~0 1) (= ~sum~0 0) (or (< ~back~0 1) (< ~n~0 2)) (= ~queue~0.offset 0) (= ~front~0 0)), 625#true]) [2024-01-31 17:18:17,384 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-01-31 17:18:17,384 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2024-01-31 17:18:17,385 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-01-31 17:18:17,385 INFO L297 olderBase$Statistics]: existing Event has 49 ancestors and is cut-off event [2024-01-31 17:18:17,408 INFO L124 PetriNetUnfolderBase]: 4058/7299 cut-off events. [2024-01-31 17:18:17,408 INFO L125 PetriNetUnfolderBase]: For 85798/86356 co-relation queries the response was YES. [2024-01-31 17:18:17,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39291 conditions, 7299 events. 4058/7299 cut-off events. For 85798/86356 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 46524 event pairs, 950 based on Foata normal form. 744/7799 useless extension candidates. Maximal degree in co-relation 37483. Up to 3303 conditions per place. [2024-01-31 17:18:17,457 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 177 selfloop transitions, 14 changer transitions 14/232 dead transitions. [2024-01-31 17:18:17,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 232 transitions, 2701 flow [2024-01-31 17:18:17,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-31 17:18:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-31 17:18:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2024-01-31 17:18:17,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-01-31 17:18:17,458 INFO L175 Difference]: Start difference. First operand has 161 places, 217 transitions, 2192 flow. Second operand 4 states and 96 transitions. [2024-01-31 17:18:17,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 232 transitions, 2701 flow [2024-01-31 17:18:17,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 232 transitions, 2645 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-01-31 17:18:17,539 INFO L231 Difference]: Finished difference. Result has 156 places, 187 transitions, 1962 flow [2024-01-31 17:18:17,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1962, PETRI_PLACES=156, PETRI_TRANSITIONS=187} [2024-01-31 17:18:17,540 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 115 predicate places. [2024-01-31 17:18:17,540 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 187 transitions, 1962 flow [2024-01-31 17:18:17,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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:17,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:17,540 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:17,564 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:18:17,752 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:18:17,752 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:18:17,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -167650551, now seen corresponding path program 1 times [2024-01-31 17:18:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:17,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143660859] [2024-01-31 17:18:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:17,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:18,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:18,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143660859] [2024-01-31 17:18:18,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143660859] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:18:18,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497602685] [2024-01-31 17:18:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:18,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:18:18,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:18,611 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:18:18,637 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:18:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:18,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 38 conjunts are in the unsatisfiable core [2024-01-31 17:18:18,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:19,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:18:19,471 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2024-01-31 17:18:19,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 75 treesize of output 50 [2024-01-31 17:18:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:19,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497602685] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:18:19,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:18:19,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2024-01-31 17:18:19,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982361177] [2024-01-31 17:18:19,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:18:19,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-01-31 17:18:19,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-01-31 17:18:19,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=981, Unknown=0, NotChecked=0, Total=1190 [2024-01-31 17:18:19,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-01-31 17:18:19,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 187 transitions, 1962 flow. Second operand has 35 states, 35 states have (on average 11.542857142857143) internal successors, (404), 35 states have internal predecessors, (404), 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:19,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:19,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-01-31 17:18:19,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:18:28,757 INFO L124 PetriNetUnfolderBase]: 21154/33246 cut-off events. [2024-01-31 17:18:28,758 INFO L125 PetriNetUnfolderBase]: For 316885/317343 co-relation queries the response was YES. [2024-01-31 17:18:28,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171453 conditions, 33246 events. 21154/33246 cut-off events. For 316885/317343 co-relation queries the response was YES. Maximal size of possible extension queue 961. Compared 227108 event pairs, 2339 based on Foata normal form. 1058/34159 useless extension candidates. Maximal degree in co-relation 167552. Up to 4713 conditions per place. [2024-01-31 17:18:29,023 INFO L140 encePairwiseOnDemand]: 25/39 looper letters, 680 selfloop transitions, 456 changer transitions 158/1303 dead transitions. [2024-01-31 17:18:29,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1303 transitions, 15073 flow [2024-01-31 17:18:29,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-01-31 17:18:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-01-31 17:18:29,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1674 transitions. [2024-01-31 17:18:29,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4379905808477237 [2024-01-31 17:18:29,027 INFO L175 Difference]: Start difference. First operand has 156 places, 187 transitions, 1962 flow. Second operand 98 states and 1674 transitions. [2024-01-31 17:18:29,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1303 transitions, 15073 flow [2024-01-31 17:18:29,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 1303 transitions, 14151 flow, removed 458 selfloop flow, removed 9 redundant places. [2024-01-31 17:18:29,825 INFO L231 Difference]: Finished difference. Result has 276 places, 569 transitions, 7870 flow [2024-01-31 17:18:29,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1924, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=7870, PETRI_PLACES=276, PETRI_TRANSITIONS=569} [2024-01-31 17:18:29,826 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 235 predicate places. [2024-01-31 17:18:29,827 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 569 transitions, 7870 flow [2024-01-31 17:18:29,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 11.542857142857143) internal successors, (404), 35 states have internal predecessors, (404), 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:29,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:18:29,827 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-31 17:18:29,840 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:18:30,037 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:18:30,038 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:18:30,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:18:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1341642513, now seen corresponding path program 2 times [2024-01-31 17:18:30,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:18:30,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877973625] [2024-01-31 17:18:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:18:30,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:18:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:18:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:30,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:18:30,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877973625] [2024-01-31 17:18:30,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877973625] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:18:30,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524334334] [2024-01-31 17:18:30,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-31 17:18:30,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:18:30,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:18:30,917 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:18:30,948 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:18:31,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-31 17:18:31,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:18:31,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 35 conjunts are in the unsatisfiable core [2024-01-31 17:18:31,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:18:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:31,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:18:31,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:18:31,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 75 treesize of output 60 [2024-01-31 17:18:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:18:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524334334] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:18:32,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:18:32,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 39 [2024-01-31 17:18:32,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368305588] [2024-01-31 17:18:32,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:18:32,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-01-31 17:18:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:18:32,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-01-31 17:18:32,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1348, Unknown=0, NotChecked=0, Total=1560 [2024-01-31 17:18:32,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-01-31 17:18:32,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 569 transitions, 7870 flow. Second operand has 40 states, 40 states have (on average 9.575) internal successors, (383), 40 states have internal predecessors, (383), 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:32,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:18:32,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-01-31 17:18:32,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-31 17:19:07,717 INFO L124 PetriNetUnfolderBase]: 50240/77497 cut-off events. [2024-01-31 17:19:07,717 INFO L125 PetriNetUnfolderBase]: For 1532497/1532497 co-relation queries the response was YES. [2024-01-31 17:19:08,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456774 conditions, 77497 events. 50240/77497 cut-off events. For 1532497/1532497 co-relation queries the response was YES. Maximal size of possible extension queue 1065. Compared 536134 event pairs, 3247 based on Foata normal form. 3860/81356 useless extension candidates. Maximal degree in co-relation 454949. Up to 10643 conditions per place. [2024-01-31 17:19:08,714 INFO L140 encePairwiseOnDemand]: 22/39 looper letters, 1521 selfloop transitions, 882 changer transitions 1001/3408 dead transitions. [2024-01-31 17:19:08,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 3408 transitions, 44196 flow [2024-01-31 17:19:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2024-01-31 17:19:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2024-01-31 17:19:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 3967 transitions. [2024-01-31 17:19:08,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41015301902398676 [2024-01-31 17:19:08,721 INFO L175 Difference]: Start difference. First operand has 276 places, 569 transitions, 7870 flow. Second operand 248 states and 3967 transitions. [2024-01-31 17:19:08,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 3408 transitions, 44196 flow [2024-01-31 17:19:18,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 485 places, 3408 transitions, 41642 flow, removed 1147 selfloop flow, removed 16 redundant places. [2024-01-31 17:19:18,784 INFO L231 Difference]: Finished difference. Result has 561 places, 1079 transitions, 17853 flow [2024-01-31 17:19:18,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4489, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=248, PETRI_FLOW=17853, PETRI_PLACES=561, PETRI_TRANSITIONS=1079} [2024-01-31 17:19:18,785 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 520 predicate places. [2024-01-31 17:19:18,785 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 1079 transitions, 17853 flow [2024-01-31 17:19:18,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 9.575) internal successors, (383), 40 states have internal predecessors, (383), 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:19:18,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-31 17:19:18,786 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-01-31 17:19:18,801 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:19:18,996 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:19:18,997 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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:19:18,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-31 17:19:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1990539239, now seen corresponding path program 3 times [2024-01-31 17:19:18,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-31 17:19:18,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194380580] [2024-01-31 17:19:18,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-31 17:19:18,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-31 17:19:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-31 17:19:20,114 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-31 17:19:20,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-31 17:19:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194380580] [2024-01-31 17:19:20,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194380580] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-31 17:19:20,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878883240] [2024-01-31 17:19:20,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-31 17:19:20,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-31 17:19:20,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-31 17:19:20,115 INFO L229 MonitoredProcess]: Starting monitored process 9 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:19:20,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-01-31 17:19:20,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-31 17:19:20,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-31 17:19:20,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 30 conjunts are in the unsatisfiable core [2024-01-31 17:19:20,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-31 17:19:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-31 17:19:20,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-31 17:19:20,620 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-01-31 17:19:20,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 75 treesize of output 60 [2024-01-31 17:19:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-01-31 17:19:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878883240] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-31 17:19:20,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-31 17:19:20,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 30 [2024-01-31 17:19:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603247224] [2024-01-31 17:19:20,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-31 17:19:20,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-01-31 17:19:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-31 17:19:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-01-31 17:19:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2024-01-31 17:19:20,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-01-31 17:19:20,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1079 transitions, 17853 flow. Second operand has 31 states, 31 states have (on average 11.290322580645162) internal successors, (350), 31 states have internal predecessors, (350), 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:19:20,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-31 17:19:20,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-01-31 17:19:20,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand