/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:40:00,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:40:00,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:40:00,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:40:00,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:40:00,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:40:00,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:40:00,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:40:00,661 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:40:00,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:40:00,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:40:00,665 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:40:00,665 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:40:00,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:40:00,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:40:00,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:40:00,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:40:00,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:40:00,667 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:40:00,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:40:00,667 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:40:00,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:40:00,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:40:00,668 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:40:00,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:40:00,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:40:00,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:40:00,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:40:00,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:40:00,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:40:00,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:40:00,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:40:00,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:40:00,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:40:00,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:40:00,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:40:00,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:40:00,852 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:40:00,853 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:40:00,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-12-09 15:40:01,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:40:02,067 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:40:02,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2023-12-09 15:40:02,074 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab39b3a6/a08e8139805e42cb92d0ba132f56f112/FLAG51dcc6fe7 [2023-12-09 15:40:02,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab39b3a6/a08e8139805e42cb92d0ba132f56f112 [2023-12-09 15:40:02,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:40:02,094 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:40:02,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:40:02,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:40:02,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:40:02,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331d6672 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02, skipping insertion in model container [2023-12-09 15:40:02,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,127 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:40:02,247 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[3001,3014] [2023-12-09 15:40:02,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:40:02,259 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:40:02,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[3001,3014] [2023-12-09 15:40:02,278 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:40:02,288 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:40:02,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02 WrapperNode [2023-12-09 15:40:02,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:40:02,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:40:02,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:40:02,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:40:02,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,308 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,326 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 209 [2023-12-09 15:40:02,326 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:40:02,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:40:02,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:40:02,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:40:02,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,338 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,338 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:40:02,358 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:40:02,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:40:02,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:40:02,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (1/1) ... [2023-12-09 15:40:02,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:40:02,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:40:02,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:40:02,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:40:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:40:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:40:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:40:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:40:02,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:40:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:40:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:40:02,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:40:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:40:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:40:02,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:40:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:40:02,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:40:02,422 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:40:02,491 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:40:02,493 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:40:02,786 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:40:02,797 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:40:02,797 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:40:02,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:40:02 BoogieIcfgContainer [2023-12-09 15:40:02,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:40:02,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:40:02,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:40:02,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:40:02,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:40:02" (1/3) ... [2023-12-09 15:40:02,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1121114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:40:02, skipping insertion in model container [2023-12-09 15:40:02,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:40:02" (2/3) ... [2023-12-09 15:40:02,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1121114 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:40:02, skipping insertion in model container [2023-12-09 15:40:02,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:40:02" (3/3) ... [2023-12-09 15:40:02,804 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2023-12-09 15:40:02,815 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:40:02,815 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:40:02,815 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:40:02,884 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:40:02,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 254 places, 271 transitions, 556 flow [2023-12-09 15:40:03,018 INFO L124 PetriNetUnfolderBase]: 24/269 cut-off events. [2023-12-09 15:40:03,018 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:40:03,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 269 events. 24/269 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 516 event pairs, 0 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 173. Up to 2 conditions per place. [2023-12-09 15:40:03,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 254 places, 271 transitions, 556 flow [2023-12-09 15:40:03,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 260 transitions, 532 flow [2023-12-09 15:40:03,038 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:40:03,042 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@23bb62b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:40:03,042 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:40:03,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:40:03,084 INFO L124 PetriNetUnfolderBase]: 20/218 cut-off events. [2023-12-09 15:40:03,084 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:40:03,084 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:03,084 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:03,085 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:03,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash -685122436, now seen corresponding path program 1 times [2023-12-09 15:40:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:03,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327233003] [2023-12-09 15:40:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:03,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327233003] [2023-12-09 15:40:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327233003] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:03,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:40:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174718259] [2023-12-09 15:40:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:03,647 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:40:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:03,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:40:03,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:40:03,675 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2023-12-09 15:40:03,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 260 transitions, 532 flow. Second operand has 4 states, 4 states have (on average 219.25) internal successors, (877), 4 states have internal predecessors, (877), 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) [2023-12-09 15:40:03,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:03,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2023-12-09 15:40:03,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:03,924 INFO L124 PetriNetUnfolderBase]: 201/972 cut-off events. [2023-12-09 15:40:03,924 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-12-09 15:40:03,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 972 events. 201/972 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4905 event pairs, 84 based on Foata normal form. 74/877 useless extension candidates. Maximal degree in co-relation 1224. Up to 279 conditions per place. [2023-12-09 15:40:03,933 INFO L140 encePairwiseOnDemand]: 249/271 looper letters, 46 selfloop transitions, 4 changer transitions 4/256 dead transitions. [2023-12-09 15:40:03,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 256 transitions, 630 flow [2023-12-09 15:40:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:40:03,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:40:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 939 transitions. [2023-12-09 15:40:03,947 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8662361623616236 [2023-12-09 15:40:03,948 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 939 transitions. [2023-12-09 15:40:03,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 939 transitions. [2023-12-09 15:40:03,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:03,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 939 transitions. [2023-12-09 15:40:03,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 234.75) internal successors, (939), 4 states have internal predecessors, (939), 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) [2023-12-09 15:40:03,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-12-09 15:40:03,961 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 271.0) internal successors, (1355), 5 states have internal predecessors, (1355), 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) [2023-12-09 15:40:03,963 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 3 predicate places. [2023-12-09 15:40:03,964 INFO L500 AbstractCegarLoop]: Abstraction has has 246 places, 256 transitions, 630 flow [2023-12-09 15:40:03,964 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 219.25) internal successors, (877), 4 states have internal predecessors, (877), 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) [2023-12-09 15:40:03,965 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:03,965 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:03,965 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:40:03,967 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:03,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash 289958955, now seen corresponding path program 1 times [2023-12-09 15:40:03,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:03,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536479512] [2023-12-09 15:40:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:03,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:04,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536479512] [2023-12-09 15:40:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536479512] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:04,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:40:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125443495] [2023-12-09 15:40:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:04,475 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:40:04,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:04,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:40:04,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:40:04,478 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 271 [2023-12-09 15:40:04,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 256 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 217.66666666666666) internal successors, (1306), 6 states have internal predecessors, (1306), 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) [2023-12-09 15:40:04,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:04,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 271 [2023-12-09 15:40:04,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:04,763 INFO L124 PetriNetUnfolderBase]: 221/1048 cut-off events. [2023-12-09 15:40:04,763 INFO L125 PetriNetUnfolderBase]: For 246/322 co-relation queries the response was YES. [2023-12-09 15:40:04,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 1048 events. 221/1048 cut-off events. For 246/322 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5379 event pairs, 84 based on Foata normal form. 6/875 useless extension candidates. Maximal degree in co-relation 1699. Up to 311 conditions per place. [2023-12-09 15:40:04,768 INFO L140 encePairwiseOnDemand]: 263/271 looper letters, 57 selfloop transitions, 7 changer transitions 4/269 dead transitions. [2023-12-09 15:40:04,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 269 transitions, 817 flow [2023-12-09 15:40:04,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:40:04,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:40:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1570 transitions. [2023-12-09 15:40:04,772 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8276225619399051 [2023-12-09 15:40:04,772 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1570 transitions. [2023-12-09 15:40:04,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1570 transitions. [2023-12-09 15:40:04,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:04,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1570 transitions. [2023-12-09 15:40:04,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 224.28571428571428) internal successors, (1570), 7 states have internal predecessors, (1570), 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) [2023-12-09 15:40:04,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-12-09 15:40:04,779 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-12-09 15:40:04,779 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 9 predicate places. [2023-12-09 15:40:04,779 INFO L500 AbstractCegarLoop]: Abstraction has has 252 places, 269 transitions, 817 flow [2023-12-09 15:40:04,780 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.66666666666666) internal successors, (1306), 6 states have internal predecessors, (1306), 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) [2023-12-09 15:40:04,780 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:04,780 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:04,781 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:40:04,781 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:04,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:04,782 INFO L85 PathProgramCache]: Analyzing trace with hash -99093089, now seen corresponding path program 1 times [2023-12-09 15:40:04,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:04,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574415628] [2023-12-09 15:40:04,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:04,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:05,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:05,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:05,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574415628] [2023-12-09 15:40:05,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574415628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:05,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:05,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:40:05,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462940073] [2023-12-09 15:40:05,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:05,107 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:40:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:05,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:40:05,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:40:05,110 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 271 [2023-12-09 15:40:05,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 269 transitions, 817 flow. Second operand has 8 states, 8 states have (on average 216.375) internal successors, (1731), 8 states have internal predecessors, (1731), 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) [2023-12-09 15:40:05,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:05,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 271 [2023-12-09 15:40:05,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:05,434 INFO L124 PetriNetUnfolderBase]: 231/1060 cut-off events. [2023-12-09 15:40:05,437 INFO L125 PetriNetUnfolderBase]: For 452/552 co-relation queries the response was YES. [2023-12-09 15:40:05,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 1060 events. 231/1060 cut-off events. For 452/552 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5311 event pairs, 78 based on Foata normal form. 6/888 useless extension candidates. Maximal degree in co-relation 2126. Up to 325 conditions per place. [2023-12-09 15:40:05,443 INFO L140 encePairwiseOnDemand]: 259/271 looper letters, 65 selfloop transitions, 11 changer transitions 4/280 dead transitions. [2023-12-09 15:40:05,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 280 transitions, 1040 flow [2023-12-09 15:40:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:40:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:40:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2217 transitions. [2023-12-09 15:40:05,447 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8180811808118081 [2023-12-09 15:40:05,447 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2217 transitions. [2023-12-09 15:40:05,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2217 transitions. [2023-12-09 15:40:05,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:05,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2217 transitions. [2023-12-09 15:40:05,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 221.7) internal successors, (2217), 10 states have internal predecessors, (2217), 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) [2023-12-09 15:40:05,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 271.0) internal successors, (2981), 11 states have internal predecessors, (2981), 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) [2023-12-09 15:40:05,456 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 271.0) internal successors, (2981), 11 states have internal predecessors, (2981), 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) [2023-12-09 15:40:05,457 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 18 predicate places. [2023-12-09 15:40:05,457 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 280 transitions, 1040 flow [2023-12-09 15:40:05,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 216.375) internal successors, (1731), 8 states have internal predecessors, (1731), 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) [2023-12-09 15:40:05,459 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:05,459 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:05,459 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:40:05,459 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:05,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:05,460 INFO L85 PathProgramCache]: Analyzing trace with hash -436526887, now seen corresponding path program 1 times [2023-12-09 15:40:05,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:05,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437382663] [2023-12-09 15:40:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:05,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:05,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437382663] [2023-12-09 15:40:05,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437382663] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:05,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:05,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:40:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864090462] [2023-12-09 15:40:05,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:05,705 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:40:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:05,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:40:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:40:05,708 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:05,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 280 transitions, 1040 flow. Second operand has 6 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 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) [2023-12-09 15:40:05,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:05,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:05,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:05,985 INFO L124 PetriNetUnfolderBase]: 372/2018 cut-off events. [2023-12-09 15:40:05,985 INFO L125 PetriNetUnfolderBase]: For 1215/1299 co-relation queries the response was YES. [2023-12-09 15:40:05,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4445 conditions, 2018 events. 372/2018 cut-off events. For 1215/1299 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 14315 event pairs, 168 based on Foata normal form. 0/1792 useless extension candidates. Maximal degree in co-relation 4247. Up to 466 conditions per place. [2023-12-09 15:40:05,994 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 113 selfloop transitions, 9 changer transitions 4/327 dead transitions. [2023-12-09 15:40:05,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 327 transitions, 1591 flow [2023-12-09 15:40:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:40:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:40:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1588 transitions. [2023-12-09 15:40:05,997 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8371112282551397 [2023-12-09 15:40:05,997 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1588 transitions. [2023-12-09 15:40:05,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1588 transitions. [2023-12-09 15:40:05,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:05,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1588 transitions. [2023-12-09 15:40:06,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 226.85714285714286) internal successors, (1588), 7 states have internal predecessors, (1588), 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) [2023-12-09 15:40:06,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-12-09 15:40:06,003 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 271.0) internal successors, (2168), 8 states have internal predecessors, (2168), 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) [2023-12-09 15:40:06,004 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 24 predicate places. [2023-12-09 15:40:06,004 INFO L500 AbstractCegarLoop]: Abstraction has has 267 places, 327 transitions, 1591 flow [2023-12-09 15:40:06,007 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 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) [2023-12-09 15:40:06,007 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:06,007 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:06,007 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:40:06,007 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:06,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2114742039, now seen corresponding path program 2 times [2023-12-09 15:40:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:06,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606333089] [2023-12-09 15:40:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:06,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:06,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:06,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606333089] [2023-12-09 15:40:06,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606333089] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:06,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:06,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:40:06,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616427763] [2023-12-09 15:40:06,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:06,221 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:40:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:06,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:40:06,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:40:06,223 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:06,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 327 transitions, 1591 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:06,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:06,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:06,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:06,742 INFO L124 PetriNetUnfolderBase]: 617/3058 cut-off events. [2023-12-09 15:40:06,742 INFO L125 PetriNetUnfolderBase]: For 3599/4260 co-relation queries the response was YES. [2023-12-09 15:40:06,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8174 conditions, 3058 events. 617/3058 cut-off events. For 3599/4260 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 24443 event pairs, 140 based on Foata normal form. 2/2697 useless extension candidates. Maximal degree in co-relation 7873. Up to 761 conditions per place. [2023-12-09 15:40:06,758 INFO L140 encePairwiseOnDemand]: 263/271 looper letters, 238 selfloop transitions, 25 changer transitions 4/468 dead transitions. [2023-12-09 15:40:06,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 468 transitions, 3527 flow [2023-12-09 15:40:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:40:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:40:06,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2023-12-09 15:40:06,761 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8542435424354243 [2023-12-09 15:40:06,761 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1389 transitions. [2023-12-09 15:40:06,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1389 transitions. [2023-12-09 15:40:06,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:06,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1389 transitions. [2023-12-09 15:40:06,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 231.5) internal successors, (1389), 6 states have internal predecessors, (1389), 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) [2023-12-09 15:40:06,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-12-09 15:40:06,766 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-12-09 15:40:06,766 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 29 predicate places. [2023-12-09 15:40:06,766 INFO L500 AbstractCegarLoop]: Abstraction has has 272 places, 468 transitions, 3527 flow [2023-12-09 15:40:06,767 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:06,767 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:06,767 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:06,767 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:40:06,767 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:06,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1996055591, now seen corresponding path program 3 times [2023-12-09 15:40:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:06,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262151048] [2023-12-09 15:40:06,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:06,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:06,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:06,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262151048] [2023-12-09 15:40:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262151048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:06,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:06,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:40:06,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718190647] [2023-12-09 15:40:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:06,977 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:40:06,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:40:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:40:06,978 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:06,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 468 transitions, 3527 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:06,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:06,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:06,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:07,386 INFO L124 PetriNetUnfolderBase]: 664/3215 cut-off events. [2023-12-09 15:40:07,386 INFO L125 PetriNetUnfolderBase]: For 4799/5426 co-relation queries the response was YES. [2023-12-09 15:40:07,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9827 conditions, 3215 events. 664/3215 cut-off events. For 4799/5426 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25863 event pairs, 177 based on Foata normal form. 20/2859 useless extension candidates. Maximal degree in co-relation 9500. Up to 771 conditions per place. [2023-12-09 15:40:07,406 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 267 selfloop transitions, 22 changer transitions 4/494 dead transitions. [2023-12-09 15:40:07,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 494 transitions, 4402 flow [2023-12-09 15:40:07,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:40:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:40:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1161 transitions. [2023-12-09 15:40:07,454 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8568265682656827 [2023-12-09 15:40:07,454 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1161 transitions. [2023-12-09 15:40:07,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1161 transitions. [2023-12-09 15:40:07,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:07,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1161 transitions. [2023-12-09 15:40:07,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 232.2) internal successors, (1161), 5 states have internal predecessors, (1161), 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) [2023-12-09 15:40:07,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:07,458 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:07,459 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 33 predicate places. [2023-12-09 15:40:07,459 INFO L500 AbstractCegarLoop]: Abstraction has has 276 places, 494 transitions, 4402 flow [2023-12-09 15:40:07,459 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:07,459 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:07,459 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:07,460 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:40:07,460 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:07,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1534693297, now seen corresponding path program 4 times [2023-12-09 15:40:07,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:07,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226309238] [2023-12-09 15:40:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:07,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226309238] [2023-12-09 15:40:07,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226309238] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:07,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:07,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:40:07,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294478890] [2023-12-09 15:40:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:07,633 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:40:07,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:07,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:40:07,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:40:07,635 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:07,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 494 transitions, 4402 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:07,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:07,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:07,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:08,076 INFO L124 PetriNetUnfolderBase]: 658/3265 cut-off events. [2023-12-09 15:40:08,076 INFO L125 PetriNetUnfolderBase]: For 6227/6797 co-relation queries the response was YES. [2023-12-09 15:40:08,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10995 conditions, 3265 events. 658/3265 cut-off events. For 6227/6797 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 26437 event pairs, 189 based on Foata normal form. 28/2916 useless extension candidates. Maximal degree in co-relation 9608. Up to 769 conditions per place. [2023-12-09 15:40:08,092 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 263 selfloop transitions, 19 changer transitions 4/487 dead transitions. [2023-12-09 15:40:08,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 487 transitions, 4862 flow [2023-12-09 15:40:08,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:40:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:40:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1157 transitions. [2023-12-09 15:40:08,094 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8538745387453874 [2023-12-09 15:40:08,094 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1157 transitions. [2023-12-09 15:40:08,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1157 transitions. [2023-12-09 15:40:08,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:08,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1157 transitions. [2023-12-09 15:40:08,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 231.4) internal successors, (1157), 5 states have internal predecessors, (1157), 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) [2023-12-09 15:40:08,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:08,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:08,099 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 37 predicate places. [2023-12-09 15:40:08,099 INFO L500 AbstractCegarLoop]: Abstraction has has 280 places, 487 transitions, 4862 flow [2023-12-09 15:40:08,099 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:08,099 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:08,099 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:08,099 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:40:08,100 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:08,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1459470247, now seen corresponding path program 5 times [2023-12-09 15:40:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:08,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680209551] [2023-12-09 15:40:08,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:08,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:08,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:08,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680209551] [2023-12-09 15:40:08,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680209551] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:08,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:08,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:40:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880532077] [2023-12-09 15:40:08,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:08,251 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:40:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:40:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:40:08,253 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:08,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 487 transitions, 4862 flow. Second operand has 6 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 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) [2023-12-09 15:40:08,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:08,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:08,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:08,662 INFO L124 PetriNetUnfolderBase]: 693/3478 cut-off events. [2023-12-09 15:40:08,663 INFO L125 PetriNetUnfolderBase]: For 8605/9264 co-relation queries the response was YES. [2023-12-09 15:40:08,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12864 conditions, 3478 events. 693/3478 cut-off events. For 8605/9264 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 28751 event pairs, 171 based on Foata normal form. 26/3112 useless extension candidates. Maximal degree in co-relation 10432. Up to 812 conditions per place. [2023-12-09 15:40:08,679 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 280 selfloop transitions, 20 changer transitions 4/505 dead transitions. [2023-12-09 15:40:08,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 505 transitions, 5738 flow [2023-12-09 15:40:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:40:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:40:08,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1383 transitions. [2023-12-09 15:40:08,682 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8505535055350554 [2023-12-09 15:40:08,682 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1383 transitions. [2023-12-09 15:40:08,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1383 transitions. [2023-12-09 15:40:08,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:08,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1383 transitions. [2023-12-09 15:40:08,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 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) [2023-12-09 15:40:08,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-12-09 15:40:08,687 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-12-09 15:40:08,687 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 42 predicate places. [2023-12-09 15:40:08,687 INFO L500 AbstractCegarLoop]: Abstraction has has 285 places, 505 transitions, 5738 flow [2023-12-09 15:40:08,688 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 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) [2023-12-09 15:40:08,688 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:08,688 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:08,688 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:40:08,688 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:08,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash -879813859, now seen corresponding path program 6 times [2023-12-09 15:40:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:08,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921922399] [2023-12-09 15:40:08,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:08,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:08,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921922399] [2023-12-09 15:40:08,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921922399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:08,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:08,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:40:08,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716580627] [2023-12-09 15:40:08,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:08,816 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:40:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:08,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:40:08,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:40:08,817 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:08,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 505 transitions, 5738 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:08,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:08,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:08,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:09,234 INFO L124 PetriNetUnfolderBase]: 691/3376 cut-off events. [2023-12-09 15:40:09,235 INFO L125 PetriNetUnfolderBase]: For 11600/12849 co-relation queries the response was YES. [2023-12-09 15:40:09,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14002 conditions, 3376 events. 691/3376 cut-off events. For 11600/12849 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 27426 event pairs, 184 based on Foata normal form. 22/3012 useless extension candidates. Maximal degree in co-relation 13597. Up to 1061 conditions per place. [2023-12-09 15:40:09,252 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 277 selfloop transitions, 22 changer transitions 4/504 dead transitions. [2023-12-09 15:40:09,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 504 transitions, 6318 flow [2023-12-09 15:40:09,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:40:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:40:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1137 transitions. [2023-12-09 15:40:09,254 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8391143911439114 [2023-12-09 15:40:09,257 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1137 transitions. [2023-12-09 15:40:09,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1137 transitions. [2023-12-09 15:40:09,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:09,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1137 transitions. [2023-12-09 15:40:09,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 227.4) internal successors, (1137), 5 states have internal predecessors, (1137), 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) [2023-12-09 15:40:09,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:09,270 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:09,271 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 46 predicate places. [2023-12-09 15:40:09,271 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 504 transitions, 6318 flow [2023-12-09 15:40:09,271 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:09,271 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:09,271 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:09,271 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:40:09,271 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:09,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 406669437, now seen corresponding path program 7 times [2023-12-09 15:40:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250496783] [2023-12-09 15:40:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250496783] [2023-12-09 15:40:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250496783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:09,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:09,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:40:09,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886931257] [2023-12-09 15:40:09,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:09,460 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:40:09,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:09,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:40:09,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:40:09,461 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:09,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 504 transitions, 6318 flow. Second operand has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:09,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:09,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:09,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:09,947 INFO L124 PetriNetUnfolderBase]: 685/3430 cut-off events. [2023-12-09 15:40:09,947 INFO L125 PetriNetUnfolderBase]: For 13724/14757 co-relation queries the response was YES. [2023-12-09 15:40:09,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15189 conditions, 3430 events. 685/3430 cut-off events. For 13724/14757 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 28116 event pairs, 192 based on Foata normal form. 17/3063 useless extension candidates. Maximal degree in co-relation 12436. Up to 1059 conditions per place. [2023-12-09 15:40:09,971 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 273 selfloop transitions, 19 changer transitions 4/497 dead transitions. [2023-12-09 15:40:09,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 497 transitions, 6756 flow [2023-12-09 15:40:09,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:40:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:40:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1137 transitions. [2023-12-09 15:40:09,973 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8391143911439114 [2023-12-09 15:40:09,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1137 transitions. [2023-12-09 15:40:09,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1137 transitions. [2023-12-09 15:40:09,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:09,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1137 transitions. [2023-12-09 15:40:09,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 227.4) internal successors, (1137), 5 states have internal predecessors, (1137), 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) [2023-12-09 15:40:09,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:09,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 271.0) internal successors, (1626), 6 states have internal predecessors, (1626), 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) [2023-12-09 15:40:09,978 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 50 predicate places. [2023-12-09 15:40:09,978 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 497 transitions, 6756 flow [2023-12-09 15:40:09,978 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 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) [2023-12-09 15:40:09,978 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:09,979 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:09,979 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:40:09,979 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:09,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:09,979 INFO L85 PathProgramCache]: Analyzing trace with hash -777660335, now seen corresponding path program 8 times [2023-12-09 15:40:09,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:09,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644697601] [2023-12-09 15:40:09,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:09,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:10,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:10,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:10,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644697601] [2023-12-09 15:40:10,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644697601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:10,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:10,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:40:10,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828660928] [2023-12-09 15:40:10,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:10,142 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:40:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:40:10,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:40:10,144 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 271 [2023-12-09 15:40:10,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 497 transitions, 6756 flow. Second operand has 6 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 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) [2023-12-09 15:40:10,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:10,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 271 [2023-12-09 15:40:10,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:10,676 INFO L124 PetriNetUnfolderBase]: 659/3312 cut-off events. [2023-12-09 15:40:10,677 INFO L125 PetriNetUnfolderBase]: For 15568/16409 co-relation queries the response was YES. [2023-12-09 15:40:10,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15778 conditions, 3312 events. 659/3312 cut-off events. For 15568/16409 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 26953 event pairs, 192 based on Foata normal form. 15/2964 useless extension candidates. Maximal degree in co-relation 13173. Up to 1012 conditions per place. [2023-12-09 15:40:10,697 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 249 selfloop transitions, 20 changer transitions 4/474 dead transitions. [2023-12-09 15:40:10,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 474 transitions, 6767 flow [2023-12-09 15:40:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:40:10,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:40:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1363 transitions. [2023-12-09 15:40:10,700 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8382533825338253 [2023-12-09 15:40:10,701 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1363 transitions. [2023-12-09 15:40:10,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1363 transitions. [2023-12-09 15:40:10,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:10,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1363 transitions. [2023-12-09 15:40:10,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.16666666666666) internal successors, (1363), 6 states have internal predecessors, (1363), 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) [2023-12-09 15:40:10,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-12-09 15:40:10,705 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 271.0) internal successors, (1897), 7 states have internal predecessors, (1897), 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) [2023-12-09 15:40:10,705 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 55 predicate places. [2023-12-09 15:40:10,705 INFO L500 AbstractCegarLoop]: Abstraction has has 298 places, 474 transitions, 6767 flow [2023-12-09 15:40:10,706 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.33333333333334) internal successors, (1298), 6 states have internal predecessors, (1298), 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) [2023-12-09 15:40:10,706 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:10,706 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:10,706 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 15:40:10,706 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:10,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:10,707 INFO L85 PathProgramCache]: Analyzing trace with hash 471924353, now seen corresponding path program 1 times [2023-12-09 15:40:10,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:10,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351103901] [2023-12-09 15:40:10,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:10,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351103901] [2023-12-09 15:40:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351103901] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:40:10,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700391367] [2023-12-09 15:40:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:40:10,973 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) [2023-12-09 15:40:10,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:40:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:11,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:40:11,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:40:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:40:11,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:40:11,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700391367] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:11,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:40:11,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-12-09 15:40:11,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934669499] [2023-12-09 15:40:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:11,316 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:40:11,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:11,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:40:11,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:40:11,317 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 271 [2023-12-09 15:40:11,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 474 transitions, 6767 flow. Second operand has 8 states, 8 states have (on average 171.625) internal successors, (1373), 8 states have internal predecessors, (1373), 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) [2023-12-09 15:40:11,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:11,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 271 [2023-12-09 15:40:11,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:12,109 INFO L124 PetriNetUnfolderBase]: 1240/4750 cut-off events. [2023-12-09 15:40:12,109 INFO L125 PetriNetUnfolderBase]: For 42480/45445 co-relation queries the response was YES. [2023-12-09 15:40:12,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24633 conditions, 4750 events. 1240/4750 cut-off events. For 42480/45445 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 40062 event pairs, 520 based on Foata normal form. 10/4265 useless extension candidates. Maximal degree in co-relation 16653. Up to 1662 conditions per place. [2023-12-09 15:40:12,135 INFO L140 encePairwiseOnDemand]: 246/271 looper letters, 93 selfloop transitions, 17 changer transitions 52/527 dead transitions. [2023-12-09 15:40:12,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 527 transitions, 8014 flow [2023-12-09 15:40:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:40:12,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:40:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2118 transitions. [2023-12-09 15:40:12,139 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6512915129151291 [2023-12-09 15:40:12,139 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2118 transitions. [2023-12-09 15:40:12,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2118 transitions. [2023-12-09 15:40:12,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:12,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2118 transitions. [2023-12-09 15:40:12,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 176.5) internal successors, (2118), 12 states have internal predecessors, (2118), 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) [2023-12-09 15:40:12,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 271.0) internal successors, (3523), 13 states have internal predecessors, (3523), 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) [2023-12-09 15:40:12,146 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 271.0) internal successors, (3523), 13 states have internal predecessors, (3523), 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) [2023-12-09 15:40:12,147 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 66 predicate places. [2023-12-09 15:40:12,147 INFO L500 AbstractCegarLoop]: Abstraction has has 309 places, 527 transitions, 8014 flow [2023-12-09 15:40:12,147 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 171.625) internal successors, (1373), 8 states have internal predecessors, (1373), 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) [2023-12-09 15:40:12,147 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:12,148 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:12,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:40:12,353 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-09 15:40:12,353 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:12,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2122624870, now seen corresponding path program 1 times [2023-12-09 15:40:12,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:12,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011350374] [2023-12-09 15:40:12,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:12,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:40:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011350374] [2023-12-09 15:40:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011350374] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:40:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368855931] [2023-12-09 15:40:12,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:12,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:12,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:40:12,578 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) [2023-12-09 15:40:12,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:40:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:12,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-09 15:40:12,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:40:13,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:40:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:13,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:40:14,025 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:40:14,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-12-09 15:40:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368855931] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:40:14,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:40:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 23, 18] total 40 [2023-12-09 15:40:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119815081] [2023-12-09 15:40:14,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:40:14,718 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-09 15:40:14,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:14,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-09 15:40:14,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1411, Unknown=0, NotChecked=0, Total=1560 [2023-12-09 15:40:14,721 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 271 [2023-12-09 15:40:14,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 527 transitions, 8014 flow. Second operand has 40 states, 40 states have (on average 71.4) internal successors, (2856), 40 states have internal predecessors, (2856), 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) [2023-12-09 15:40:14,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:14,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 271 [2023-12-09 15:40:14,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:38,040 INFO L124 PetriNetUnfolderBase]: 37594/76206 cut-off events. [2023-12-09 15:40:38,041 INFO L125 PetriNetUnfolderBase]: For 563782/564714 co-relation queries the response was YES. [2023-12-09 15:40:38,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346948 conditions, 76206 events. 37594/76206 cut-off events. For 563782/564714 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 778851 event pairs, 2206 based on Foata normal form. 92/70055 useless extension candidates. Maximal degree in co-relation 243552. Up to 15034 conditions per place. [2023-12-09 15:40:38,847 INFO L140 encePairwiseOnDemand]: 162/271 looper letters, 3602 selfloop transitions, 864 changer transitions 917/5440 dead transitions. [2023-12-09 15:40:38,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 5440 transitions, 76502 flow [2023-12-09 15:40:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2023-12-09 15:40:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2023-12-09 15:40:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 16399 transitions. [2023-12-09 15:40:38,869 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3056207834805621 [2023-12-09 15:40:38,869 INFO L72 ComplementDD]: Start complementDD. Operand 198 states and 16399 transitions. [2023-12-09 15:40:38,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 16399 transitions. [2023-12-09 15:40:38,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:38,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 198 states and 16399 transitions. [2023-12-09 15:40:38,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 199 states, 198 states have (on average 82.82323232323232) internal successors, (16399), 198 states have internal predecessors, (16399), 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) [2023-12-09 15:40:38,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 199 states, 199 states have (on average 271.0) internal successors, (53929), 199 states have internal predecessors, (53929), 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) [2023-12-09 15:40:38,967 INFO L81 ComplementDD]: Finished complementDD. Result has 199 states, 199 states have (on average 271.0) internal successors, (53929), 199 states have internal predecessors, (53929), 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) [2023-12-09 15:40:38,968 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 263 predicate places. [2023-12-09 15:40:38,968 INFO L500 AbstractCegarLoop]: Abstraction has has 506 places, 5440 transitions, 76502 flow [2023-12-09 15:40:38,969 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 71.4) internal successors, (2856), 40 states have internal predecessors, (2856), 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) [2023-12-09 15:40:38,969 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:38,969 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:40:38,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:40:39,173 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-09 15:40:39,174 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:39,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1850855168, now seen corresponding path program 2 times [2023-12-09 15:40:39,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:39,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553873678] [2023-12-09 15:40:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:39,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:40:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:39,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553873678] [2023-12-09 15:40:39,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553873678] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:40:39,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091714115] [2023-12-09 15:40:39,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:40:39,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:39,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:40:39,461 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) [2023-12-09 15:40:39,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:40:39,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:40:39,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:40:39,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-09 15:40:39,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:40:39,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:40:40,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:40:40,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:40:40,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:40:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:40,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:40:43,010 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_180 (Array Int Int)) (~x2~0 Int) (v_ArrVal_181 (Array Int Int))) (or (< c_~size~0 (+ ~x2~0 1)) (< ~x2~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_181) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset)))))) is different from false [2023-12-09 15:40:45,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:40:45,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2023-12-09 15:40:45,547 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:40:45,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 169 [2023-12-09 15:40:45,554 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 15:40:45,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-12-09 15:40:45,560 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-09 15:40:45,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 20 [2023-12-09 15:40:45,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:40:45,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091714115] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:40:45,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:40:45,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 27, 24] total 50 [2023-12-09 15:40:45,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878103493] [2023-12-09 15:40:45,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:40:45,915 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-09 15:40:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:45,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-09 15:40:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2109, Unknown=19, NotChecked=94, Total=2450 [2023-12-09 15:40:45,919 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 271 [2023-12-09 15:40:45,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 5440 transitions, 76502 flow. Second operand has 50 states, 50 states have (on average 63.08) internal successors, (3154), 50 states have internal predecessors, (3154), 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) [2023-12-09 15:40:45,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:45,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 271 [2023-12-09 15:40:45,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:42:07,453 INFO L124 PetriNetUnfolderBase]: 60428/122956 cut-off events. [2023-12-09 15:42:07,453 INFO L125 PetriNetUnfolderBase]: For 884663/888429 co-relation queries the response was YES. [2023-12-09 15:42:07,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640192 conditions, 122956 events. 60428/122956 cut-off events. For 884663/888429 co-relation queries the response was YES. Maximal size of possible extension queue 2162. Compared 1341702 event pairs, 3302 based on Foata normal form. 578/114650 useless extension candidates. Maximal degree in co-relation 472065. Up to 34533 conditions per place. [2023-12-09 15:42:08,532 INFO L140 encePairwiseOnDemand]: 159/271 looper letters, 7988 selfloop transitions, 1783 changer transitions 2205/12030 dead transitions. [2023-12-09 15:42:08,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 12030 transitions, 174874 flow [2023-12-09 15:42:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 316 states. [2023-12-09 15:42:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2023-12-09 15:42:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 21604 transitions. [2023-12-09 15:42:08,560 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.25227707973282265 [2023-12-09 15:42:08,561 INFO L72 ComplementDD]: Start complementDD. Operand 316 states and 21604 transitions. [2023-12-09 15:42:08,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 316 states and 21604 transitions. [2023-12-09 15:42:08,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:42:08,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 316 states and 21604 transitions. [2023-12-09 15:42:08,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 317 states, 316 states have (on average 68.36708860759494) internal successors, (21604), 316 states have internal predecessors, (21604), 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) [2023-12-09 15:42:08,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 317 states, 317 states have (on average 271.0) internal successors, (85907), 317 states have internal predecessors, (85907), 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) [2023-12-09 15:42:08,706 INFO L81 ComplementDD]: Finished complementDD. Result has 317 states, 317 states have (on average 271.0) internal successors, (85907), 317 states have internal predecessors, (85907), 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) [2023-12-09 15:42:08,707 INFO L308 CegarLoopForPetriNet]: 243 programPoint places, 578 predicate places. [2023-12-09 15:42:08,707 INFO L500 AbstractCegarLoop]: Abstraction has has 821 places, 12030 transitions, 174874 flow [2023-12-09 15:42:08,708 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 63.08) internal successors, (3154), 50 states have internal predecessors, (3154), 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) [2023-12-09 15:42:08,708 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:42:08,708 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:42:08,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-09 15:42:08,913 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:42:08,914 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:42:08,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:42:08,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1540883838, now seen corresponding path program 3 times [2023-12-09 15:42:08,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:42:08,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342512657] [2023-12-09 15:42:08,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:42:08,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:42:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:42:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:42:09,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:42:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342512657] [2023-12-09 15:42:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342512657] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:42:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939908325] [2023-12-09 15:42:09,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:42:09,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:42:09,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:42:09,480 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) [2023-12-09 15:42:09,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:42:09,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:42:09,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:42:09,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-09 15:42:09,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:42:10,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:42:10,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:42:10,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:42:10,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:42:10,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:42:10,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:42:10,746 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:42:12,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:42:12,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2023-12-09 15:42:12,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:42:12,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 162 [2023-12-09 15:42:12,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2023-12-09 15:42:12,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:42:12,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2023-12-09 15:42:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:42:12,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939908325] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:42:12,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:42:12,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27, 27] total 55 [2023-12-09 15:42:12,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317563066] [2023-12-09 15:42:12,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:42:12,809 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-12-09 15:42:12,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:42:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-12-09 15:42:12,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2774, Unknown=13, NotChecked=0, Total=2970 [2023-12-09 15:42:12,813 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 271 [2023-12-09 15:42:12,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 12030 transitions, 174874 flow. Second operand has 55 states, 55 states have (on average 62.61818181818182) internal successors, (3444), 55 states have internal predecessors, (3444), 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) [2023-12-09 15:42:12,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:42:12,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 271 [2023-12-09 15:42:12,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:43:55,389 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:43:55,390 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:43:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 313 states. [2023-12-09 15:43:55,636 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:43:55,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:43:55,840 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-09 15:43:55,840 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 57/271 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 471551 conditions, 77882 events (38304/77881 cut-off events. For 612677/620651 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 889801 event pairs, 1029 based on Foata normal form. 1036/75892 useless extension candidates. Maximal degree in co-relation 292186. Up to 23132 conditions per place.). [2023-12-09 15:43:55,842 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:43:55,842 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:43:55,842 INFO L457 BasicCegarLoop]: Path program histogram: [8, 3, 1, 1, 1, 1] [2023-12-09 15:43:55,844 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:43:55,844 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:43:55,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:43:55 BasicIcfg [2023-12-09 15:43:55,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:43:55,848 INFO L158 Benchmark]: Toolchain (without parser) took 233753.50ms. Allocated memory was 271.6MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 233.1MB in the beginning and 1.1GB in the end (delta: -837.4MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-12-09 15:43:55,848 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:43:55,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.94ms. Allocated memory is still 271.6MB. Free memory was 232.7MB in the beginning and 220.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:43:55,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.35ms. Allocated memory is still 271.6MB. Free memory was 220.5MB in the beginning and 218.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:43:55,848 INFO L158 Benchmark]: Boogie Preprocessor took 30.31ms. Allocated memory is still 271.6MB. Free memory was 218.0MB in the beginning and 216.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:43:55,848 INFO L158 Benchmark]: RCFGBuilder took 440.84ms. Allocated memory is still 271.6MB. Free memory was 216.3MB in the beginning and 194.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-09 15:43:55,849 INFO L158 Benchmark]: TraceAbstraction took 233047.16ms. Allocated memory was 271.6MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 193.9MB in the beginning and 1.1GB in the end (delta: -876.6MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. [2023-12-09 15:43:55,849 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.94ms. Allocated memory is still 271.6MB. Free memory was 232.7MB in the beginning and 220.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.35ms. Allocated memory is still 271.6MB. Free memory was 220.5MB in the beginning and 218.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.31ms. Allocated memory is still 271.6MB. Free memory was 218.0MB in the beginning and 216.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 440.84ms. Allocated memory is still 271.6MB. Free memory was 216.3MB in the beginning and 194.3MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 233047.16ms. Allocated memory was 271.6MB in the beginning and 3.5GB in the end (delta: 3.2GB). Free memory was 193.9MB in the beginning and 1.1GB in the end (delta: -876.6MB). Peak memory consumption was 2.4GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 57/271 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 471551 conditions, 77882 events (38304/77881 cut-off events. For 612677/620651 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 889801 event pairs, 1029 based on Foata normal form. 1036/75892 useless extension candidates. Maximal degree in co-relation 292186. Up to 23132 conditions per place.). - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 57/271 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 471551 conditions, 77882 events (38304/77881 cut-off events. For 612677/620651 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 889801 event pairs, 1029 based on Foata normal form. 1036/75892 useless extension candidates. Maximal degree in co-relation 292186. Up to 23132 conditions per place.). - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (55states, 57/271 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 471551 conditions, 77882 events (38304/77881 cut-off events. For 612677/620651 co-relation queries the response was YES. Maximal size of possible extension queue 2571. Compared 889801 event pairs, 1029 based on Foata normal form. 1036/75892 useless extension candidates. Maximal degree in co-relation 292186. Up to 23132 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 396 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 232.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 215.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 29 mSolverCounterUnknown, 20809 SdHoareTripleChecker+Valid, 19.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20809 mSDsluCounter, 46488 SdHoareTripleChecker+Invalid, 16.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3474 IncrementalHoareTripleChecker+Unchecked, 44233 mSDsCounter, 1065 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35683 IncrementalHoareTripleChecker+Invalid, 40251 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1065 mSolverCounterUnsat, 2255 mSDtfsCounter, 35683 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2256 GetRequests, 1248 SyntacticMatches, 2 SemanticMatches, 1006 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121984 ImplicationChecksByTransitivity, 39.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174874occurred in iteration=14, InterpolantAutomatonStates: 592, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 2569 NumberOfCodeBlocks, 2569 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3003 ConstructedInterpolants, 180 QuantifiedInterpolants, 19964 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1222 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 22 InterpolantComputations, 12 PerfectInterpolantSequences, 4/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown