./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.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/chl-nzb-file-subst.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 57b20b3268fa30a07af1365aac59c96531ad2ebea6861c18a1d5dfea8339adbb --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:53:10,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:53:10,576 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:53:10,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:53:10,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:53:10,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:53:10,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:53:10,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:53:10,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:53:10,611 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:53:10,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:53:10,612 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:53:10,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:53:10,614 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:53:10,614 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:53:10,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:53:10,614 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:53:10,615 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:53:10,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:53:10,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:53:10,615 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:53:10,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:53:10,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:53:10,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:53:10,616 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:53:10,616 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:53:10,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:53:10,617 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:53:10,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:53:10,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:53:10,618 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:53:10,618 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:53:10,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:53:10,619 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:53:10,619 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:53:10,619 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:53:10,619 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:53:10,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:53:10,620 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:53:10,620 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:53:10,620 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:53:10,620 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:53:10,620 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:53:10,621 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 -> 57b20b3268fa30a07af1365aac59c96531ad2ebea6861c18a1d5dfea8339adbb Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:53:10,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:53:10,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:53:10,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:53:10,836 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:53:10,836 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:53:10,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2024-02-20 11:53:11,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:53:12,036 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:53:12,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2024-02-20 11:53:12,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d21db836/ba9cc14c420a480486ae94a370f5c4f6/FLAG06c483502 [2024-02-20 11:53:12,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d21db836/ba9cc14c420a480486ae94a370f5c4f6 [2024-02-20 11:53:12,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:53:12,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:53:12,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:53:12,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:53:12,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:53:12,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e13a72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12, skipping insertion in model container [2024-02-20 11:53:12,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,104 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:53:12,271 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/chl-nzb-file-subst.wvr.c[6501,6514] [2024-02-20 11:53:12,278 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:53:12,284 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:53:12,313 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/chl-nzb-file-subst.wvr.c[6501,6514] [2024-02-20 11:53:12,316 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:53:12,337 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:53:12,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12 WrapperNode [2024-02-20 11:53:12,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:53:12,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:53:12,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:53:12,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:53:12,343 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:53:12" (1/1) ... [2024-02-20 11:53:12,352 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:53:12" (1/1) ... [2024-02-20 11:53:12,386 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 603 [2024-02-20 11:53:12,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:53:12,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:53:12,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:53:12,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:53:12,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,431 INFO L175 MemorySlicer]: Split 35 memory accesses to 5 slices as follows [2, 2, 2, 2, 27]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 1, 3]. [2024-02-20 11:53:12,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:53:12,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:53:12,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:53:12,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:53:12,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (1/1) ... [2024-02-20 11:53:12,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:53:12,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:12,535 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:53:12,553 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:53:12,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:53:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:53:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:53:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:53:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:53:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:53:12,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 11:53:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:53:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:53:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:53:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 11:53:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 11:53:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:53:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:53:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:53:12,579 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:53:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 11:53:12,580 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 11:53:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:53:12,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:53:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:53:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:53:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 11:53:12,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-02-20 11:53:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:53:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:53:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:53:12,583 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:53:12,728 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:53:12,729 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:53:13,319 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:53:13,319 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:53:13,896 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:53:13,896 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-02-20 11:53:13,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:13 BoogieIcfgContainer [2024-02-20 11:53:13,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:53:13,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:53:13,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:53:13,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:53:13,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:12" (1/3) ... [2024-02-20 11:53:13,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12484d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:13, skipping insertion in model container [2024-02-20 11:53:13,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:12" (2/3) ... [2024-02-20 11:53:13,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12484d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:13, skipping insertion in model container [2024-02-20 11:53:13,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:13" (3/3) ... [2024-02-20 11:53:13,905 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2024-02-20 11:53:13,920 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:53:13,920 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:53:13,920 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:53:14,011 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-20 11:53:14,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 51 transitions, 123 flow [2024-02-20 11:53:14,066 INFO L124 PetriNetUnfolderBase]: 12/48 cut-off events. [2024-02-20 11:53:14,067 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 11:53:14,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 12/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2024-02-20 11:53:14,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 51 transitions, 123 flow [2024-02-20 11:53:14,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 47 transitions, 112 flow [2024-02-20 11:53:14,078 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:53:14,082 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;@3508f62d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:53:14,083 INFO L370 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-02-20 11:53:14,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:53:14,095 INFO L124 PetriNetUnfolderBase]: 12/46 cut-off events. [2024-02-20 11:53:14,095 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-20 11:53:14,095 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:14,096 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, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:14,096 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:14,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash 2016359513, now seen corresponding path program 1 times [2024-02-20 11:53:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717062857] [2024-02-20 11:53:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:14,516 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:53:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717062857] [2024-02-20 11:53:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717062857] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:14,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:14,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:53:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103988097] [2024-02-20 11:53:14,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:14,525 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:53:14,556 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:14,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 47 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:53:14,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:14,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:14,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:14,922 INFO L124 PetriNetUnfolderBase]: 1043/1473 cut-off events. [2024-02-20 11:53:14,922 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-02-20 11:53:14,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 1473 events. 1043/1473 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 6362 event pairs, 652 based on Foata normal form. 194/1239 useless extension candidates. Maximal degree in co-relation 2544. Up to 1420 conditions per place. [2024-02-20 11:53:14,932 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 34 selfloop transitions, 6 changer transitions 0/47 dead transitions. [2024-02-20 11:53:14,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 192 flow [2024-02-20 11:53:14,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-02-20 11:53:14,941 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49673202614379086 [2024-02-20 11:53:14,944 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-02-20 11:53:14,944 INFO L507 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 192 flow [2024-02-20 11:53:14,944 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:53:14,944 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:14,944 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:14,945 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:53:14,945 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:14,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash -155160341, now seen corresponding path program 1 times [2024-02-20 11:53:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927595269] [2024-02-20 11:53:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:14,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:53:15,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927595269] [2024-02-20 11:53:15,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927595269] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:15,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815736034] [2024-02-20 11:53:15,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:15,085 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:53:15,113 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:53:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:15,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 11:53:15,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:53:15,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:53:15,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-02-20 11:53:15,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815736034] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:53:15,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:53:15,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-02-20 11:53:15,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975146782] [2024-02-20 11:53:15,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:53:15,360 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-02-20 11:53:15,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:15,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-02-20 11:53:15,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-02-20 11:53:15,361 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:15,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 192 flow. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 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:53:15,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:15,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:15,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:15,720 INFO L124 PetriNetUnfolderBase]: 1043/1482 cut-off events. [2024-02-20 11:53:15,720 INFO L125 PetriNetUnfolderBase]: For 141/227 co-relation queries the response was YES. [2024-02-20 11:53:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4443 conditions, 1482 events. 1043/1482 cut-off events. For 141/227 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6407 event pairs, 652 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 3761. Up to 1429 conditions per place. [2024-02-20 11:53:15,729 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 34 selfloop transitions, 15 changer transitions 0/56 dead transitions. [2024-02-20 11:53:15,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 56 transitions, 326 flow [2024-02-20 11:53:15,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-20 11:53:15,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-20 11:53:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-02-20 11:53:15,735 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.38562091503267976 [2024-02-20 11:53:15,736 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2024-02-20 11:53:15,736 INFO L507 AbstractCegarLoop]: Abstraction has has 52 places, 56 transitions, 326 flow [2024-02-20 11:53:15,737 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 8 states have internal predecessors, (111), 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:53:15,737 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:15,737 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:15,752 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:53:15,948 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:15,949 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:15,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2041144765, now seen corresponding path program 2 times [2024-02-20 11:53:15,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:15,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631603393] [2024-02-20 11:53:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:53:16,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631603393] [2024-02-20 11:53:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631603393] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:16,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230940570] [2024-02-20 11:53:16,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:53:16,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:16,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:16,168 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:53:16,196 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:53:16,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-02-20 11:53:16,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:16,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 11:53:16,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:53:17,847 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:17,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230940570] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:17,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:17,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-02-20 11:53:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891129673] [2024-02-20 11:53:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:17,851 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:53:17,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:17,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:53:17,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:53:17,852 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:17,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 56 transitions, 326 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:17,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:17,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:17,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:18,574 INFO L124 PetriNetUnfolderBase]: 1599/2317 cut-off events. [2024-02-20 11:53:18,574 INFO L125 PetriNetUnfolderBase]: For 335/475 co-relation queries the response was YES. [2024-02-20 11:53:18,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 2317 events. 1599/2317 cut-off events. For 335/475 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 11211 event pairs, 652 based on Foata normal form. 1/1740 useless extension candidates. Maximal degree in co-relation 7216. Up to 2280 conditions per place. [2024-02-20 11:53:18,588 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 87 selfloop transitions, 2 changer transitions 10/106 dead transitions. [2024-02-20 11:53:18,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 106 transitions, 860 flow [2024-02-20 11:53:18,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-02-20 11:53:18,590 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2024-02-20 11:53:18,591 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 11 predicate places. [2024-02-20 11:53:18,591 INFO L507 AbstractCegarLoop]: Abstraction has has 56 places, 106 transitions, 860 flow [2024-02-20 11:53:18,591 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:18,591 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:18,591 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:18,605 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:53:18,803 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,SelfDestructingSolverStorable2 [2024-02-20 11:53:18,803 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:18,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1395773807, now seen corresponding path program 3 times [2024-02-20 11:53:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268385485] [2024-02-20 11:53:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:18,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:18,928 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:53:18,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268385485] [2024-02-20 11:53:18,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268385485] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:18,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468610311] [2024-02-20 11:53:18,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:53:18,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:18,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:18,930 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:53:18,948 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:53:19,097 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-02-20 11:53:19,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:19,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-20 11:53:19,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-02-20 11:53:20,426 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-02-20 11:53:20,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468610311] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:20,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-02-20 11:53:20,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-02-20 11:53:20,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73552295] [2024-02-20 11:53:20,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:20,428 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:53:20,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:53:20,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-02-20 11:53:20,430 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:20,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 106 transitions, 860 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:20,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:20,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:20,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:21,388 INFO L124 PetriNetUnfolderBase]: 2171/3232 cut-off events. [2024-02-20 11:53:21,389 INFO L125 PetriNetUnfolderBase]: For 582/744 co-relation queries the response was YES. [2024-02-20 11:53:21,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16296 conditions, 3232 events. 2171/3232 cut-off events. For 582/744 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16875 event pairs, 652 based on Foata normal form. 1/2515 useless extension candidates. Maximal degree in co-relation 12461. Up to 3197 conditions per place. [2024-02-20 11:53:21,411 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 148 selfloop transitions, 4 changer transitions 20/179 dead transitions. [2024-02-20 11:53:21,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 179 transitions, 1839 flow [2024-02-20 11:53:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-02-20 11:53:21,415 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5254901960784314 [2024-02-20 11:53:21,416 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2024-02-20 11:53:21,416 INFO L507 AbstractCegarLoop]: Abstraction has has 60 places, 179 transitions, 1839 flow [2024-02-20 11:53:21,416 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:21,416 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:21,417 INFO L234 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:21,431 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:53:21,629 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:21,630 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:21,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:21,630 INFO L85 PathProgramCache]: Analyzing trace with hash -5258503, now seen corresponding path program 4 times [2024-02-20 11:53:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:21,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520910608] [2024-02-20 11:53:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:21,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:53:21,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520910608] [2024-02-20 11:53:21,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520910608] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:53:21,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991881360] [2024-02-20 11:53:21,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:53:21,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:21,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:21,799 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:53:21,804 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:53:22,053 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:53:22,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:53:22,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-20 11:53:22,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:53:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:53:22,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:53:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-02-20 11:53:22,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991881360] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:53:22,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:53:22,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-02-20 11:53:22,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773783084] [2024-02-20 11:53:22,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:53:22,131 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-02-20 11:53:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:22,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-02-20 11:53:22,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-02-20 11:53:22,137 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:22,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 179 transitions, 1839 flow. Second operand has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:22,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:22,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:22,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:22,699 INFO L124 PetriNetUnfolderBase]: 2171/3235 cut-off events. [2024-02-20 11:53:22,699 INFO L125 PetriNetUnfolderBase]: For 748/932 co-relation queries the response was YES. [2024-02-20 11:53:22,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19514 conditions, 3235 events. 2171/3235 cut-off events. For 748/932 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 16917 event pairs, 652 based on Foata normal form. 0/2520 useless extension candidates. Maximal degree in co-relation 14924. Up to 3200 conditions per place. [2024-02-20 11:53:22,721 INFO L140 encePairwiseOnDemand]: 44/51 looper letters, 137 selfloop transitions, 18 changer transitions 20/182 dead transitions. [2024-02-20 11:53:22,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 182 transitions, 2219 flow [2024-02-20 11:53:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 11:53:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 11:53:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2024-02-20 11:53:22,723 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.35014005602240894 [2024-02-20 11:53:22,723 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-02-20 11:53:22,724 INFO L507 AbstractCegarLoop]: Abstraction has has 66 places, 182 transitions, 2219 flow [2024-02-20 11:53:22,724 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.76923076923077) internal successors, (166), 13 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:22,724 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:22,724 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:22,738 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:53:22,940 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:53:22,940 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:22,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:22,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1387698869, now seen corresponding path program 5 times [2024-02-20 11:53:22,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:22,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479237445] [2024-02-20 11:53:22,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:24,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:24,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479237445] [2024-02-20 11:53:24,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479237445] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:24,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:24,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:53:24,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959588521] [2024-02-20 11:53:24,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:24,250 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:53:24,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:24,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:53:24,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:53:24,251 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:24,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 182 transitions, 2219 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:24,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:24,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:24,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:25,423 INFO L124 PetriNetUnfolderBase]: 4013/6111 cut-off events. [2024-02-20 11:53:25,423 INFO L125 PetriNetUnfolderBase]: For 3798/4088 co-relation queries the response was YES. [2024-02-20 11:53:25,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41976 conditions, 6111 events. 4013/6111 cut-off events. For 3798/4088 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 36024 event pairs, 472 based on Foata normal form. 1/4845 useless extension candidates. Maximal degree in co-relation 39496. Up to 5907 conditions per place. [2024-02-20 11:53:25,469 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 264 selfloop transitions, 35 changer transitions 22/328 dead transitions. [2024-02-20 11:53:25,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 328 transitions, 4694 flow [2024-02-20 11:53:25,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-02-20 11:53:25,514 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-20 11:53:25,514 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 25 predicate places. [2024-02-20 11:53:25,514 INFO L507 AbstractCegarLoop]: Abstraction has has 70 places, 328 transitions, 4694 flow [2024-02-20 11:53:25,514 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:25,514 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:25,515 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:25,515 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-20 11:53:25,515 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:25,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -363103421, now seen corresponding path program 6 times [2024-02-20 11:53:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236486082] [2024-02-20 11:53:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:26,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:26,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236486082] [2024-02-20 11:53:26,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236486082] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:26,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:26,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:53:26,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007193863] [2024-02-20 11:53:26,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:26,411 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:53:26,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:26,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:53:26,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:53:26,412 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:26,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 328 transitions, 4694 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:26,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:26,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:26,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:27,794 INFO L124 PetriNetUnfolderBase]: 4865/7465 cut-off events. [2024-02-20 11:53:27,794 INFO L125 PetriNetUnfolderBase]: For 7312/7516 co-relation queries the response was YES. [2024-02-20 11:53:27,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58078 conditions, 7465 events. 4865/7465 cut-off events. For 7312/7516 co-relation queries the response was YES. Maximal size of possible extension queue 420. Compared 45913 event pairs, 472 based on Foata normal form. 1/5962 useless extension candidates. Maximal degree in co-relation 54839. Up to 7156 conditions per place. [2024-02-20 11:53:27,852 INFO L140 encePairwiseOnDemand]: 41/51 looper letters, 327 selfloop transitions, 35 changer transitions 25/394 dead transitions. [2024-02-20 11:53:27,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 394 transitions, 6425 flow [2024-02-20 11:53:27,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 155 transitions. [2024-02-20 11:53:27,853 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6078431372549019 [2024-02-20 11:53:27,854 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2024-02-20 11:53:27,854 INFO L507 AbstractCegarLoop]: Abstraction has has 74 places, 394 transitions, 6425 flow [2024-02-20 11:53:27,854 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:27,854 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:27,854 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:27,855 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:53:27,855 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:27,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:27,855 INFO L85 PathProgramCache]: Analyzing trace with hash 594425969, now seen corresponding path program 7 times [2024-02-20 11:53:27,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:27,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614653095] [2024-02-20 11:53:27,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:28,584 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:28,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:28,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614653095] [2024-02-20 11:53:28,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614653095] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:28,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:28,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:53:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126605017] [2024-02-20 11:53:28,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:28,589 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:53:28,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:28,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:53:28,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:53:28,590 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:28,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 394 transitions, 6425 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:28,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:28,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:28,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:30,403 INFO L124 PetriNetUnfolderBase]: 6625/10051 cut-off events. [2024-02-20 11:53:30,403 INFO L125 PetriNetUnfolderBase]: For 13750/14100 co-relation queries the response was YES. [2024-02-20 11:53:30,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87544 conditions, 10051 events. 6625/10051 cut-off events. For 13750/14100 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 63664 event pairs, 536 based on Foata normal form. 1/7974 useless extension candidates. Maximal degree in co-relation 83536. Up to 9605 conditions per place. [2024-02-20 11:53:30,479 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 426 selfloop transitions, 44 changer transitions 35/512 dead transitions. [2024-02-20 11:53:30,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 512 transitions, 9368 flow [2024-02-20 11:53:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-02-20 11:53:30,481 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.596078431372549 [2024-02-20 11:53:30,483 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2024-02-20 11:53:30,483 INFO L507 AbstractCegarLoop]: Abstraction has has 78 places, 512 transitions, 9368 flow [2024-02-20 11:53:30,483 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:30,483 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:30,483 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:30,483 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:53:30,484 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:30,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash 700704319, now seen corresponding path program 8 times [2024-02-20 11:53:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:30,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413304739] [2024-02-20 11:53:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:31,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:31,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413304739] [2024-02-20 11:53:31,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413304739] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:31,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:31,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:53:31,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254896997] [2024-02-20 11:53:31,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:31,300 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:53:31,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:53:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:53:31,302 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:31,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 512 transitions, 9368 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:31,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:31,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:31,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:33,741 INFO L124 PetriNetUnfolderBase]: 7593/11497 cut-off events. [2024-02-20 11:53:33,741 INFO L125 PetriNetUnfolderBase]: For 22056/22440 co-relation queries the response was YES. [2024-02-20 11:53:33,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110513 conditions, 11497 events. 7593/11497 cut-off events. For 22056/22440 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 73960 event pairs, 504 based on Foata normal form. 1/9101 useless extension candidates. Maximal degree in co-relation 105881. Up to 10924 conditions per place. [2024-02-20 11:53:33,835 INFO L140 encePairwiseOnDemand]: 40/51 looper letters, 461 selfloop transitions, 100 changer transitions 38/606 dead transitions. [2024-02-20 11:53:33,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 606 transitions, 12285 flow [2024-02-20 11:53:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-02-20 11:53:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-02-20 11:53:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2024-02-20 11:53:33,837 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6050420168067226 [2024-02-20 11:53:33,838 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 39 predicate places. [2024-02-20 11:53:33,838 INFO L507 AbstractCegarLoop]: Abstraction has has 84 places, 606 transitions, 12285 flow [2024-02-20 11:53:33,838 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:53:33,838 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:33,838 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:33,838 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:53:33,839 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:33,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash -213756234, now seen corresponding path program 1 times [2024-02-20 11:53:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:33,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091110652] [2024-02-20 11:53:33,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:33,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:33,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091110652] [2024-02-20 11:53:33,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091110652] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:33,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:53:33,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304828074] [2024-02-20 11:53:33,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:33,935 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:53:33,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:33,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:53:33,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:53:33,936 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:33,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 606 transitions, 12285 flow. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:33,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:33,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:33,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:36,466 INFO L124 PetriNetUnfolderBase]: 8935/13479 cut-off events. [2024-02-20 11:53:36,467 INFO L125 PetriNetUnfolderBase]: For 32313/32673 co-relation queries the response was YES. [2024-02-20 11:53:36,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142130 conditions, 13479 events. 8935/13479 cut-off events. For 32313/32673 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 88667 event pairs, 328 based on Foata normal form. 262/10786 useless extension candidates. Maximal degree in co-relation 136956. Up to 12790 conditions per place. [2024-02-20 11:53:36,580 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 636 selfloop transitions, 19 changer transitions 47/709 dead transitions. [2024-02-20 11:53:36,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 709 transitions, 15761 flow [2024-02-20 11:53:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:53:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:53:36,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2024-02-20 11:53:36,583 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5686274509803921 [2024-02-20 11:53:36,583 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2024-02-20 11:53:36,584 INFO L507 AbstractCegarLoop]: Abstraction has has 86 places, 709 transitions, 15761 flow [2024-02-20 11:53:36,584 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:36,584 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:36,584 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:36,584 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-20 11:53:36,584 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:36,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1291901524, now seen corresponding path program 1 times [2024-02-20 11:53:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839872810] [2024-02-20 11:53:36,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:36,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:36,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:36,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839872810] [2024-02-20 11:53:36,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839872810] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:36,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:36,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:36,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462753173] [2024-02-20 11:53:36,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:36,676 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:36,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:36,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:36,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:36,677 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:36,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 709 transitions, 15761 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:36,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:36,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:36,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:40,168 INFO L124 PetriNetUnfolderBase]: 9461/14380 cut-off events. [2024-02-20 11:53:40,168 INFO L125 PetriNetUnfolderBase]: For 44842/44902 co-relation queries the response was YES. [2024-02-20 11:53:40,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164533 conditions, 14380 events. 9461/14380 cut-off events. For 44842/44902 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 96628 event pairs, 146 based on Foata normal form. 3/11307 useless extension candidates. Maximal degree in co-relation 158372. Up to 13577 conditions per place. [2024-02-20 11:53:40,278 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 607 selfloop transitions, 14 changer transitions 192/820 dead transitions. [2024-02-20 11:53:40,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 820 transitions, 19874 flow [2024-02-20 11:53:40,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:53:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:53:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-02-20 11:53:40,280 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-20 11:53:40,280 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-02-20 11:53:40,281 INFO L507 AbstractCegarLoop]: Abstraction has has 89 places, 820 transitions, 19874 flow [2024-02-20 11:53:40,281 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:40,281 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:40,281 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:40,281 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-20 11:53:40,282 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:40,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1012376422, now seen corresponding path program 1 times [2024-02-20 11:53:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748084408] [2024-02-20 11:53:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:40,404 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:40,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:40,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748084408] [2024-02-20 11:53:40,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748084408] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:40,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:40,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:40,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395879132] [2024-02-20 11:53:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:40,406 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:40,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:40,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:40,407 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:40,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 820 transitions, 19874 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:40,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:40,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:40,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:44,478 INFO L124 PetriNetUnfolderBase]: 10653/16342 cut-off events. [2024-02-20 11:53:44,478 INFO L125 PetriNetUnfolderBase]: For 65134/65134 co-relation queries the response was YES. [2024-02-20 11:53:44,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201660 conditions, 16342 events. 10653/16342 cut-off events. For 65134/65134 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 113339 event pairs, 100 based on Foata normal form. 4/12957 useless extension candidates. Maximal degree in co-relation 193862. Up to 15366 conditions per place. [2024-02-20 11:53:44,603 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 646 selfloop transitions, 19 changer transitions 430/1102 dead transitions. [2024-02-20 11:53:44,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 1102 transitions, 28970 flow [2024-02-20 11:53:44,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:53:44,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:53:44,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2024-02-20 11:53:44,605 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5784313725490197 [2024-02-20 11:53:44,605 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 47 predicate places. [2024-02-20 11:53:44,605 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 1102 transitions, 28970 flow [2024-02-20 11:53:44,605 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:44,605 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:44,606 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:44,606 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-20 11:53:44,606 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:44,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -8674990, now seen corresponding path program 2 times [2024-02-20 11:53:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630825737] [2024-02-20 11:53:44,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:44,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:44,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:44,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:44,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630825737] [2024-02-20 11:53:44,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630825737] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:44,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:44,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349806893] [2024-02-20 11:53:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:44,735 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:44,737 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:44,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 1102 transitions, 28970 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:44,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:44,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:44,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:49,152 INFO L124 PetriNetUnfolderBase]: 10653/16320 cut-off events. [2024-02-20 11:53:49,152 INFO L125 PetriNetUnfolderBase]: For 75648/75672 co-relation queries the response was YES. [2024-02-20 11:53:49,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216955 conditions, 16320 events. 10653/16320 cut-off events. For 75648/75672 co-relation queries the response was YES. Maximal size of possible extension queue 959. Compared 113133 event pairs, 100 based on Foata normal form. 4/12934 useless extension candidates. Maximal degree in co-relation 208635. Up to 15362 conditions per place. [2024-02-20 11:53:49,393 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 483 selfloop transitions, 2 changer transitions 606/1098 dead transitions. [2024-02-20 11:53:49,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1098 transitions, 31048 flow [2024-02-20 11:53:49,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:53:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:53:49,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2024-02-20 11:53:49,397 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-20 11:53:49,398 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2024-02-20 11:53:49,399 INFO L507 AbstractCegarLoop]: Abstraction has has 95 places, 1098 transitions, 31048 flow [2024-02-20 11:53:49,399 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:49,399 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:49,399 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:49,399 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-20 11:53:49,400 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:49,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:49,401 INFO L85 PathProgramCache]: Analyzing trace with hash 476299412, now seen corresponding path program 2 times [2024-02-20 11:53:49,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:49,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358481634] [2024-02-20 11:53:49,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:49,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-02-20 11:53:49,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:49,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358481634] [2024-02-20 11:53:49,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358481634] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:49,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:49,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:49,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270835198] [2024-02-20 11:53:49,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:49,525 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:49,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:49,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:49,526 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:49,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 1098 transitions, 31048 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:49,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:49,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:54,088 INFO L124 PetriNetUnfolderBase]: 10653/16316 cut-off events. [2024-02-20 11:53:54,088 INFO L125 PetriNetUnfolderBase]: For 87881/87881 co-relation queries the response was YES. [2024-02-20 11:53:54,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232288 conditions, 16316 events. 10653/16316 cut-off events. For 87881/87881 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 113000 event pairs, 100 based on Foata normal form. 2/12929 useless extension candidates. Maximal degree in co-relation 223420. Up to 15360 conditions per place. [2024-02-20 11:53:54,209 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 388 selfloop transitions, 0 changer transitions 701/1096 dead transitions. [2024-02-20 11:53:54,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 1096 transitions, 33170 flow [2024-02-20 11:53:54,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-20 11:53:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-20 11:53:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2024-02-20 11:53:54,210 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-20 11:53:54,211 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 53 predicate places. [2024-02-20 11:53:54,211 INFO L507 AbstractCegarLoop]: Abstraction has has 98 places, 1096 transitions, 33170 flow [2024-02-20 11:53:54,211 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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:53:54,211 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:54,211 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:54,211 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-20 11:53:54,212 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:53:54,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1553901126, now seen corresponding path program 1 times [2024-02-20 11:53:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75339742] [2024-02-20 11:53:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:54,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-02-20 11:53:54,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:54,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75339742] [2024-02-20 11:53:54,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75339742] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:54,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:54,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:53:54,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992499920] [2024-02-20 11:53:54,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:54,744 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:53:54,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:54,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:53:54,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:53:54,745 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:53:54,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 1096 transitions, 33170 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:53:54,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:54,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:53:54,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:59,885 INFO L124 PetriNetUnfolderBase]: 11307/17448 cut-off events. [2024-02-20 11:53:59,886 INFO L125 PetriNetUnfolderBase]: For 110477/110477 co-relation queries the response was YES. [2024-02-20 11:53:59,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264436 conditions, 17448 events. 11307/17448 cut-off events. For 110477/110477 co-relation queries the response was YES. Maximal size of possible extension queue 1043. Compared 122876 event pairs, 58 based on Foata normal form. 1/13900 useless extension candidates. Maximal degree in co-relation 254477. Up to 16401 conditions per place. [2024-02-20 11:54:00,021 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 473 selfloop transitions, 26 changer transitions 723/1229 dead transitions. [2024-02-20 11:54:00,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 1229 transitions, 39640 flow [2024-02-20 11:54:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:54:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:54:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 141 transitions. [2024-02-20 11:54:00,024 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2024-02-20 11:54:00,024 INFO L308 CegarLoopForPetriNet]: 45 programPoint places, 57 predicate places. [2024-02-20 11:54:00,024 INFO L507 AbstractCegarLoop]: Abstraction has has 102 places, 1229 transitions, 39640 flow [2024-02-20 11:54:00,024 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:54:00,024 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:54:00,024 INFO L234 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:54:00,025 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-20 11:54:00,025 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-02-20 11:54:00,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:54:00,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1433709024, now seen corresponding path program 2 times [2024-02-20 11:54:00,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:54:00,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792216806] [2024-02-20 11:54:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:54:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:54:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:54:00,515 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-02-20 11:54:00,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:54:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792216806] [2024-02-20 11:54:00,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792216806] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:54:00,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:54:00,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-20 11:54:00,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548617867] [2024-02-20 11:54:00,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:54:00,516 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-20 11:54:00,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:54:00,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-20 11:54:00,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-02-20 11:54:00,517 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 51 [2024-02-20 11:54:00,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 1229 transitions, 39640 flow. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 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:54:00,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:54:00,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 51 [2024-02-20 11:54:00,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand