./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/clever.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/clever.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 f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:28:51,460 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:28:51,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:28:51,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:28:51,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:28:51,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:28:51,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:28:51,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:28:51,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:28:51,568 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:28:51,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:28:51,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:28:51,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:28:51,570 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:28:51,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:28:51,571 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:28:51,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:28:51,572 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:28:51,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:28:51,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:28:51,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:28:51,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:28:51,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:28:51,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:28:51,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:28:51,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:28:51,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:28:51,575 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:28:51,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:28:51,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:28:51,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:28:51,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:28:51,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:28:51,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:28:51,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:28:51,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:28:51,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:28:51,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:28:51,577 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:28:51,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:28:51,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:28:51,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:28:51,577 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 -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2024-11-10 10:28:51,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:28:51,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:28:51,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:28:51,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:28:51,828 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:28:51,828 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/clever.wvr.c [2024-11-10 10:28:53,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:28:53,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:28:53,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2024-11-10 10:28:53,236 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d081317a5/f7137abf5dff440aaf5cbcfb1d60df0b/FLAG37c8f33f9 [2024-11-10 10:28:53,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d081317a5/f7137abf5dff440aaf5cbcfb1d60df0b [2024-11-10 10:28:53,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:28:53,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:28:53,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:28:53,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:28:53,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:28:53,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,269 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e17a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53, skipping insertion in model container [2024-11-10 10:28:53,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:28:53,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c[2159,2172] [2024-11-10 10:28:53,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:28:53,446 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:28:53,460 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c[2159,2172] [2024-11-10 10:28:53,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:28:53,475 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:28:53,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53 WrapperNode [2024-11-10 10:28:53,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:28:53,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:28:53,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:28:53,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:28:53,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,503 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 72 [2024-11-10 10:28:53,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:28:53,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:28:53,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:28:53,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:28:53,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,523 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 10:28:53,524 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,524 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,527 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:28:53,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:28:53,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:28:53,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:28:53,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (1/1) ... [2024-11-10 10:28:53,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:28:53,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:28:53,573 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-11-10 10:28:53,575 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-11-10 10:28:53,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:28:53,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 10:28:53,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 10:28:53,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 10:28:53,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 10:28:53,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:28:53,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:28:53,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:28:53,619 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 10:28:53,733 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:28:53,736 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:28:53,898 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:28:53,899 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:28:54,038 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:28:54,038 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:28:54,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:28:54 BoogieIcfgContainer [2024-11-10 10:28:54,039 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:28:54,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:28:54,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:28:54,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:28:54,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:28:53" (1/3) ... [2024-11-10 10:28:54,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558a2de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:28:54, skipping insertion in model container [2024-11-10 10:28:54,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:28:53" (2/3) ... [2024-11-10 10:28:54,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@558a2de7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:28:54, skipping insertion in model container [2024-11-10 10:28:54,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:28:54" (3/3) ... [2024-11-10 10:28:54,045 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-11-10 10:28:54,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:28:54,057 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 10:28:54,058 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:28:54,087 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 10:28:54,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 29 transitions, 72 flow [2024-11-10 10:28:54,141 INFO L124 PetriNetUnfolderBase]: 6/27 cut-off events. [2024-11-10 10:28:54,141 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:28:54,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 6/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-10 10:28:54,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 29 transitions, 72 flow [2024-11-10 10:28:54,147 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 64 flow [2024-11-10 10:28:54,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:28:54,158 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e31614f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:28:54,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-10 10:28:54,169 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:28:54,169 INFO L124 PetriNetUnfolderBase]: 6/25 cut-off events. [2024-11-10 10:28:54,169 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:28:54,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:54,170 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:54,170 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:28:54,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 83474084, now seen corresponding path program 1 times [2024-11-10 10:28:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426174601] [2024-11-10 10:28:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:54,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:54,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:54,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426174601] [2024-11-10 10:28:54,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426174601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:54,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:54,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:28:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235723066] [2024-11-10 10:28:54,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:54,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 10:28:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:54,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 10:28:54,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 10:28:54,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-11-10 10:28:54,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-11-10 10:28:54,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:54,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-11-10 10:28:54,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:54,450 INFO L124 PetriNetUnfolderBase]: 57/118 cut-off events. [2024-11-10 10:28:54,452 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 10:28:54,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 118 events. 57/118 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 409 event pairs, 23 based on Foata normal form. 33/130 useless extension candidates. Maximal degree in co-relation 193. Up to 91 conditions per place. [2024-11-10 10:28:54,455 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 14 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2024-11-10 10:28:54,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 86 flow [2024-11-10 10:28:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 10:28:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 10:28:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2024-11-10 10:28:54,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-11-10 10:28:54,465 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 64 flow. Second operand 2 states and 39 transitions. [2024-11-10 10:28:54,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 86 flow [2024-11-10 10:28:54,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 78 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 10:28:54,469 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 50 flow [2024-11-10 10:28:54,470 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2024-11-10 10:28:54,474 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2024-11-10 10:28:54,474 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 50 flow [2024-11-10 10:28:54,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 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-11-10 10:28:54,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:54,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:54,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:28:54,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:28:54,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1405387965, now seen corresponding path program 1 times [2024-11-10 10:28:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:54,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007530813] [2024-11-10 10:28:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:54,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:54,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007530813] [2024-11-10 10:28:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007530813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 10:28:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230002008] [2024-11-10 10:28:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:54,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 10:28:54,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:54,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 10:28:54,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 10:28:54,734 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-11-10 10:28:54,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-11-10 10:28:54,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:54,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-11-10 10:28:54,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:54,809 INFO L124 PetriNetUnfolderBase]: 106/220 cut-off events. [2024-11-10 10:28:54,809 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 10:28:54,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 220 events. 106/220 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 944 event pairs, 19 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 394. Up to 110 conditions per place. [2024-11-10 10:28:54,814 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 21 selfloop transitions, 3 changer transitions 1/34 dead transitions. [2024-11-10 10:28:54,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 34 transitions, 125 flow [2024-11-10 10:28:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 10:28:54,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 10:28:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-10 10:28:54,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6781609195402298 [2024-11-10 10:28:54,816 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 50 flow. Second operand 3 states and 59 transitions. [2024-11-10 10:28:54,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 34 transitions, 125 flow [2024-11-10 10:28:54,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 125 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:28:54,819 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 69 flow [2024-11-10 10:28:54,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2024-11-10 10:28:54,820 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2024-11-10 10:28:54,820 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 69 flow [2024-11-10 10:28:54,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-11-10 10:28:54,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:54,820 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:54,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:28:54,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:28:54,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:54,821 INFO L85 PathProgramCache]: Analyzing trace with hash -980199968, now seen corresponding path program 1 times [2024-11-10 10:28:54,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:54,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291595921] [2024-11-10 10:28:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:54,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:54,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:54,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291595921] [2024-11-10 10:28:54,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291595921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:54,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:54,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:28:54,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824643342] [2024-11-10 10:28:54,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:54,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:28:54,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:54,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:28:54,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:28:54,894 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:28:54,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:28:54,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:54,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:28:54,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:54,988 INFO L124 PetriNetUnfolderBase]: 215/419 cut-off events. [2024-11-10 10:28:54,988 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-10 10:28:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 419 events. 215/419 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1945 event pairs, 22 based on Foata normal form. 10/381 useless extension candidates. Maximal degree in co-relation 893. Up to 121 conditions per place. [2024-11-10 10:28:54,991 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 42 selfloop transitions, 7 changer transitions 2/58 dead transitions. [2024-11-10 10:28:54,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 58 transitions, 264 flow [2024-11-10 10:28:54,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 91 transitions. [2024-11-10 10:28:54,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6275862068965518 [2024-11-10 10:28:54,992 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 69 flow. Second operand 5 states and 91 transitions. [2024-11-10 10:28:54,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 58 transitions, 264 flow [2024-11-10 10:28:54,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 58 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:28:54,994 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 117 flow [2024-11-10 10:28:54,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2024-11-10 10:28:54,995 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2024-11-10 10:28:54,995 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 117 flow [2024-11-10 10:28:54,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:28:54,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:54,995 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:54,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:28:54,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:28:54,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1814716804, now seen corresponding path program 2 times [2024-11-10 10:28:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9100779] [2024-11-10 10:28:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:54,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:55,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9100779] [2024-11-10 10:28:55,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9100779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:28:55,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:28:55,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:28:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240906278] [2024-11-10 10:28:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:28:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:28:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:28:55,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:28:55,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:28:55,052 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:28:55,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:28:55,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:28:55,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:28:55,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:28:55,155 INFO L124 PetriNetUnfolderBase]: 236/468 cut-off events. [2024-11-10 10:28:55,155 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-11-10 10:28:55,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 468 events. 236/468 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2166 event pairs, 18 based on Foata normal form. 6/466 useless extension candidates. Maximal degree in co-relation 1192. Up to 180 conditions per place. [2024-11-10 10:28:55,160 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 36 selfloop transitions, 11 changer transitions 6/60 dead transitions. [2024-11-10 10:28:55,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 331 flow [2024-11-10 10:28:55,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:28:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:28:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-11-10 10:28:55,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6068965517241379 [2024-11-10 10:28:55,161 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 117 flow. Second operand 5 states and 88 transitions. [2024-11-10 10:28:55,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 331 flow [2024-11-10 10:28:55,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:28:55,163 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 182 flow [2024-11-10 10:28:55,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=182, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2024-11-10 10:28:55,164 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 13 predicate places. [2024-11-10 10:28:55,165 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 182 flow [2024-11-10 10:28:55,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:28:55,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:28:55,167 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:28:55,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:28:55,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:28:55,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:28:55,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1050456300, now seen corresponding path program 1 times [2024-11-10 10:28:55,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:28:55,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69178132] [2024-11-10 10:28:55,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:55,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:28:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:55,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:28:55,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69178132] [2024-11-10 10:28:55,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69178132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:28:55,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89038411] [2024-11-10 10:28:55,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:28:55,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:28:55,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:28:55,500 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-11-10 10:28:55,502 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-11-10 10:28:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:28:55,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 10:28:55,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:28:55,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:28:55,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:29:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:00,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89038411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:29:00,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:29:00,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-10 10:29:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152734865] [2024-11-10 10:29:00,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:29:00,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:29:00,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:00,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:29:00,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=102, Unknown=1, NotChecked=0, Total=156 [2024-11-10 10:29:04,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 10:29:04,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:29:04,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 182 flow. Second operand has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 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-11-10 10:29:04,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:04,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:29:04,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:04,877 INFO L124 PetriNetUnfolderBase]: 1016/1949 cut-off events. [2024-11-10 10:29:04,877 INFO L125 PetriNetUnfolderBase]: For 2981/3008 co-relation queries the response was YES. [2024-11-10 10:29:04,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5727 conditions, 1949 events. 1016/1949 cut-off events. For 2981/3008 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 11746 event pairs, 52 based on Foata normal form. 29/1969 useless extension candidates. Maximal degree in co-relation 5715. Up to 398 conditions per place. [2024-11-10 10:29:04,890 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 169 selfloop transitions, 50 changer transitions 10/238 dead transitions. [2024-11-10 10:29:04,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 238 transitions, 1651 flow [2024-11-10 10:29:04,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 10:29:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-11-10 10:29:04,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 345 transitions. [2024-11-10 10:29:04,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6609195402298851 [2024-11-10 10:29:04,895 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 182 flow. Second operand 18 states and 345 transitions. [2024-11-10 10:29:04,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 238 transitions, 1651 flow [2024-11-10 10:29:04,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 238 transitions, 1629 flow, removed 11 selfloop flow, removed 0 redundant places. [2024-11-10 10:29:04,909 INFO L231 Difference]: Finished difference. Result has 67 places, 96 transitions, 743 flow [2024-11-10 10:29:04,911 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=743, PETRI_PLACES=67, PETRI_TRANSITIONS=96} [2024-11-10 10:29:04,911 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 40 predicate places. [2024-11-10 10:29:04,911 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 96 transitions, 743 flow [2024-11-10 10:29:04,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 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-11-10 10:29:04,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:04,912 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:04,928 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-11-10 10:29:05,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:05,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:05,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1237553466, now seen corresponding path program 1 times [2024-11-10 10:29:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:05,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712359730] [2024-11-10 10:29:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:05,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712359730] [2024-11-10 10:29:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712359730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:29:05,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:29:05,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:29:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832228408] [2024-11-10 10:29:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:29:05,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:29:05,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:05,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:29:05,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:29:05,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:29:05,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 96 transitions, 743 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:29:05,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:05,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:29:05,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:05,357 INFO L124 PetriNetUnfolderBase]: 1067/2145 cut-off events. [2024-11-10 10:29:05,358 INFO L125 PetriNetUnfolderBase]: For 6707/6783 co-relation queries the response was YES. [2024-11-10 10:29:05,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7341 conditions, 2145 events. 1067/2145 cut-off events. For 6707/6783 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13756 event pairs, 137 based on Foata normal form. 59/2192 useless extension candidates. Maximal degree in co-relation 7318. Up to 1264 conditions per place. [2024-11-10 10:29:05,371 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 106 selfloop transitions, 10 changer transitions 4/137 dead transitions. [2024-11-10 10:29:05,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 137 transitions, 1282 flow [2024-11-10 10:29:05,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:29:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:29:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2024-11-10 10:29:05,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.646551724137931 [2024-11-10 10:29:05,372 INFO L175 Difference]: Start difference. First operand has 67 places, 96 transitions, 743 flow. Second operand 4 states and 75 transitions. [2024-11-10 10:29:05,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 137 transitions, 1282 flow [2024-11-10 10:29:05,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 137 transitions, 1243 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-11-10 10:29:05,412 INFO L231 Difference]: Finished difference. Result has 70 places, 101 transitions, 793 flow [2024-11-10 10:29:05,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=793, PETRI_PLACES=70, PETRI_TRANSITIONS=101} [2024-11-10 10:29:05,413 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 43 predicate places. [2024-11-10 10:29:05,414 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 101 transitions, 793 flow [2024-11-10 10:29:05,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:29:05,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:05,414 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:05,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:29:05,414 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:05,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash -264963118, now seen corresponding path program 2 times [2024-11-10 10:29:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241300266] [2024-11-10 10:29:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:05,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241300266] [2024-11-10 10:29:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241300266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:29:05,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:29:05,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:29:05,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548622366] [2024-11-10 10:29:05,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:29:05,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:29:05,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:05,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:29:05,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:29:05,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:29:05,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 101 transitions, 793 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:29:05,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:05,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:29:05,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:05,631 INFO L124 PetriNetUnfolderBase]: 1025/1977 cut-off events. [2024-11-10 10:29:05,631 INFO L125 PetriNetUnfolderBase]: For 7043/7140 co-relation queries the response was YES. [2024-11-10 10:29:05,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7118 conditions, 1977 events. 1025/1977 cut-off events. For 7043/7140 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 12453 event pairs, 145 based on Foata normal form. 13/1919 useless extension candidates. Maximal degree in co-relation 7093. Up to 789 conditions per place. [2024-11-10 10:29:05,643 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 109 selfloop transitions, 22 changer transitions 5/153 dead transitions. [2024-11-10 10:29:05,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 153 transitions, 1459 flow [2024-11-10 10:29:05,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:29:05,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:29:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2024-11-10 10:29:05,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5793103448275863 [2024-11-10 10:29:05,644 INFO L175 Difference]: Start difference. First operand has 70 places, 101 transitions, 793 flow. Second operand 5 states and 84 transitions. [2024-11-10 10:29:05,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 153 transitions, 1459 flow [2024-11-10 10:29:05,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 153 transitions, 1433 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-10 10:29:05,658 INFO L231 Difference]: Finished difference. Result has 74 places, 117 transitions, 1028 flow [2024-11-10 10:29:05,659 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1028, PETRI_PLACES=74, PETRI_TRANSITIONS=117} [2024-11-10 10:29:05,660 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 47 predicate places. [2024-11-10 10:29:05,660 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 117 transitions, 1028 flow [2024-11-10 10:29:05,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 10:29:05,660 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:05,660 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:05,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:29:05,660 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:05,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1683433178, now seen corresponding path program 2 times [2024-11-10 10:29:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:05,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799857683] [2024-11-10 10:29:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:05,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799857683] [2024-11-10 10:29:05,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799857683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:29:05,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150301935] [2024-11-10 10:29:05,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:29:05,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:05,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:29:05,917 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-11-10 10:29:05,919 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-11-10 10:29:05,964 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:29:05,964 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:29:05,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 10:29:05,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:29:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:06,164 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:29:06,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150301935] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:29:06,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:29:06,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-10 10:29:06,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333263753] [2024-11-10 10:29:06,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:29:06,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:29:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:29:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:29:06,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2024-11-10 10:29:06,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 117 transitions, 1028 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-11-10 10:29:06,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:06,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2024-11-10 10:29:06,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:07,045 INFO L124 PetriNetUnfolderBase]: 2024/4216 cut-off events. [2024-11-10 10:29:07,045 INFO L125 PetriNetUnfolderBase]: For 16260/16335 co-relation queries the response was YES. [2024-11-10 10:29:07,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15427 conditions, 4216 events. 2024/4216 cut-off events. For 16260/16335 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 31572 event pairs, 195 based on Foata normal form. 27/4182 useless extension candidates. Maximal degree in co-relation 15400. Up to 938 conditions per place. [2024-11-10 10:29:07,071 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 184 selfloop transitions, 123 changer transitions 8/326 dead transitions. [2024-11-10 10:29:07,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 326 transitions, 3333 flow [2024-11-10 10:29:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:29:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:29:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 224 transitions. [2024-11-10 10:29:07,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6436781609195402 [2024-11-10 10:29:07,072 INFO L175 Difference]: Start difference. First operand has 74 places, 117 transitions, 1028 flow. Second operand 12 states and 224 transitions. [2024-11-10 10:29:07,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 326 transitions, 3333 flow [2024-11-10 10:29:07,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 326 transitions, 3226 flow, removed 37 selfloop flow, removed 1 redundant places. [2024-11-10 10:29:07,097 INFO L231 Difference]: Finished difference. Result has 91 places, 207 transitions, 2442 flow [2024-11-10 10:29:07,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=988, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2442, PETRI_PLACES=91, PETRI_TRANSITIONS=207} [2024-11-10 10:29:07,099 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 64 predicate places. [2024-11-10 10:29:07,099 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 207 transitions, 2442 flow [2024-11-10 10:29:07,099 INFO L472 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-11-10 10:29:07,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:07,100 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:07,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 10:29:07,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-10 10:29:07,304 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:07,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1947407607, now seen corresponding path program 1 times [2024-11-10 10:29:07,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717263048] [2024-11-10 10:29:07,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717263048] [2024-11-10 10:29:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717263048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:29:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754453352] [2024-11-10 10:29:07,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:29:07,560 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-11-10 10:29:07,561 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-11-10 10:29:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:07,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 10:29:07,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:29:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:07,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:29:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754453352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:29:08,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:29:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 12 [2024-11-10 10:29:08,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694656511] [2024-11-10 10:29:08,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:29:08,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 10:29:08,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:08,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 10:29:08,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-10 10:29:08,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2024-11-10 10:29:08,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 207 transitions, 2442 flow. Second operand has 13 states, 13 states have (on average 12.538461538461538) internal successors, (163), 13 states have internal predecessors, (163), 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-11-10 10:29:08,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:08,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2024-11-10 10:29:08,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:09,273 INFO L124 PetriNetUnfolderBase]: 3897/8031 cut-off events. [2024-11-10 10:29:09,274 INFO L125 PetriNetUnfolderBase]: For 46416/46589 co-relation queries the response was YES. [2024-11-10 10:29:09,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33252 conditions, 8031 events. 3897/8031 cut-off events. For 46416/46589 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 62519 event pairs, 494 based on Foata normal form. 39/8061 useless extension candidates. Maximal degree in co-relation 33218. Up to 3556 conditions per place. [2024-11-10 10:29:09,364 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 320 selfloop transitions, 193 changer transitions 6/530 dead transitions. [2024-11-10 10:29:09,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 530 transitions, 6894 flow [2024-11-10 10:29:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 10:29:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 10:29:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 264 transitions. [2024-11-10 10:29:09,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6502463054187192 [2024-11-10 10:29:09,367 INFO L175 Difference]: Start difference. First operand has 91 places, 207 transitions, 2442 flow. Second operand 14 states and 264 transitions. [2024-11-10 10:29:09,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 530 transitions, 6894 flow [2024-11-10 10:29:09,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 530 transitions, 6556 flow, removed 158 selfloop flow, removed 5 redundant places. [2024-11-10 10:29:09,441 INFO L231 Difference]: Finished difference. Result has 109 places, 389 transitions, 5411 flow [2024-11-10 10:29:09,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2294, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5411, PETRI_PLACES=109, PETRI_TRANSITIONS=389} [2024-11-10 10:29:09,443 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 82 predicate places. [2024-11-10 10:29:09,443 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 389 transitions, 5411 flow [2024-11-10 10:29:09,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.538461538461538) internal successors, (163), 13 states have internal predecessors, (163), 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-11-10 10:29:09,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:09,443 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:09,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 10:29:09,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:09,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:09,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:09,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1685499632, now seen corresponding path program 3 times [2024-11-10 10:29:09,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:09,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166762500] [2024-11-10 10:29:09,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:09,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:09,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166762500] [2024-11-10 10:29:09,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166762500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:29:09,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265172012] [2024-11-10 10:29:09,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 10:29:09,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:09,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:29:09,725 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-11-10 10:29:09,726 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-11-10 10:29:09,771 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-10 10:29:09,772 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:29:09,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 10:29:09,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:29:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:09,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:29:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265172012] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:29:09,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:29:09,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 10:29:09,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605244437] [2024-11-10 10:29:09,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:29:09,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 10:29:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:09,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 10:29:09,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-10 10:29:09,935 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:29:09,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 389 transitions, 5411 flow. Second operand has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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-11-10 10:29:09,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:09,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:29:09,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:13,364 INFO L124 PetriNetUnfolderBase]: 12006/23971 cut-off events. [2024-11-10 10:29:13,365 INFO L125 PetriNetUnfolderBase]: For 171883/172835 co-relation queries the response was YES. [2024-11-10 10:29:13,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103406 conditions, 23971 events. 12006/23971 cut-off events. For 171883/172835 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 220424 event pairs, 1468 based on Foata normal form. 836/24788 useless extension candidates. Maximal degree in co-relation 103363. Up to 4816 conditions per place. [2024-11-10 10:29:13,541 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 782 selfloop transitions, 581 changer transitions 0/1394 dead transitions. [2024-11-10 10:29:13,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 1394 transitions, 21300 flow [2024-11-10 10:29:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 10:29:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-10 10:29:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 331 transitions. [2024-11-10 10:29:13,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6007259528130672 [2024-11-10 10:29:13,543 INFO L175 Difference]: Start difference. First operand has 109 places, 389 transitions, 5411 flow. Second operand 19 states and 331 transitions. [2024-11-10 10:29:13,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 1394 transitions, 21300 flow [2024-11-10 10:29:13,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 1394 transitions, 21196 flow, removed 45 selfloop flow, removed 2 redundant places. [2024-11-10 10:29:13,912 INFO L231 Difference]: Finished difference. Result has 138 places, 965 transitions, 16643 flow [2024-11-10 10:29:13,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=5346, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=16643, PETRI_PLACES=138, PETRI_TRANSITIONS=965} [2024-11-10 10:29:13,913 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 111 predicate places. [2024-11-10 10:29:13,913 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 965 transitions, 16643 flow [2024-11-10 10:29:13,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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-11-10 10:29:13,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:13,913 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:13,927 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-11-10 10:29:14,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:14,114 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:14,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:14,114 INFO L85 PathProgramCache]: Analyzing trace with hash -510140774, now seen corresponding path program 2 times [2024-11-10 10:29:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:14,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282457157] [2024-11-10 10:29:14,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:14,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:14,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282457157] [2024-11-10 10:29:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282457157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:29:14,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528062491] [2024-11-10 10:29:14,170 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 10:29:14,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:14,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:29:14,172 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:29:14,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 10:29:14,214 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 10:29:14,215 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:29:14,215 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:29:14,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:29:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:14,297 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:29:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528062491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:29:14,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:29:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-11-10 10:29:14,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632484954] [2024-11-10 10:29:14,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:29:14,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 10:29:14,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:14,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 10:29:14,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-10 10:29:14,349 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:29:14,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 965 transitions, 16643 flow. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 10 states have internal predecessors, (120), 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-11-10 10:29:14,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:14,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:29:14,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:21,360 INFO L124 PetriNetUnfolderBase]: 16915/33067 cut-off events. [2024-11-10 10:29:21,360 INFO L125 PetriNetUnfolderBase]: For 487833/490400 co-relation queries the response was YES. [2024-11-10 10:29:21,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180320 conditions, 33067 events. 16915/33067 cut-off events. For 487833/490400 co-relation queries the response was YES. Maximal size of possible extension queue 1395. Compared 314829 event pairs, 945 based on Foata normal form. 1783/34590 useless extension candidates. Maximal degree in co-relation 180264. Up to 8413 conditions per place. [2024-11-10 10:29:21,704 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 1057 selfloop transitions, 509 changer transitions 16/1613 dead transitions. [2024-11-10 10:29:21,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 1613 transitions, 29889 flow [2024-11-10 10:29:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 10:29:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 10:29:21,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 200 transitions. [2024-11-10 10:29:21,705 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5747126436781609 [2024-11-10 10:29:21,705 INFO L175 Difference]: Start difference. First operand has 138 places, 965 transitions, 16643 flow. Second operand 12 states and 200 transitions. [2024-11-10 10:29:21,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 1613 transitions, 29889 flow [2024-11-10 10:29:23,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 1613 transitions, 28614 flow, removed 634 selfloop flow, removed 2 redundant places. [2024-11-10 10:29:23,883 INFO L231 Difference]: Finished difference. Result has 154 places, 1255 transitions, 23373 flow [2024-11-10 10:29:23,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=15889, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=23373, PETRI_PLACES=154, PETRI_TRANSITIONS=1255} [2024-11-10 10:29:23,884 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 127 predicate places. [2024-11-10 10:29:23,884 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 1255 transitions, 23373 flow [2024-11-10 10:29:23,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 10 states have internal predecessors, (120), 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-11-10 10:29:23,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:23,886 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:23,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 10:29:24,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 10:29:24,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:24,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1689147582, now seen corresponding path program 3 times [2024-11-10 10:29:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288438092] [2024-11-10 10:29:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:24,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:24,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 10:29:24,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288438092] [2024-11-10 10:29:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288438092] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:29:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934303397] [2024-11-10 10:29:24,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 10:29:24,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:24,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:29:24,147 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:29:24,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 10:29:24,188 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 10:29:24,189 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:29:24,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 10:29:24,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:29:24,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:29:24,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:29:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 10:29:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934303397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:29:24,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:29:24,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 8 [2024-11-10 10:29:24,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892935127] [2024-11-10 10:29:24,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:29:24,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 10:29:24,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:24,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 10:29:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-10 10:29:24,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-10 10:29:24,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1255 transitions, 23373 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-11-10 10:29:24,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:24,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-10 10:29:24,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:34,412 INFO L124 PetriNetUnfolderBase]: 20575/40352 cut-off events. [2024-11-10 10:29:34,412 INFO L125 PetriNetUnfolderBase]: For 743970/748281 co-relation queries the response was YES. [2024-11-10 10:29:34,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238088 conditions, 40352 events. 20575/40352 cut-off events. For 743970/748281 co-relation queries the response was YES. Maximal size of possible extension queue 1863. Compared 399847 event pairs, 1215 based on Foata normal form. 3266/43544 useless extension candidates. Maximal degree in co-relation 238025. Up to 12114 conditions per place. [2024-11-10 10:29:34,912 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 1328 selfloop transitions, 529 changer transitions 0/1888 dead transitions. [2024-11-10 10:29:34,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 1888 transitions, 36716 flow [2024-11-10 10:29:34,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 10:29:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-10 10:29:34,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 238 transitions. [2024-11-10 10:29:34,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5471264367816092 [2024-11-10 10:29:34,914 INFO L175 Difference]: Start difference. First operand has 154 places, 1255 transitions, 23373 flow. Second operand 15 states and 238 transitions. [2024-11-10 10:29:34,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 1888 transitions, 36716 flow [2024-11-10 10:29:40,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 1888 transitions, 35648 flow, removed 529 selfloop flow, removed 2 redundant places. [2024-11-10 10:29:40,540 INFO L231 Difference]: Finished difference. Result has 170 places, 1470 transitions, 28685 flow [2024-11-10 10:29:40,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=22710, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=838, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=28685, PETRI_PLACES=170, PETRI_TRANSITIONS=1470} [2024-11-10 10:29:40,542 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 143 predicate places. [2024-11-10 10:29:40,542 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 1470 transitions, 28685 flow [2024-11-10 10:29:40,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 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-11-10 10:29:40,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:29:40,542 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:29:40,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 10:29:40,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:40,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:29:40,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:29:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -161351580, now seen corresponding path program 4 times [2024-11-10 10:29:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:29:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816678793] [2024-11-10 10:29:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:29:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:29:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:29:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:41,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:29:41,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816678793] [2024-11-10 10:29:41,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816678793] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:29:41,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456784846] [2024-11-10 10:29:41,000 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 10:29:41,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:29:41,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:29:41,001 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:29:41,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 10:29:41,062 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 10:29:41,062 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:29:41,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 10:29:41,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:29:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:29:45,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:29:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 10:29:45,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456784846] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:29:45,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:29:45,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 16 [2024-11-10 10:29:45,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379407393] [2024-11-10 10:29:45,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:29:45,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 10:29:45,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:29:45,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 10:29:45,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-10 10:29:45,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2024-11-10 10:29:45,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 1470 transitions, 28685 flow. Second operand has 17 states, 17 states have (on average 12.529411764705882) internal successors, (213), 17 states have internal predecessors, (213), 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-11-10 10:29:45,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:29:45,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2024-11-10 10:29:45,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:29:50,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 10:30:04,546 INFO L124 PetriNetUnfolderBase]: 24546/50877 cut-off events. [2024-11-10 10:30:04,546 INFO L125 PetriNetUnfolderBase]: For 944014/946057 co-relation queries the response was YES. [2024-11-10 10:30:04,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302225 conditions, 50877 events. 24546/50877 cut-off events. For 944014/946057 co-relation queries the response was YES. Maximal size of possible extension queue 2479. Compared 552380 event pairs, 4504 based on Foata normal form. 1539/51891 useless extension candidates. Maximal degree in co-relation 302157. Up to 30202 conditions per place. [2024-11-10 10:30:05,110 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 1681 selfloop transitions, 601 changer transitions 10/2340 dead transitions. [2024-11-10 10:30:05,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 2340 transitions, 48844 flow [2024-11-10 10:30:05,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-10 10:30:05,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-10 10:30:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 433 transitions. [2024-11-10 10:30:05,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6786833855799373 [2024-11-10 10:30:05,112 INFO L175 Difference]: Start difference. First operand has 170 places, 1470 transitions, 28685 flow. Second operand 22 states and 433 transitions. [2024-11-10 10:30:05,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 2340 transitions, 48844 flow [2024-11-10 10:30:17,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 2340 transitions, 48689 flow, removed 37 selfloop flow, removed 3 redundant places. [2024-11-10 10:30:17,848 INFO L231 Difference]: Finished difference. Result has 203 places, 2012 transitions, 42791 flow [2024-11-10 10:30:17,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=28548, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=42791, PETRI_PLACES=203, PETRI_TRANSITIONS=2012} [2024-11-10 10:30:17,850 INFO L277 CegarLoopForPetriNet]: 27 programPoint places, 176 predicate places. [2024-11-10 10:30:17,850 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 2012 transitions, 42791 flow [2024-11-10 10:30:17,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.529411764705882) internal successors, (213), 17 states have internal predecessors, (213), 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-11-10 10:30:17,850 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:30:17,850 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:30:17,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 10:30:18,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:18,051 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-10 10:30:18,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:30:18,051 INFO L85 PathProgramCache]: Analyzing trace with hash -837560928, now seen corresponding path program 5 times [2024-11-10 10:30:18,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:30:18,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31568864] [2024-11-10 10:30:18,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:30:18,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:30:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:30:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:18,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:30:18,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31568864] [2024-11-10 10:30:18,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31568864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 10:30:18,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660864006] [2024-11-10 10:30:18,312 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 10:30:18,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 10:30:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:30:18,314 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 10:30:18,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 10:30:18,373 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-11-10 10:30:18,374 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 10:30:18,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 10:30:18,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 10:30:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 10:30:18,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 10:30:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 10:30:19,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660864006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 10:30:19,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 10:30:19,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 16 [2024-11-10 10:30:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362809137] [2024-11-10 10:30:19,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 10:30:19,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 10:30:19,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:30:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 10:30:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-10 10:30:19,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 29 [2024-11-10 10:30:19,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 2012 transitions, 42791 flow. Second operand has 17 states, 17 states have (on average 12.529411764705882) internal successors, (213), 17 states have internal predecessors, (213), 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-11-10 10:30:19,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:30:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 29 [2024-11-10 10:30:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand