./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c245694d80bb36f575f27eb50fa261b26ec38a4ced597397981ad6c6c7486707 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:59:26,597 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:59:26,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:59:26,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:59:26,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:59:26,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:59:26,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:59:26,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:59:26,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:59:26,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:59:26,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:59:26,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:59:26,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:59:26,695 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:59:26,695 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:59:26,695 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:59:26,696 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:59:26,696 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:59:26,696 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:59:26,696 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:59:26,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:59:26,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:59:26,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:59:26,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:59:26,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:59:26,698 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:59:26,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:59:26,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:59:26,699 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:59:26,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:59:26,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:59:26,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:59:26,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:59:26,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:59:26,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:59:26,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:59:26,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:59:26,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:59:26,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:59:26,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:59:26,702 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:59:26,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:59:26,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:59:26,703 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c245694d80bb36f575f27eb50fa261b26ec38a4ced597397981ad6c6c7486707 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:59:26,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:59:26,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:59:26,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:59:26,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:59:26,954 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:59:26,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-02-20 11:59:28,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:59:28,238 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:59:28,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-02-20 11:59:28,245 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92671a47e/c206380b3de44b7b91a300b6cb418d45/FLAG1f3479a29 [2024-02-20 11:59:28,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92671a47e/c206380b3de44b7b91a300b6cb418d45 [2024-02-20 11:59:28,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:59:28,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:59:28,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:59:28,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:59:28,267 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:59:28,268 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456a9b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28, skipping insertion in model container [2024-02-20 11:59:28,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,287 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:59:28,412 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/parallel-misc-2.wvr.c[2554,2567] [2024-02-20 11:59:28,418 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:59:28,425 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:59:28,438 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/parallel-misc-2.wvr.c[2554,2567] [2024-02-20 11:59:28,439 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:59:28,451 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:59:28,452 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28 WrapperNode [2024-02-20 11:59:28,452 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:59:28,453 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:59:28,453 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:59:28,453 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:59:28,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,481 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-02-20 11:59:28,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:59:28,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:59:28,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:59:28,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:59:28,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,493 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,503 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-20 11:59:28,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:59:28,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:59:28,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:59:28,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:59:28,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (1/1) ... [2024-02-20 11:59:28,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:59:28,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:59:28,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-20 11:59:28,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-20 11:59:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:59:28,626 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:59:28,626 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:59:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:59:28,627 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:59:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:59:28,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:59:28,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:59:28,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:59:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:59:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:59:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:59:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-20 11:59:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-20 11:59:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:59:28,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:59:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:59:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:59:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:59:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:59:28,632 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:59:28,738 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:59:28,740 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:59:28,881 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:59:28,882 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:59:29,034 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:59:29,035 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-20 11:59:29,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:29 BoogieIcfgContainer [2024-02-20 11:59:29,035 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:59:29,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:59:29,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:59:29,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:59:29,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:59:28" (1/3) ... [2024-02-20 11:59:29,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f1d65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:29, skipping insertion in model container [2024-02-20 11:59:29,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:59:28" (2/3) ... [2024-02-20 11:59:29,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16f1d65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:59:29, skipping insertion in model container [2024-02-20 11:59:29,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:59:29" (3/3) ... [2024-02-20 11:59:29,041 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-02-20 11:59:29,054 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:59:29,055 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:59:29,055 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:59:29,079 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 11:59:29,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2024-02-20 11:59:29,134 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-02-20 11:59:29,134 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:59:29,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2024-02-20 11:59:29,136 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2024-02-20 11:59:29,139 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 24 transitions, 60 flow [2024-02-20 11:59:29,146 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:59:29,151 INFO L369 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7409ff82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:59:29,151 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:59:29,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:59:29,166 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2024-02-20 11:59:29,166 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:59:29,166 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:29,167 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:29,167 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:29,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash 79330567, now seen corresponding path program 1 times [2024-02-20 11:59:29,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:29,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645569715] [2024-02-20 11:59:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:29,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:29,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:29,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:29,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645569715] [2024-02-20 11:59:29,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645569715] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:59:29,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:59:29,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:59:29,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17303779] [2024-02-20 11:59:29,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:59:29,455 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:59:29,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:29,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:59:29,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:59:29,562 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:29,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:29,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:29,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:29,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:29,675 INFO L124 PetriNetUnfolderBase]: 88/166 cut-off events. [2024-02-20 11:59:29,675 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-02-20 11:59:29,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 166 events. 88/166 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 487 event pairs, 9 based on Foata normal form. 1/150 useless extension candidates. Maximal degree in co-relation 255. Up to 112 conditions per place. [2024-02-20 11:59:29,678 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 23 selfloop transitions, 5 changer transitions 1/36 dead transitions. [2024-02-20 11:59:29,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 36 transitions, 151 flow [2024-02-20 11:59:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:59:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:59:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2024-02-20 11:59:29,693 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2024-02-20 11:59:29,695 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2024-02-20 11:59:29,695 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 36 transitions, 151 flow [2024-02-20 11:59:29,696 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:29,696 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:29,696 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:29,696 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:59:29,696 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:29,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:29,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1723996375, now seen corresponding path program 1 times [2024-02-20 11:59:29,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:29,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845336014] [2024-02-20 11:59:29,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:29,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:29,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:29,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845336014] [2024-02-20 11:59:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845336014] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:59:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:59:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:59:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744981415] [2024-02-20 11:59:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:59:29,805 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:59:29,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:59:29,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:59:29,812 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:29,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 36 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:29,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:29,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:29,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:29,913 INFO L124 PetriNetUnfolderBase]: 168/307 cut-off events. [2024-02-20 11:59:29,913 INFO L125 PetriNetUnfolderBase]: For 85/89 co-relation queries the response was YES. [2024-02-20 11:59:29,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805 conditions, 307 events. 168/307 cut-off events. For 85/89 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1147 event pairs, 23 based on Foata normal form. 2/282 useless extension candidates. Maximal degree in co-relation 661. Up to 197 conditions per place. [2024-02-20 11:59:29,916 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 43 selfloop transitions, 11 changer transitions 3/66 dead transitions. [2024-02-20 11:59:29,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 66 transitions, 389 flow [2024-02-20 11:59:29,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:59:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:59:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-02-20 11:59:29,918 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6888888888888889 [2024-02-20 11:59:29,918 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2024-02-20 11:59:29,919 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 66 transitions, 389 flow [2024-02-20 11:59:29,919 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:29,919 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:29,919 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:29,919 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:59:29,919 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:29,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:29,920 INFO L85 PathProgramCache]: Analyzing trace with hash -979555925, now seen corresponding path program 2 times [2024-02-20 11:59:29,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:29,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862688571] [2024-02-20 11:59:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:29,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:29,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:29,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862688571] [2024-02-20 11:59:29,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862688571] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:59:29,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:59:29,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:59:29,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954699620] [2024-02-20 11:59:29,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:59:29,993 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:59:29,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:59:29,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:59:29,999 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:29,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 66 transitions, 389 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:29,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:29,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:29,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:30,092 INFO L124 PetriNetUnfolderBase]: 186/361 cut-off events. [2024-02-20 11:59:30,092 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-02-20 11:59:30,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1159 conditions, 361 events. 186/361 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1503 event pairs, 12 based on Foata normal form. 14/343 useless extension candidates. Maximal degree in co-relation 964. Up to 220 conditions per place. [2024-02-20 11:59:30,095 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 60 selfloop transitions, 13 changer transitions 4/86 dead transitions. [2024-02-20 11:59:30,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 86 transitions, 665 flow [2024-02-20 11:59:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:59:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:59:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-02-20 11:59:30,097 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2024-02-20 11:59:30,098 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 10 predicate places. [2024-02-20 11:59:30,098 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 86 transitions, 665 flow [2024-02-20 11:59:30,098 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:30,098 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:30,098 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:30,099 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:59:30,099 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:30,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:30,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1275119413, now seen corresponding path program 1 times [2024-02-20 11:59:30,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:30,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483288077] [2024-02-20 11:59:30,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:30,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:30,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:30,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483288077] [2024-02-20 11:59:30,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483288077] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:59:30,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:59:30,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:59:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537460064] [2024-02-20 11:59:30,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:59:30,187 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:59:30,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:30,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:59:30,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:59:30,190 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:30,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 86 transitions, 665 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:30,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:30,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:30,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:30,293 INFO L124 PetriNetUnfolderBase]: 189/372 cut-off events. [2024-02-20 11:59:30,294 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2024-02-20 11:59:30,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 372 events. 189/372 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1587 event pairs, 12 based on Foata normal form. 4/344 useless extension candidates. Maximal degree in co-relation 1235. Up to 235 conditions per place. [2024-02-20 11:59:30,297 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 73 selfloop transitions, 10 changer transitions 10/102 dead transitions. [2024-02-20 11:59:30,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 102 transitions, 985 flow [2024-02-20 11:59:30,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:59:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:59:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-02-20 11:59:30,298 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6962962962962963 [2024-02-20 11:59:30,299 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 14 predicate places. [2024-02-20 11:59:30,299 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 102 transitions, 985 flow [2024-02-20 11:59:30,299 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:30,299 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:30,300 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:30,300 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:59:30,300 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:30,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash 687729223, now seen corresponding path program 2 times [2024-02-20 11:59:30,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:30,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966432851] [2024-02-20 11:59:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:30,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:30,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:30,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966432851] [2024-02-20 11:59:30,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966432851] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:59:30,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:59:30,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:59:30,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964370506] [2024-02-20 11:59:30,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:59:30,364 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:59:30,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:30,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:59:30,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:59:30,368 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:30,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 102 transitions, 985 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:30,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:30,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:30,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:30,466 INFO L124 PetriNetUnfolderBase]: 191/386 cut-off events. [2024-02-20 11:59:30,466 INFO L125 PetriNetUnfolderBase]: For 704/704 co-relation queries the response was YES. [2024-02-20 11:59:30,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1786 conditions, 386 events. 191/386 cut-off events. For 704/704 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1553 event pairs, 12 based on Foata normal form. 12/362 useless extension candidates. Maximal degree in co-relation 1507. Up to 238 conditions per place. [2024-02-20 11:59:30,469 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 76 selfloop transitions, 14 changer transitions 10/109 dead transitions. [2024-02-20 11:59:30,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 109 transitions, 1242 flow [2024-02-20 11:59:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:59:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:59:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-02-20 11:59:30,472 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-20 11:59:30,474 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 18 predicate places. [2024-02-20 11:59:30,474 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 109 transitions, 1242 flow [2024-02-20 11:59:30,474 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:30,474 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:30,475 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:30,475 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:59:30,475 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:30,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:30,477 INFO L85 PathProgramCache]: Analyzing trace with hash -226007433, now seen corresponding path program 1 times [2024-02-20 11:59:30,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:30,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518840331] [2024-02-20 11:59:30,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:30,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518840331] [2024-02-20 11:59:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518840331] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:59:30,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399258514] [2024-02-20 11:59:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:30,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:59:30,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:59:30,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:59:30,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-20 11:59:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:30,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 11:59:30,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:59:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:30,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:59:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:31,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399258514] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:59:31,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:59:31,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 10 [2024-02-20 11:59:31,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388421654] [2024-02-20 11:59:31,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:59:31,168 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-02-20 11:59:31,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:31,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-02-20 11:59:31,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-02-20 11:59:31,187 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-02-20 11:59:31,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 109 transitions, 1242 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:31,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:31,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-02-20 11:59:31,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:31,470 INFO L124 PetriNetUnfolderBase]: 349/687 cut-off events. [2024-02-20 11:59:31,470 INFO L125 PetriNetUnfolderBase]: For 1572/1572 co-relation queries the response was YES. [2024-02-20 11:59:31,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 687 events. 349/687 cut-off events. For 1572/1572 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3056 event pairs, 2 based on Foata normal form. 16/647 useless extension candidates. Maximal degree in co-relation 3271. Up to 450 conditions per place. [2024-02-20 11:59:31,477 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 143 selfloop transitions, 30 changer transitions 10/188 dead transitions. [2024-02-20 11:59:31,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 188 transitions, 2482 flow [2024-02-20 11:59:31,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:59:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:59:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 180 transitions. [2024-02-20 11:59:31,479 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-02-20 11:59:31,481 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2024-02-20 11:59:31,482 INFO L507 AbstractCegarLoop]: Abstraction has has 55 places, 188 transitions, 2482 flow [2024-02-20 11:59:31,482 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:31,482 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:31,482 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:31,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-20 11:59:31,693 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-20 11:59:31,695 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:31,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:31,696 INFO L85 PathProgramCache]: Analyzing trace with hash 44165793, now seen corresponding path program 2 times [2024-02-20 11:59:31,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:31,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813623651] [2024-02-20 11:59:31,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:31,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:31,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:31,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813623651] [2024-02-20 11:59:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813623651] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:59:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:59:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:59:31,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529315669] [2024-02-20 11:59:31,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:59:31,801 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:59:31,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:59:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:59:31,805 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:31,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 188 transitions, 2482 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:31,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:31,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:31,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:32,008 INFO L124 PetriNetUnfolderBase]: 860/1569 cut-off events. [2024-02-20 11:59:32,008 INFO L125 PetriNetUnfolderBase]: For 9029/9029 co-relation queries the response was YES. [2024-02-20 11:59:32,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9984 conditions, 1569 events. 860/1569 cut-off events. For 9029/9029 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8225 event pairs, 30 based on Foata normal form. 0/1483 useless extension candidates. Maximal degree in co-relation 9535. Up to 1102 conditions per place. [2024-02-20 11:59:32,019 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 305 selfloop transitions, 26 changer transitions 10/386 dead transitions. [2024-02-20 11:59:32,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 386 transitions, 5996 flow [2024-02-20 11:59:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:59:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:59:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2024-02-20 11:59:32,020 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7314814814814815 [2024-02-20 11:59:32,020 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2024-02-20 11:59:32,020 INFO L507 AbstractCegarLoop]: Abstraction has has 58 places, 386 transitions, 5996 flow [2024-02-20 11:59:32,020 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:32,020 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:32,021 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:32,021 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:59:32,021 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:32,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash -2115816681, now seen corresponding path program 1 times [2024-02-20 11:59:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064318837] [2024-02-20 11:59:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064318837] [2024-02-20 11:59:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064318837] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:59:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085041429] [2024-02-20 11:59:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:32,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:59:32,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:59:32,181 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:59:32,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-20 11:59:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:32,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-20 11:59:32,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:59:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:32,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:59:32,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:32,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085041429] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:59:32,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:59:32,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2024-02-20 11:59:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704951784] [2024-02-20 11:59:32,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:59:32,680 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 11:59:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:32,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 11:59:32,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-02-20 11:59:32,689 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2024-02-20 11:59:32,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 386 transitions, 5996 flow. Second operand has 15 states, 15 states have (on average 10.333333333333334) internal successors, (155), 15 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:32,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:32,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2024-02-20 11:59:32,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:33,692 INFO L124 PetriNetUnfolderBase]: 1659/2959 cut-off events. [2024-02-20 11:59:33,693 INFO L125 PetriNetUnfolderBase]: For 21328/21328 co-relation queries the response was YES. [2024-02-20 11:59:33,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21206 conditions, 2959 events. 1659/2959 cut-off events. For 21328/21328 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 17974 event pairs, 66 based on Foata normal form. 24/2791 useless extension candidates. Maximal degree in co-relation 20535. Up to 2144 conditions per place. [2024-02-20 11:59:33,720 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 526 selfloop transitions, 129 changer transitions 30/692 dead transitions. [2024-02-20 11:59:33,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 692 transitions, 12056 flow [2024-02-20 11:59:33,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-20 11:59:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-20 11:59:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 278 transitions. [2024-02-20 11:59:33,722 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5720164609053497 [2024-02-20 11:59:33,722 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2024-02-20 11:59:33,722 INFO L507 AbstractCegarLoop]: Abstraction has has 75 places, 692 transitions, 12056 flow [2024-02-20 11:59:33,723 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.333333333333334) internal successors, (155), 15 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:33,723 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:33,723 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:33,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-20 11:59:33,934 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-02-20 11:59:33,935 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:33,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:33,936 INFO L85 PathProgramCache]: Analyzing trace with hash 121826187, now seen corresponding path program 2 times [2024-02-20 11:59:33,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:33,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648245363] [2024-02-20 11:59:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:33,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:34,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648245363] [2024-02-20 11:59:34,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648245363] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:59:34,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945057169] [2024-02-20 11:59:34,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:59:34,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:59:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:59:34,035 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-02-20 11:59:34,036 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-02-20 11:59:34,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:59:34,137 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:59:34,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-20 11:59:34,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:59:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:34,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:59:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:34,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945057169] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:59:34,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:59:34,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-02-20 11:59:34,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451280632] [2024-02-20 11:59:34,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:59:34,389 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:59:34,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:59:34,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:59:34,393 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:34,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 692 transitions, 12056 flow. Second operand has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:34,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:34,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:34,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:36,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:59:42,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:59:43,063 INFO L124 PetriNetUnfolderBase]: 4382/7940 cut-off events. [2024-02-20 11:59:43,064 INFO L125 PetriNetUnfolderBase]: For 65722/65722 co-relation queries the response was YES. [2024-02-20 11:59:43,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62537 conditions, 7940 events. 4382/7940 cut-off events. For 65722/65722 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 56930 event pairs, 160 based on Foata normal form. 204/7572 useless extension candidates. Maximal degree in co-relation 61244. Up to 5624 conditions per place. [2024-02-20 11:59:43,136 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 1481 selfloop transitions, 400 changer transitions 10/1930 dead transitions. [2024-02-20 11:59:43,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 1930 transitions, 38199 flow [2024-02-20 11:59:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-02-20 11:59:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-02-20 11:59:43,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 463 transitions. [2024-02-20 11:59:43,139 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6595441595441596 [2024-02-20 11:59:43,140 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 70 predicate places. [2024-02-20 11:59:43,140 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 1930 transitions, 38199 flow [2024-02-20 11:59:43,140 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:43,140 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:43,140 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:43,154 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-02-20 11:59:43,352 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:59:43,353 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:43,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:43,353 INFO L85 PathProgramCache]: Analyzing trace with hash 627681431, now seen corresponding path program 3 times [2024-02-20 11:59:43,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:43,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294895114] [2024-02-20 11:59:43,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:59:43,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:43,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294895114] [2024-02-20 11:59:43,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294895114] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:59:43,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819117594] [2024-02-20 11:59:43,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:59:43,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:59:43,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:59:43,558 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-02-20 11:59:43,559 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-02-20 11:59:43,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-20 11:59:43,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:59:43,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 11:59:43,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:59:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-20 11:59:43,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:59:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-02-20 11:59:44,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819117594] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:59:44,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:59:44,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-02-20 11:59:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005282439] [2024-02-20 11:59:44,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:59:44,225 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-02-20 11:59:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:44,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-02-20 11:59:44,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:59:44,227 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:44,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 1930 transitions, 38199 flow. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:44,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:44,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:44,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:59:49,718 INFO L124 PetriNetUnfolderBase]: 9749/17392 cut-off events. [2024-02-20 11:59:49,718 INFO L125 PetriNetUnfolderBase]: For 182543/182543 co-relation queries the response was YES. [2024-02-20 11:59:49,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150253 conditions, 17392 events. 9749/17392 cut-off events. For 182543/182543 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 128988 event pairs, 298 based on Foata normal form. 468/16568 useless extension candidates. Maximal degree in co-relation 147944. Up to 12219 conditions per place. [2024-02-20 11:59:50,040 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 3496 selfloop transitions, 595 changer transitions 10/4140 dead transitions. [2024-02-20 11:59:50,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 4140 transitions, 90408 flow [2024-02-20 11:59:50,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-02-20 11:59:50,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-02-20 11:59:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 410 transitions. [2024-02-20 11:59:50,042 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6902356902356902 [2024-02-20 11:59:50,043 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 91 predicate places. [2024-02-20 11:59:50,043 INFO L507 AbstractCegarLoop]: Abstraction has has 118 places, 4140 transitions, 90408 flow [2024-02-20 11:59:50,043 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 10 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:50,043 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:59:50,044 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:59:50,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-20 11:59:50,256 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:59:50,257 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:59:50,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:59:50,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1638187675, now seen corresponding path program 4 times [2024-02-20 11:59:50,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:59:50,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668220595] [2024-02-20 11:59:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:59:50,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:59:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:59:50,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:59:50,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:59:50,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668220595] [2024-02-20 11:59:50,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668220595] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:59:50,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:59:50,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:59:50,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171839352] [2024-02-20 11:59:50,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:59:50,360 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:59:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:59:50,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:59:50,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:59:50,364 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 11:59:50,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 4140 transitions, 90408 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:59:50,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:59:50,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 11:59:50,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:00:20,898 INFO L124 PetriNetUnfolderBase]: 28350/49994 cut-off events. [2024-02-20 12:00:20,898 INFO L125 PetriNetUnfolderBase]: For 632230/633062 co-relation queries the response was YES. [2024-02-20 12:00:21,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462999 conditions, 49994 events. 28350/49994 cut-off events. For 632230/633062 co-relation queries the response was YES. Maximal size of possible extension queue 1586. Compared 432953 event pairs, 1543 based on Foata normal form. 414/47700 useless extension candidates. Maximal degree in co-relation 456002. Up to 34949 conditions per place. [2024-02-20 12:00:21,463 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 8933 selfloop transitions, 911 changer transitions 10/10151 dead transitions. [2024-02-20 12:00:21,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 10151 transitions, 244175 flow [2024-02-20 12:00:21,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 12:00:21,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 12:00:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2024-02-20 12:00:21,464 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-02-20 12:00:21,465 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 94 predicate places. [2024-02-20 12:00:21,465 INFO L507 AbstractCegarLoop]: Abstraction has has 121 places, 10151 transitions, 244175 flow [2024-02-20 12:00:21,465 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:00:21,465 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:00:21,465 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:00:21,466 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-20 12:00:21,466 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:00:21,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:00:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1440714363, now seen corresponding path program 1 times [2024-02-20 12:00:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:00:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310020833] [2024-02-20 12:00:21,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:00:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:00:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:00:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:00:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:00:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310020833] [2024-02-20 12:00:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310020833] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:00:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536654621] [2024-02-20 12:00:21,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:00:21,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:00:21,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:00:21,714 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-02-20 12:00:21,714 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-02-20 12:00:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:00:21,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:00:21,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:00:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:00:21,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:00:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 12:00:21,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536654621] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:00:21,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:00:21,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-02-20 12:00:21,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52239227] [2024-02-20 12:00:21,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:00:21,934 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 12:00:21,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:00:21,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 12:00:21,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-02-20 12:00:21,937 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 12:00:21,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 10151 transitions, 244175 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:00:21,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:00:21,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 12:00:21,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 12:03:36,224 INFO L124 PetriNetUnfolderBase]: 49923/88424 cut-off events. [2024-02-20 12:03:36,224 INFO L125 PetriNetUnfolderBase]: For 1338163/1338950 co-relation queries the response was YES. [2024-02-20 12:03:36,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 885690 conditions, 88424 events. 49923/88424 cut-off events. For 1338163/1338950 co-relation queries the response was YES. Maximal size of possible extension queue 2591. Compared 822174 event pairs, 3003 based on Foata normal form. 40/84237 useless extension candidates. Maximal degree in co-relation 873183. Up to 62556 conditions per place. [2024-02-20 12:03:37,233 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 18511 selfloop transitions, 1581 changer transitions 276/20637 dead transitions. [2024-02-20 12:03:37,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 20637 transitions, 537814 flow [2024-02-20 12:03:37,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 12:03:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 12:03:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-02-20 12:03:37,234 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.808641975308642 [2024-02-20 12:03:37,235 INFO L308 CegarLoopForPetriNet]: 27 programPoint places, 99 predicate places. [2024-02-20 12:03:37,235 INFO L507 AbstractCegarLoop]: Abstraction has has 126 places, 20637 transitions, 537814 flow [2024-02-20 12:03:37,235 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:03:37,235 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 12:03:37,235 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 12:03:37,247 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-02-20 12:03:37,447 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-02-20 12:03:37,447 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 12:03:37,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 12:03:37,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1830567677, now seen corresponding path program 2 times [2024-02-20 12:03:37,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 12:03:37,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687213805] [2024-02-20 12:03:37,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 12:03:37,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 12:03:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 12:03:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:03:37,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 12:03:37,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687213805] [2024-02-20 12:03:37,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687213805] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 12:03:37,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526468155] [2024-02-20 12:03:37,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 12:03:37,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 12:03:37,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 12:03:37,619 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-02-20 12:03:37,632 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-02-20 12:03:37,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 12:03:37,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 12:03:37,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 12:03:37,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 12:03:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:03:37,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 12:03:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 12:03:37,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526468155] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 12:03:37,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 12:03:37,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-02-20 12:03:37,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600695116] [2024-02-20 12:03:37,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 12:03:37,791 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 12:03:37,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 12:03:37,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 12:03:37,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 12:03:37,799 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2024-02-20 12:03:37,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 20637 transitions, 537814 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 12:03:37,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 12:03:37,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2024-02-20 12:03:37,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15