/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-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:39:43,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:39:43,080 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:39:43,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:39:43,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:39:43,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:39:43,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:39:43,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:39:43,098 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:39:43,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:39:43,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:39:43,098 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:39:43,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:39:43,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:39:43,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:39:43,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:39:43,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:39:43,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:39:43,100 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:39:43,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:39:43,101 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:39:43,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:39:43,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:39:43,102 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:39:43,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:39:43,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:39:43,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:39:43,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:39:43,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:39:43,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:39:43,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:39:43,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:39:43,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:39:43,104 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:39:43,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:39:43,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:39:43,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:39:43,332 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:39:43,332 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:39:43,333 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2023-12-09 15:39:44,537 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:39:44,687 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:39:44,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-3.wvr.c [2023-12-09 15:39:44,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c2e7378/e9014de84e9e4e3c8ce0b95e1d4c5e85/FLAG0efdf57b9 [2023-12-09 15:39:44,702 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c2e7378/e9014de84e9e4e3c8ce0b95e1d4c5e85 [2023-12-09 15:39:44,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:39:44,704 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:39:44,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:39:44,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:39:44,708 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:39:44,709 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,709 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f47d763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44, skipping insertion in model container [2023-12-09 15:39:44,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,724 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:39:44,828 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-3.wvr.c[2667,2680] [2023-12-09 15:39:44,833 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:39:44,839 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:39:44,853 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-3.wvr.c[2667,2680] [2023-12-09 15:39:44,855 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:39:44,865 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:39:44,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44 WrapperNode [2023-12-09 15:39:44,865 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:39:44,866 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:39:44,866 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:39:44,866 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:39:44,870 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:39:44" (1/1) ... [2023-12-09 15:39:44,876 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:39:44" (1/1) ... [2023-12-09 15:39:44,891 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 167 [2023-12-09 15:39:44,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:39:44,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:39:44,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:39:44,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:39:44,898 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,910 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,912 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:39:44,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:39:44,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:39:44,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:39:44,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (1/1) ... [2023-12-09 15:39:44,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:39:44,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:39:44,935 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:39:44,940 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:39:44,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:39:44,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:39:44,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:39:44,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:39:44,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:39:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:39:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:39:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:39:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:39:44,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:39:44,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:39:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:39:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:39:44,960 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:39:45,031 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:39:45,033 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:39:45,248 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:39:45,257 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:39:45,257 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:39:45,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:39:45 BoogieIcfgContainer [2023-12-09 15:39:45,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:39:45,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:39:45,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:39:45,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:39:45,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:39:44" (1/3) ... [2023-12-09 15:39:45,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739a5de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:39:45, skipping insertion in model container [2023-12-09 15:39:45,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:39:44" (2/3) ... [2023-12-09 15:39:45,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739a5de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:39:45, skipping insertion in model container [2023-12-09 15:39:45,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:39:45" (3/3) ... [2023-12-09 15:39:45,264 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2023-12-09 15:39:45,276 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:39:45,276 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:39:45,276 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:39:45,339 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:39:45,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 211 transitions, 436 flow [2023-12-09 15:39:45,456 INFO L124 PetriNetUnfolderBase]: 18/209 cut-off events. [2023-12-09 15:39:45,456 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:39:45,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 209 events. 18/209 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 320 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2023-12-09 15:39:45,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 211 transitions, 436 flow [2023-12-09 15:39:45,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 189 places, 200 transitions, 412 flow [2023-12-09 15:39:45,483 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:39:45,488 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;@6a29aa16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:39:45,488 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:39:45,523 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:39:45,523 INFO L124 PetriNetUnfolderBase]: 16/185 cut-off events. [2023-12-09 15:39:45,523 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:39:45,523 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:45,524 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] [2023-12-09 15:39:45,524 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:39:45,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -687910757, now seen corresponding path program 1 times [2023-12-09 15:39:45,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:45,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682084213] [2023-12-09 15:39:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:46,157 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:39:46,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:46,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682084213] [2023-12-09 15:39:46,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682084213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:46,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:46,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:39:46,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183276824] [2023-12-09 15:39:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:46,166 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:39:46,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:46,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:39:46,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:39:46,194 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 211 [2023-12-09 15:39:46,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 200 transitions, 412 flow. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 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:39:46,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:46,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 211 [2023-12-09 15:39:46,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:46,345 INFO L124 PetriNetUnfolderBase]: 133/682 cut-off events. [2023-12-09 15:39:46,345 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-12-09 15:39:46,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 682 events. 133/682 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3103 event pairs, 48 based on Foata normal form. 50/618 useless extension candidates. Maximal degree in co-relation 814. Up to 171 conditions per place. [2023-12-09 15:39:46,353 INFO L140 encePairwiseOnDemand]: 193/211 looper letters, 34 selfloop transitions, 4 changer transitions 4/200 dead transitions. [2023-12-09 15:39:46,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 200 transitions, 494 flow [2023-12-09 15:39:46,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:39:46,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:39:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 747 transitions. [2023-12-09 15:39:46,368 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8850710900473934 [2023-12-09 15:39:46,368 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 747 transitions. [2023-12-09 15:39:46,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 747 transitions. [2023-12-09 15:39:46,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:46,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 747 transitions. [2023-12-09 15:39:46,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 186.75) internal successors, (747), 4 states have internal predecessors, (747), 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:39:46,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 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:39:46,382 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 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:39:46,385 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 3 predicate places. [2023-12-09 15:39:46,385 INFO L500 AbstractCegarLoop]: Abstraction has has 192 places, 200 transitions, 494 flow [2023-12-09 15:39:46,386 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 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:39:46,386 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:46,386 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] [2023-12-09 15:39:46,386 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:39:46,387 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:39:46,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 746363237, now seen corresponding path program 1 times [2023-12-09 15:39:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:46,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173575848] [2023-12-09 15:39:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:46,776 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:39:46,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:46,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173575848] [2023-12-09 15:39:46,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173575848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:46,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:46,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:39:46,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376748667] [2023-12-09 15:39:46,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:46,779 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:39:46,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:46,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:39:46,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:39:46,782 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:46,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 200 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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:39:46,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:46,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:46,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:47,070 INFO L124 PetriNetUnfolderBase]: 224/1222 cut-off events. [2023-12-09 15:39:47,070 INFO L125 PetriNetUnfolderBase]: For 221/249 co-relation queries the response was YES. [2023-12-09 15:39:47,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2018 conditions, 1222 events. 224/1222 cut-off events. For 221/249 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 7788 event pairs, 101 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1848. Up to 254 conditions per place. [2023-12-09 15:39:47,076 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 62 selfloop transitions, 9 changer transitions 4/230 dead transitions. [2023-12-09 15:39:47,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 230 transitions, 736 flow [2023-12-09 15:39:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:39:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:39:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1256 transitions. [2023-12-09 15:39:47,079 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8503723764387271 [2023-12-09 15:39:47,079 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1256 transitions. [2023-12-09 15:39:47,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1256 transitions. [2023-12-09 15:39:47,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:47,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1256 transitions. [2023-12-09 15:39:47,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 179.42857142857142) internal successors, (1256), 7 states have internal predecessors, (1256), 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:39:47,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:39:47,085 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 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:39:47,085 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 9 predicate places. [2023-12-09 15:39:47,085 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 230 transitions, 736 flow [2023-12-09 15:39:47,086 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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:39:47,086 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:47,086 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] [2023-12-09 15:39:47,087 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:39:47,087 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:39:47,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:47,087 INFO L85 PathProgramCache]: Analyzing trace with hash 264395109, now seen corresponding path program 2 times [2023-12-09 15:39:47,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:47,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912792107] [2023-12-09 15:39:47,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:47,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:47,248 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:39:47,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:47,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912792107] [2023-12-09 15:39:47,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912792107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:47,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:47,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:39:47,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815751860] [2023-12-09 15:39:47,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:47,250 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:39:47,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:39:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:39:47,252 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:47,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 230 transitions, 736 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:47,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:47,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:47,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:47,482 INFO L124 PetriNetUnfolderBase]: 379/1936 cut-off events. [2023-12-09 15:39:47,482 INFO L125 PetriNetUnfolderBase]: For 768/1006 co-relation queries the response was YES. [2023-12-09 15:39:47,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 1936 events. 379/1936 cut-off events. For 768/1006 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 14412 event pairs, 117 based on Foata normal form. 9/1712 useless extension candidates. Maximal degree in co-relation 3162. Up to 417 conditions per place. [2023-12-09 15:39:47,491 INFO L140 encePairwiseOnDemand]: 203/211 looper letters, 137 selfloop transitions, 18 changer transitions 4/314 dead transitions. [2023-12-09 15:39:47,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 314 transitions, 1561 flow [2023-12-09 15:39:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:39:47,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:39:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions. [2023-12-09 15:39:47,493 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8601895734597157 [2023-12-09 15:39:47,493 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions. [2023-12-09 15:39:47,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions. [2023-12-09 15:39:47,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:47,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions. [2023-12-09 15:39:47,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 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:39:47,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:39:47,498 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:39:47,498 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 14 predicate places. [2023-12-09 15:39:47,498 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 314 transitions, 1561 flow [2023-12-09 15:39:47,499 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:47,499 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:47,499 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] [2023-12-09 15:39:47,499 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:39:47,499 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:39:47,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1818015447, now seen corresponding path program 3 times [2023-12-09 15:39:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:47,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445673485] [2023-12-09 15:39:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:47,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:47,637 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:39:47,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:47,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445673485] [2023-12-09 15:39:47,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445673485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:47,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:47,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:39:47,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882514303] [2023-12-09 15:39:47,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:47,641 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:39:47,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:47,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:39:47,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:39:47,643 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:47,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 314 transitions, 1561 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:47,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:47,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:47,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:47,905 INFO L124 PetriNetUnfolderBase]: 409/2052 cut-off events. [2023-12-09 15:39:47,905 INFO L125 PetriNetUnfolderBase]: For 1515/2054 co-relation queries the response was YES. [2023-12-09 15:39:47,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5007 conditions, 2052 events. 409/2052 cut-off events. For 1515/2054 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 15364 event pairs, 97 based on Foata normal form. 29/1824 useless extension candidates. Maximal degree in co-relation 4722. Up to 427 conditions per place. [2023-12-09 15:39:47,916 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 157 selfloop transitions, 21 changer transitions 4/337 dead transitions. [2023-12-09 15:39:47,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 337 transitions, 2099 flow [2023-12-09 15:39:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:39:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:39:47,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 917 transitions. [2023-12-09 15:39:47,918 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8691943127962085 [2023-12-09 15:39:47,918 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 917 transitions. [2023-12-09 15:39:47,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 917 transitions. [2023-12-09 15:39:47,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:47,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 917 transitions. [2023-12-09 15:39:47,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.4) internal successors, (917), 5 states have internal predecessors, (917), 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:39:47,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:47,923 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:47,924 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 18 predicate places. [2023-12-09 15:39:47,924 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 337 transitions, 2099 flow [2023-12-09 15:39:47,924 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:47,924 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:47,925 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] [2023-12-09 15:39:47,925 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:39:47,925 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:39:47,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:47,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1721256099, now seen corresponding path program 4 times [2023-12-09 15:39:47,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:47,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968978874] [2023-12-09 15:39:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:47,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:48,174 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:39:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:48,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968978874] [2023-12-09 15:39:48,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968978874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:48,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:48,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:39:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798690948] [2023-12-09 15:39:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:48,176 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:39:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:48,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:39:48,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:39:48,177 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:48,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 337 transitions, 2099 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:48,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:48,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:48,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:48,413 INFO L124 PetriNetUnfolderBase]: 406/2021 cut-off events. [2023-12-09 15:39:48,413 INFO L125 PetriNetUnfolderBase]: For 2190/2788 co-relation queries the response was YES. [2023-12-09 15:39:48,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 2021 events. 406/2021 cut-off events. For 2190/2788 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15234 event pairs, 105 based on Foata normal form. 28/1803 useless extension candidates. Maximal degree in co-relation 4839. Up to 425 conditions per place. [2023-12-09 15:39:48,425 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 154 selfloop transitions, 19 changer transitions 4/332 dead transitions. [2023-12-09 15:39:48,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 332 transitions, 2392 flow [2023-12-09 15:39:48,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:39:48,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:39:48,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 913 transitions. [2023-12-09 15:39:48,427 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8654028436018958 [2023-12-09 15:39:48,427 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 913 transitions. [2023-12-09 15:39:48,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 913 transitions. [2023-12-09 15:39:48,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:48,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 913 transitions. [2023-12-09 15:39:48,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.6) internal successors, (913), 5 states have internal predecessors, (913), 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:39:48,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:48,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:48,432 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 22 predicate places. [2023-12-09 15:39:48,432 INFO L500 AbstractCegarLoop]: Abstraction has has 211 places, 332 transitions, 2392 flow [2023-12-09 15:39:48,433 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:48,433 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:48,433 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] [2023-12-09 15:39:48,433 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:39:48,433 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:39:48,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:48,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2056845759, now seen corresponding path program 5 times [2023-12-09 15:39:48,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:48,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568105728] [2023-12-09 15:39:48,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:48,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:48,702 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:39:48,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:48,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568105728] [2023-12-09 15:39:48,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568105728] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:48,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:48,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:39:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463726926] [2023-12-09 15:39:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:48,710 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:39:48,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:48,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:39:48,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:39:48,711 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:48,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 332 transitions, 2392 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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:39:48,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:48,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:48,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:49,017 INFO L124 PetriNetUnfolderBase]: 421/2114 cut-off events. [2023-12-09 15:39:49,017 INFO L125 PetriNetUnfolderBase]: For 3381/4437 co-relation queries the response was YES. [2023-12-09 15:39:49,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6664 conditions, 2114 events. 421/2114 cut-off events. For 3381/4437 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16172 event pairs, 117 based on Foata normal form. 35/1896 useless extension candidates. Maximal degree in co-relation 5380. Up to 442 conditions per place. [2023-12-09 15:39:49,028 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 160 selfloop transitions, 20 changer transitions 4/339 dead transitions. [2023-12-09 15:39:49,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 339 transitions, 2832 flow [2023-12-09 15:39:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:39:49,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:39:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions. [2023-12-09 15:39:49,030 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8601895734597157 [2023-12-09 15:39:49,031 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions. [2023-12-09 15:39:49,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions. [2023-12-09 15:39:49,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:49,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions. [2023-12-09 15:39:49,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 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:39:49,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:39:49,034 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:39:49,036 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 27 predicate places. [2023-12-09 15:39:49,036 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 339 transitions, 2832 flow [2023-12-09 15:39:49,038 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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:39:49,038 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:49,038 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] [2023-12-09 15:39:49,038 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:39:49,038 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:39:49,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash -721971559, now seen corresponding path program 6 times [2023-12-09 15:39:49,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:49,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809297515] [2023-12-09 15:39:49,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:49,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:49,151 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:39:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809297515] [2023-12-09 15:39:49,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809297515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:49,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:49,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:39:49,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800125286] [2023-12-09 15:39:49,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:49,152 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:39:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:49,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:39:49,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:39:49,153 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:49,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 339 transitions, 2832 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:49,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:49,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:49,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:49,423 INFO L124 PetriNetUnfolderBase]: 416/2102 cut-off events. [2023-12-09 15:39:49,423 INFO L125 PetriNetUnfolderBase]: For 4755/5765 co-relation queries the response was YES. [2023-12-09 15:39:49,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7412 conditions, 2102 events. 416/2102 cut-off events. For 4755/5765 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 15899 event pairs, 103 based on Foata normal form. 28/1872 useless extension candidates. Maximal degree in co-relation 6409. Up to 577 conditions per place. [2023-12-09 15:39:49,434 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 158 selfloop transitions, 21 changer transitions 4/338 dead transitions. [2023-12-09 15:39:49,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 338 transitions, 3176 flow [2023-12-09 15:39:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:39:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:39:49,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 905 transitions. [2023-12-09 15:39:49,436 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8578199052132701 [2023-12-09 15:39:49,436 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 905 transitions. [2023-12-09 15:39:49,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 905 transitions. [2023-12-09 15:39:49,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:49,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 905 transitions. [2023-12-09 15:39:49,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 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:39:49,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:49,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:49,440 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 31 predicate places. [2023-12-09 15:39:49,440 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 338 transitions, 3176 flow [2023-12-09 15:39:49,441 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:49,441 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:49,441 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] [2023-12-09 15:39:49,441 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:39:49,441 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:39:49,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:49,441 INFO L85 PathProgramCache]: Analyzing trace with hash -330375331, now seen corresponding path program 7 times [2023-12-09 15:39:49,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:49,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493750981] [2023-12-09 15:39:49,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:49,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:49,594 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:39:49,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:49,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493750981] [2023-12-09 15:39:49,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493750981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:49,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:49,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:39:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817192412] [2023-12-09 15:39:49,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:49,595 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:39:49,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:49,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:39:49,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:39:49,597 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:49,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 338 transitions, 3176 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:49,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:49,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:49,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:49,884 INFO L124 PetriNetUnfolderBase]: 411/2100 cut-off events. [2023-12-09 15:39:49,884 INFO L125 PetriNetUnfolderBase]: For 5853/6997 co-relation queries the response was YES. [2023-12-09 15:39:49,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8083 conditions, 2100 events. 411/2100 cut-off events. For 5853/6997 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 16059 event pairs, 103 based on Foata normal form. 21/1874 useless extension candidates. Maximal degree in co-relation 6601. Up to 575 conditions per place. [2023-12-09 15:39:49,899 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 155 selfloop transitions, 19 changer transitions 4/333 dead transitions. [2023-12-09 15:39:49,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 333 transitions, 3441 flow [2023-12-09 15:39:49,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-09 15:39:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-12-09 15:39:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 905 transitions. [2023-12-09 15:39:49,902 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8578199052132701 [2023-12-09 15:39:49,902 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 905 transitions. [2023-12-09 15:39:49,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 905 transitions. [2023-12-09 15:39:49,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:49,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 905 transitions. [2023-12-09 15:39:49,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 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:39:49,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:49,905 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 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:39:49,906 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 35 predicate places. [2023-12-09 15:39:49,906 INFO L500 AbstractCegarLoop]: Abstraction has has 224 places, 333 transitions, 3441 flow [2023-12-09 15:39:49,906 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 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:39:49,906 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:49,906 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] [2023-12-09 15:39:49,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:39:49,907 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:39:49,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:49,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2079347649, now seen corresponding path program 8 times [2023-12-09 15:39:49,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305681270] [2023-12-09 15:39:49,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:50,105 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:39:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:50,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305681270] [2023-12-09 15:39:50,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305681270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:50,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:39:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:39:50,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128532640] [2023-12-09 15:39:50,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:50,106 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:39:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:50,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:39:50,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:39:50,108 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 211 [2023-12-09 15:39:50,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 333 transitions, 3441 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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:39:50,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:50,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 211 [2023-12-09 15:39:50,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:50,395 INFO L124 PetriNetUnfolderBase]: 403/2014 cut-off events. [2023-12-09 15:39:50,395 INFO L125 PetriNetUnfolderBase]: For 6942/7844 co-relation queries the response was YES. [2023-12-09 15:39:50,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8580 conditions, 2014 events. 403/2014 cut-off events. For 6942/7844 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 15213 event pairs, 115 based on Foata normal form. 17/1795 useless extension candidates. Maximal degree in co-relation 7425. Up to 556 conditions per place. [2023-12-09 15:39:50,407 INFO L140 encePairwiseOnDemand]: 204/211 looper letters, 147 selfloop transitions, 20 changer transitions 4/326 dead transitions. [2023-12-09 15:39:50,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 326 transitions, 3643 flow [2023-12-09 15:39:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:39:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:39:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1081 transitions. [2023-12-09 15:39:50,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8538704581358609 [2023-12-09 15:39:50,409 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1081 transitions. [2023-12-09 15:39:50,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1081 transitions. [2023-12-09 15:39:50,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:50,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1081 transitions. [2023-12-09 15:39:50,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 180.16666666666666) internal successors, (1081), 6 states have internal predecessors, (1081), 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:39:50,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:39:50,413 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 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:39:50,413 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 40 predicate places. [2023-12-09 15:39:50,413 INFO L500 AbstractCegarLoop]: Abstraction has has 229 places, 326 transitions, 3643 flow [2023-12-09 15:39:50,414 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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:39:50,414 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:50,414 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] [2023-12-09 15:39:50,414 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:39:50,414 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:39:50,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:50,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1981758787, now seen corresponding path program 1 times [2023-12-09 15:39:50,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:50,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774087133] [2023-12-09 15:39:50,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:50,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:50,628 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:39:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774087133] [2023-12-09 15:39:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774087133] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:39:50,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324771711] [2023-12-09 15:39:50,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:50,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:50,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:39:50,632 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:39:50,685 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:39:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:50,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-09 15:39:50,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:39:51,208 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:39:51,261 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:39:51,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:39:51,345 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:39:51,345 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:39:51,410 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:39:51,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324771711] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:39:51,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:39:51,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 23 [2023-12-09 15:39:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942684948] [2023-12-09 15:39:51,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:39:51,411 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-09 15:39:51,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:51,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-09 15:39:51,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-12-09 15:39:51,414 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 211 [2023-12-09 15:39:51,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 326 transitions, 3643 flow. Second operand has 23 states, 23 states have (on average 106.21739130434783) internal successors, (2443), 23 states have internal predecessors, (2443), 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:39:51,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:51,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 211 [2023-12-09 15:39:51,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:55,236 INFO L124 PetriNetUnfolderBase]: 6674/15688 cut-off events. [2023-12-09 15:39:55,236 INFO L125 PetriNetUnfolderBase]: For 83221/83517 co-relation queries the response was YES. [2023-12-09 15:39:55,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65970 conditions, 15688 events. 6674/15688 cut-off events. For 83221/83517 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 143222 event pairs, 449 based on Foata normal form. 8/14316 useless extension candidates. Maximal degree in co-relation 59891. Up to 3149 conditions per place. [2023-12-09 15:39:55,353 INFO L140 encePairwiseOnDemand]: 174/211 looper letters, 871 selfloop transitions, 187 changer transitions 16/1163 dead transitions. [2023-12-09 15:39:55,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1163 transitions, 15868 flow [2023-12-09 15:39:55,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-09 15:39:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2023-12-09 15:39:55,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 6531 transitions. [2023-12-09 15:39:55,366 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5246204514418829 [2023-12-09 15:39:55,366 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 6531 transitions. [2023-12-09 15:39:55,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 6531 transitions. [2023-12-09 15:39:55,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:55,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 6531 transitions. [2023-12-09 15:39:55,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 110.69491525423729) internal successors, (6531), 59 states have internal predecessors, (6531), 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:39:55,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 211.0) internal successors, (12660), 60 states have internal predecessors, (12660), 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:39:55,404 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 211.0) internal successors, (12660), 60 states have internal predecessors, (12660), 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:39:55,404 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 98 predicate places. [2023-12-09 15:39:55,405 INFO L500 AbstractCegarLoop]: Abstraction has has 287 places, 1163 transitions, 15868 flow [2023-12-09 15:39:55,405 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 106.21739130434783) internal successors, (2443), 23 states have internal predecessors, (2443), 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:39:55,405 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:55,405 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] [2023-12-09 15:39:55,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:39:55,611 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,SelfDestructingSolverStorable9 [2023-12-09 15:39:55,612 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:39:55,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:55,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2126493613, now seen corresponding path program 2 times [2023-12-09 15:39:55,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:55,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787101107] [2023-12-09 15:39:55,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:55,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:55,960 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:39:55,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787101107] [2023-12-09 15:39:55,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787101107] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:39:55,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527450378] [2023-12-09 15:39:55,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:39:55,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:39:55,962 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:39:55,963 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:39:56,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-09 15:39:56,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:39:56,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:39:56,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:39:56,132 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:39:56,133 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:39:56,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527450378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:39:56,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:39:56,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-12-09 15:39:56,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022437113] [2023-12-09 15:39:56,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:39:56,133 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:39:56,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:56,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:39:56,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:39:56,135 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 211 [2023-12-09 15:39:56,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 1163 transitions, 15868 flow. Second operand has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 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:39:56,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:56,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 211 [2023-12-09 15:39:56,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:58,147 INFO L124 PetriNetUnfolderBase]: 6674/15720 cut-off events. [2023-12-09 15:39:58,148 INFO L125 PetriNetUnfolderBase]: For 85962/86260 co-relation queries the response was YES. [2023-12-09 15:39:58,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67461 conditions, 15720 events. 6674/15720 cut-off events. For 85962/86260 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 143824 event pairs, 437 based on Foata normal form. 0/14335 useless extension candidates. Maximal degree in co-relation 61011. Up to 3149 conditions per place. [2023-12-09 15:39:58,261 INFO L140 encePairwiseOnDemand]: 194/211 looper letters, 190 selfloop transitions, 15 changer transitions 15/1166 dead transitions. [2023-12-09 15:39:58,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 1166 transitions, 16308 flow [2023-12-09 15:39:58,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:39:58,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:39:58,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1786 transitions. [2023-12-09 15:39:58,263 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7053712480252765 [2023-12-09 15:39:58,263 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1786 transitions. [2023-12-09 15:39:58,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1786 transitions. [2023-12-09 15:39:58,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:58,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1786 transitions. [2023-12-09 15:39:58,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 148.83333333333334) internal successors, (1786), 12 states have internal predecessors, (1786), 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:39:58,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 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:39:58,269 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 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:39:58,269 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 108 predicate places. [2023-12-09 15:39:58,269 INFO L500 AbstractCegarLoop]: Abstraction has has 297 places, 1166 transitions, 16308 flow [2023-12-09 15:39:58,269 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 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:39:58,269 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:58,269 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] [2023-12-09 15:39:58,276 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:39:58,474 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,SelfDestructingSolverStorable10 [2023-12-09 15:39:58,475 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:39:58,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash -845210746, now seen corresponding path program 1 times [2023-12-09 15:39:58,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:58,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673480117] [2023-12-09 15:39:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:58,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:58,828 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:39:58,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673480117] [2023-12-09 15:39:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673480117] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:39:58,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196626091] [2023-12-09 15:39:58,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:58,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:58,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:39:58,830 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:39:58,832 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:39:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:58,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-09 15:39:58,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:39:59,236 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:39:59,307 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:39:59,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:39:59,364 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:39:59,364 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:39:59,442 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:39:59,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196626091] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:39:59,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:39:59,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 9] total 22 [2023-12-09 15:39:59,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731081179] [2023-12-09 15:39:59,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:39:59,443 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-09 15:39:59,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:59,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-09 15:39:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-12-09 15:39:59,445 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 211 [2023-12-09 15:39:59,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 1166 transitions, 16308 flow. Second operand has 22 states, 22 states have (on average 106.36363636363636) internal successors, (2340), 22 states have internal predecessors, (2340), 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:39:59,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:59,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 211 [2023-12-09 15:39:59,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:03,774 INFO L124 PetriNetUnfolderBase]: 7942/18597 cut-off events. [2023-12-09 15:40:03,774 INFO L125 PetriNetUnfolderBase]: For 109094/110378 co-relation queries the response was YES. [2023-12-09 15:40:03,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92215 conditions, 18597 events. 7942/18597 cut-off events. For 109094/110378 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 175382 event pairs, 388 based on Foata normal form. 151/17169 useless extension candidates. Maximal degree in co-relation 84517. Up to 6924 conditions per place. [2023-12-09 15:40:03,924 INFO L140 encePairwiseOnDemand]: 176/211 looper letters, 1330 selfloop transitions, 258 changer transitions 21/1701 dead transitions. [2023-12-09 15:40:03,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1701 transitions, 25144 flow [2023-12-09 15:40:03,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2023-12-09 15:40:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2023-12-09 15:40:03,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 7035 transitions. [2023-12-09 15:40:03,936 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.505170185264972 [2023-12-09 15:40:03,936 INFO L72 ComplementDD]: Start complementDD. Operand 66 states and 7035 transitions. [2023-12-09 15:40:03,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 7035 transitions. [2023-12-09 15:40:03,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:03,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 66 states and 7035 transitions. [2023-12-09 15:40:03,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 67 states, 66 states have (on average 106.5909090909091) internal successors, (7035), 66 states have internal predecessors, (7035), 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 67 states, 67 states have (on average 211.0) internal successors, (14137), 67 states have internal predecessors, (14137), 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,962 INFO L81 ComplementDD]: Finished complementDD. Result has 67 states, 67 states have (on average 211.0) internal successors, (14137), 67 states have internal predecessors, (14137), 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]: 189 programPoint places, 173 predicate places. [2023-12-09 15:40:03,963 INFO L500 AbstractCegarLoop]: Abstraction has has 362 places, 1701 transitions, 25144 flow [2023-12-09 15:40:03,963 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 106.36363636363636) internal successors, (2340), 22 states have internal predecessors, (2340), 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 L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:03,963 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] [2023-12-09 15:40:03,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:40:04,169 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:04,169 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:04,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1098634446, now seen corresponding path program 2 times [2023-12-09 15:40:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:04,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735047678] [2023-12-09 15:40:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:04,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:40:04,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:04,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735047678] [2023-12-09 15:40:04,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735047678] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:04,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:04,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:40:04,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455039169] [2023-12-09 15:40:04,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:04,524 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:40:04,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:04,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:40:04,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:40:04,526 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:40:04,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 1701 transitions, 25144 flow. Second operand has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:04,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:40:04,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:07,617 INFO L124 PetriNetUnfolderBase]: 8210/18990 cut-off events. [2023-12-09 15:40:07,617 INFO L125 PetriNetUnfolderBase]: For 143213/144262 co-relation queries the response was YES. [2023-12-09 15:40:07,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100735 conditions, 18990 events. 8210/18990 cut-off events. For 143213/144262 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 179354 event pairs, 455 based on Foata normal form. 10/17426 useless extension candidates. Maximal degree in co-relation 93643. Up to 7029 conditions per place. [2023-12-09 15:40:07,789 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 714 selfloop transitions, 143 changer transitions 21/1737 dead transitions. [2023-12-09 15:40:07,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 1737 transitions, 27628 flow [2023-12-09 15:40:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:40:07,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:40:07,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1610 transitions. [2023-12-09 15:40:07,815 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8478146392838336 [2023-12-09 15:40:07,815 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1610 transitions. [2023-12-09 15:40:07,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1610 transitions. [2023-12-09 15:40:07,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:07,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1610 transitions. [2023-12-09 15:40:07,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 178.88888888888889) internal successors, (1610), 9 states have internal predecessors, (1610), 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,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 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,826 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 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,826 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 181 predicate places. [2023-12-09 15:40:07,826 INFO L500 AbstractCegarLoop]: Abstraction has has 370 places, 1737 transitions, 27628 flow [2023-12-09 15:40:07,827 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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,827 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:07,827 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] [2023-12-09 15:40:07,827 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-09 15:40:07,827 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:07,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1259645430, now seen corresponding path program 3 times [2023-12-09 15:40:07,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:07,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346648568] [2023-12-09 15:40:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:08,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:40:08,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:08,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346648568] [2023-12-09 15:40:08,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346648568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:08,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:08,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:40:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726129249] [2023-12-09 15:40:08,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:08,189 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:40:08,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:08,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:40:08,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:40:08,191 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:40:08,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 1737 transitions, 27628 flow. Second operand has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:08,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:40:08,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:11,973 INFO L124 PetriNetUnfolderBase]: 9547/22194 cut-off events. [2023-12-09 15:40:11,973 INFO L125 PetriNetUnfolderBase]: For 196901/198266 co-relation queries the response was YES. [2023-12-09 15:40:12,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122832 conditions, 22194 events. 9547/22194 cut-off events. For 196901/198266 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 217591 event pairs, 523 based on Foata normal form. 14/20393 useless extension candidates. Maximal degree in co-relation 113740. Up to 9158 conditions per place. [2023-12-09 15:40:12,165 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 788 selfloop transitions, 167 changer transitions 21/1835 dead transitions. [2023-12-09 15:40:12,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1835 transitions, 32112 flow [2023-12-09 15:40:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:40:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:40:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1790 transitions. [2023-12-09 15:40:12,167 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8483412322274881 [2023-12-09 15:40:12,167 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1790 transitions. [2023-12-09 15:40:12,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1790 transitions. [2023-12-09 15:40:12,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:12,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1790 transitions. [2023-12-09 15:40:12,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 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,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 211.0) internal successors, (2321), 11 states have internal predecessors, (2321), 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,173 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 211.0) internal successors, (2321), 11 states have internal predecessors, (2321), 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,173 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 190 predicate places. [2023-12-09 15:40:12,173 INFO L500 AbstractCegarLoop]: Abstraction has has 379 places, 1835 transitions, 32112 flow [2023-12-09 15:40:12,174 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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,174 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:12,174 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] [2023-12-09 15:40:12,174 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-09 15:40:12,174 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:40:12,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 153024154, now seen corresponding path program 4 times [2023-12-09 15:40:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19776045] [2023-12-09 15:40:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:40:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19776045] [2023-12-09 15:40:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19776045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:40:12,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:40:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:40:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27983274] [2023-12-09 15:40:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:40:12,363 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:40:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:12,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:40:12,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:40:12,364 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:40:12,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 1835 transitions, 32112 flow. Second operand has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:12,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:40:12,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:16,491 INFO L124 PetriNetUnfolderBase]: 10206/23846 cut-off events. [2023-12-09 15:40:16,491 INFO L125 PetriNetUnfolderBase]: For 250282/252116 co-relation queries the response was YES. [2023-12-09 15:40:16,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138050 conditions, 23846 events. 10206/23846 cut-off events. For 250282/252116 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 237842 event pairs, 608 based on Foata normal form. 43/21922 useless extension candidates. Maximal degree in co-relation 127167. Up to 10130 conditions per place. [2023-12-09 15:40:16,764 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 873 selfloop transitions, 193 changer transitions 21/1946 dead transitions. [2023-12-09 15:40:16,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1946 transitions, 37381 flow [2023-12-09 15:40:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:40:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:40:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2309 transitions. [2023-12-09 15:40:16,775 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8417790740065622 [2023-12-09 15:40:16,775 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2309 transitions. [2023-12-09 15:40:16,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2309 transitions. [2023-12-09 15:40:16,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:16,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2309 transitions. [2023-12-09 15:40:16,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 177.6153846153846) internal successors, (2309), 13 states have internal predecessors, (2309), 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:16,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 211.0) internal successors, (2954), 14 states have internal predecessors, (2954), 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:16,781 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 211.0) internal successors, (2954), 14 states have internal predecessors, (2954), 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:16,782 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 202 predicate places. [2023-12-09 15:40:16,782 INFO L500 AbstractCegarLoop]: Abstraction has has 391 places, 1946 transitions, 37381 flow [2023-12-09 15:40:16,782 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 170.0) internal successors, (1530), 9 states have internal predecessors, (1530), 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:16,782 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:16,782 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] [2023-12-09 15:40:16,782 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-09 15:40:16,783 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:16,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:16,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1985439440, now seen corresponding path program 5 times [2023-12-09 15:40:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854532283] [2023-12-09 15:40:16,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:17,045 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:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:17,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854532283] [2023-12-09 15:40:17,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854532283] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:40:17,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064189444] [2023-12-09 15:40:17,046 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:40:17,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:40:17,047 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:40:17,060 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:40:17,154 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:40:17,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:40:17,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-09 15:40:17,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:40:17,496 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:17,668 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:17,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:40:17,793 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:40:17,902 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:17,976 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:17,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:40:18,086 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_217 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) c_~f~0.base) (+ (* c_~x2~0 4) c_~f~0.offset)) (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)))) is different from false [2023-12-09 15:40:18,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) c_~f~0.base) (+ (* c_~x2~0 4) c_~f~0.offset)) (select (select .cse0 c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset))))) is different from false [2023-12-09 15:40:18,131 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret15#1.base|) (+ (* c_~x1~0 4) |c_ULTIMATE.start_main_#t~ret15#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) |c_ULTIMATE.start_main_#t~ret15#1.base|) (+ (* c_~x2~0 4) |c_ULTIMATE.start_main_#t~ret15#1.offset|))))) is different from false [2023-12-09 15:40:18,188 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_217 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_216))) (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_217) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-12-09 15:40:18,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:40:18,226 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:40:18,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:40:18,234 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 414 treesize of output 326 [2023-12-09 15:40:18,238 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:40:18,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:40:18,245 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:40:18,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-09 15:40:18,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064189444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:40:18,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:40:18,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 20, 18] total 38 [2023-12-09 15:40:18,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062411726] [2023-12-09 15:40:18,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:40:18,434 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-09 15:40:18,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-09 15:40:18,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=992, Unknown=22, NotChecked=268, Total=1406 [2023-12-09 15:40:18,437 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 211 [2023-12-09 15:40:18,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 1946 transitions, 37381 flow. Second operand has 38 states, 38 states have (on average 90.60526315789474) internal successors, (3443), 38 states have internal predecessors, (3443), 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:18,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:18,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 211 [2023-12-09 15:40:18,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:30,722 INFO L124 PetriNetUnfolderBase]: 15640/36140 cut-off events. [2023-12-09 15:40:30,722 INFO L125 PetriNetUnfolderBase]: For 387717/394912 co-relation queries the response was YES. [2023-12-09 15:40:30,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232506 conditions, 36140 events. 15640/36140 cut-off events. For 387717/394912 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 389048 event pairs, 493 based on Foata normal form. 408/33740 useless extension candidates. Maximal degree in co-relation 216282. Up to 16230 conditions per place. [2023-12-09 15:40:31,098 INFO L140 encePairwiseOnDemand]: 170/211 looper letters, 2412 selfloop transitions, 683 changer transitions 41/3221 dead transitions. [2023-12-09 15:40:31,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 3221 transitions, 67371 flow [2023-12-09 15:40:31,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2023-12-09 15:40:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2023-12-09 15:40:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 9249 transitions. [2023-12-09 15:40:31,106 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4472869716607022 [2023-12-09 15:40:31,106 INFO L72 ComplementDD]: Start complementDD. Operand 98 states and 9249 transitions. [2023-12-09 15:40:31,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 9249 transitions. [2023-12-09 15:40:31,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:31,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 98 states and 9249 transitions. [2023-12-09 15:40:31,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 99 states, 98 states have (on average 94.37755102040816) internal successors, (9249), 98 states have internal predecessors, (9249), 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:31,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 99 states, 99 states have (on average 211.0) internal successors, (20889), 99 states have internal predecessors, (20889), 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:31,136 INFO L81 ComplementDD]: Finished complementDD. Result has 99 states, 99 states have (on average 211.0) internal successors, (20889), 99 states have internal predecessors, (20889), 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:31,136 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 299 predicate places. [2023-12-09 15:40:31,136 INFO L500 AbstractCegarLoop]: Abstraction has has 488 places, 3221 transitions, 67371 flow [2023-12-09 15:40:31,137 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 90.60526315789474) internal successors, (3443), 38 states have internal predecessors, (3443), 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:31,137 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:31,137 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] [2023-12-09 15:40:31,162 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:40:31,343 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,SelfDestructingSolverStorable15 [2023-12-09 15:40:31,343 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:31,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:31,343 INFO L85 PathProgramCache]: Analyzing trace with hash -902213170, now seen corresponding path program 6 times [2023-12-09 15:40:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:31,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9240700] [2023-12-09 15:40:31,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:31,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:31,609 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:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9240700] [2023-12-09 15:40:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9240700] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:40:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180399860] [2023-12-09 15:40:31,610 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-09 15:40:31,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:31,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:40:31,611 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:40:31,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:40:31,716 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-12-09 15:40:31,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:40:31,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-09 15:40:31,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:40:32,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:40:32,180 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:40:32,257 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:32,326 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:32,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:40:32,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_242 (Array Int Int))) (= c_~x1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~f~0.base) (+ (* c_~x2~0 4) c_~f~0.offset)))) is different from false [2023-12-09 15:40:32,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:40:32,423 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 46 treesize of output 30 [2023-12-09 15:40:32,426 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 13 treesize of output 7 [2023-12-09 15:40:32,883 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:32,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180399860] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:40:32,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:40:32,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 16] total 33 [2023-12-09 15:40:32,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776756291] [2023-12-09 15:40:32,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:40:32,884 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-09 15:40:32,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:32,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-09 15:40:32,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=886, Unknown=9, NotChecked=60, Total=1056 [2023-12-09 15:40:32,887 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2023-12-09 15:40:32,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 3221 transitions, 67371 flow. Second operand has 33 states, 33 states have (on average 98.9090909090909) internal successors, (3264), 33 states have internal predecessors, (3264), 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:32,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:32,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2023-12-09 15:40:32,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:40:42,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (div (+ 4294967294 c_~n~0) 4294967296)) (.cse2 (div c_~n~0 4294967296))) (let ((.cse4 (+ 1 .cse2)) (.cse3 (+ (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse6))) (let ((.cse0 (* .cse6 4294967296)) (.cse5 (<= .cse4 .cse3)) (.cse1 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ .cse0 |c_thread1Thread1of1ForFork0_~i~0#1|) (+ 4294967295 c_~n~0)) (forall ((v_ArrVal_242 (Array Int Int))) (= c_~x1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~f~0.base) .cse1))) (or (< .cse2 .cse3) (< (* 4294967296 .cse2) (+ (* (div (+ (- 1) c_~n~0) 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1|))) (or (< .cse3 .cse4) (< |c_thread1Thread1of1ForFork0_~i~0#1| 2)) (= c_~x1~0 (select (select |c_#memory_int| c_~f~0.base) .cse1)) (or (< .cse0 c_~n~0) (and (<= |c_thread1Thread1of1ForFork0_~i~0#1| 1) .cse5)) .cse5 (forall ((v_ArrVal_242 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~f~0.base) .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|)))))) is different from false [2023-12-09 15:40:42,661 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div (+ 4294967294 c_~n~0) 4294967296)) (.cse2 (div c_~n~0 4294967296))) (let ((.cse4 (+ 1 .cse2)) (.cse3 (+ (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) .cse0)) (.cse1 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (<= (+ (* .cse0 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1|) (+ 4294967295 c_~n~0)) (forall ((v_ArrVal_242 (Array Int Int))) (= c_~x1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~f~0.base) .cse1))) (or (< .cse2 .cse3) (< (* 4294967296 .cse2) (+ (* (div (+ (- 1) c_~n~0) 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1|))) (or (< .cse3 .cse4) (< |c_thread1Thread1of1ForFork0_~i~0#1| 2)) (= c_~x1~0 (select (select |c_#memory_int| c_~f~0.base) .cse1)) (<= .cse4 .cse3) (forall ((v_ArrVal_242 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_242) c_~f~0.base) .cse1) |c_thread1Thread1of1ForFork0_#t~mem1#1|))))) is different from false [2023-12-09 15:40:51,820 INFO L124 PetriNetUnfolderBase]: 19271/44186 cut-off events. [2023-12-09 15:40:51,820 INFO L125 PetriNetUnfolderBase]: For 531709/539557 co-relation queries the response was YES. [2023-12-09 15:40:52,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324128 conditions, 44186 events. 19271/44186 cut-off events. For 531709/539557 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 484504 event pairs, 501 based on Foata normal form. 680/41693 useless extension candidates. Maximal degree in co-relation 306080. Up to 22007 conditions per place. [2023-12-09 15:40:52,420 INFO L140 encePairwiseOnDemand]: 170/211 looper letters, 3261 selfloop transitions, 1351 changer transitions 48/4754 dead transitions. [2023-12-09 15:40:52,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 4754 transitions, 109357 flow [2023-12-09 15:40:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2023-12-09 15:40:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2023-12-09 15:40:52,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 12302 transitions. [2023-12-09 15:40:52,454 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4858609794628752 [2023-12-09 15:40:52,455 INFO L72 ComplementDD]: Start complementDD. Operand 120 states and 12302 transitions. [2023-12-09 15:40:52,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 12302 transitions. [2023-12-09 15:40:52,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:40:52,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 120 states and 12302 transitions. [2023-12-09 15:40:52,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 121 states, 120 states have (on average 102.51666666666667) internal successors, (12302), 120 states have internal predecessors, (12302), 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:52,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 121 states, 121 states have (on average 211.0) internal successors, (25531), 121 states have internal predecessors, (25531), 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:52,480 INFO L81 ComplementDD]: Finished complementDD. Result has 121 states, 121 states have (on average 211.0) internal successors, (25531), 121 states have internal predecessors, (25531), 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:52,481 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 418 predicate places. [2023-12-09 15:40:52,481 INFO L500 AbstractCegarLoop]: Abstraction has has 607 places, 4754 transitions, 109357 flow [2023-12-09 15:40:52,481 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 98.9090909090909) internal successors, (3264), 33 states have internal predecessors, (3264), 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:52,481 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:40:52,481 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] [2023-12-09 15:40:52,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:40:52,686 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-09 15:40:52,686 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:40:52,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:40:52,687 INFO L85 PathProgramCache]: Analyzing trace with hash -813665624, now seen corresponding path program 7 times [2023-12-09 15:40:52,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:40:52,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942363921] [2023-12-09 15:40:52,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:40:52,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:40:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:52,914 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:52,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:40:52,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942363921] [2023-12-09 15:40:52,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942363921] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:40:52,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152602581] [2023-12-09 15:40:52,914 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-09 15:40:52,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:40:52,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:40:52,915 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:40:52,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:40:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:40:53,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-09 15:40:53,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:40:53,327 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:53,394 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:53,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:40:53,436 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-12-09 15:40:53,437 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:53,503 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:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152602581] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:40:53,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:40:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 9] total 21 [2023-12-09 15:40:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808908771] [2023-12-09 15:40:53,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:40:53,504 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-09 15:40:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:40:53,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-09 15:40:53,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-12-09 15:40:53,506 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 211 [2023-12-09 15:40:53,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 4754 transitions, 109357 flow. Second operand has 21 states, 21 states have (on average 106.76190476190476) internal successors, (2242), 21 states have internal predecessors, (2242), 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:53,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:40:53,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 211 [2023-12-09 15:40:53,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:41:16,617 INFO L124 PetriNetUnfolderBase]: 20889/47465 cut-off events. [2023-12-09 15:41:16,617 INFO L125 PetriNetUnfolderBase]: For 604934/613946 co-relation queries the response was YES. [2023-12-09 15:41:16,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384716 conditions, 47465 events. 20889/47465 cut-off events. For 604934/613946 co-relation queries the response was YES. Maximal size of possible extension queue 1353. Compared 526116 event pairs, 613 based on Foata normal form. 351/44464 useless extension candidates. Maximal degree in co-relation 364632. Up to 23629 conditions per place. [2023-12-09 15:41:17,131 INFO L140 encePairwiseOnDemand]: 177/211 looper letters, 4832 selfloop transitions, 765 changer transitions 54/5748 dead transitions. [2023-12-09 15:41:17,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 5748 transitions, 137733 flow [2023-12-09 15:41:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-12-09 15:41:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2023-12-09 15:41:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 7751 transitions. [2023-12-09 15:41:17,151 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5032136596766864 [2023-12-09 15:41:17,152 INFO L72 ComplementDD]: Start complementDD. Operand 73 states and 7751 transitions. [2023-12-09 15:41:17,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 7751 transitions. [2023-12-09 15:41:17,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:41:17,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 73 states and 7751 transitions. [2023-12-09 15:41:17,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 74 states, 73 states have (on average 106.17808219178082) internal successors, (7751), 73 states have internal predecessors, (7751), 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:41:17,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 74 states, 74 states have (on average 211.0) internal successors, (15614), 74 states have internal predecessors, (15614), 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:41:17,183 INFO L81 ComplementDD]: Finished complementDD. Result has 74 states, 74 states have (on average 211.0) internal successors, (15614), 74 states have internal predecessors, (15614), 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:41:17,192 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 490 predicate places. [2023-12-09 15:41:17,193 INFO L500 AbstractCegarLoop]: Abstraction has has 679 places, 5748 transitions, 137733 flow [2023-12-09 15:41:17,193 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 106.76190476190476) internal successors, (2242), 21 states have internal predecessors, (2242), 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:41:17,193 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:41:17,193 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] [2023-12-09 15:41:17,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-09 15:41:17,398 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-09 15:41:17,399 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:41:17,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:41:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1890280872, now seen corresponding path program 8 times [2023-12-09 15:41:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:41:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013887962] [2023-12-09 15:41:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:41:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:41:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:41:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:41:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:41:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013887962] [2023-12-09 15:41:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013887962] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:41:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:41:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:41:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208870330] [2023-12-09 15:41:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:41:17,636 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:41:17,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:41:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:41:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:41:17,637 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:41:17,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 5748 transitions, 137733 flow. Second operand has 7 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 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:41:17,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:41:17,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:41:17,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:41:39,426 INFO L124 PetriNetUnfolderBase]: 22300/50965 cut-off events. [2023-12-09 15:41:39,426 INFO L125 PetriNetUnfolderBase]: For 741043/750383 co-relation queries the response was YES. [2023-12-09 15:41:39,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425545 conditions, 50965 events. 22300/50965 cut-off events. For 741043/750383 co-relation queries the response was YES. Maximal size of possible extension queue 1501. Compared 575101 event pairs, 590 based on Foata normal form. 83/47534 useless extension candidates. Maximal degree in co-relation 402163. Up to 26054 conditions per place. [2023-12-09 15:41:39,996 INFO L140 encePairwiseOnDemand]: 201/211 looper letters, 2522 selfloop transitions, 518 changer transitions 56/5909 dead transitions. [2023-12-09 15:41:39,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 5909 transitions, 149508 flow [2023-12-09 15:41:39,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:41:39,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:41:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1608 transitions. [2023-12-09 15:41:40,000 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8467614533965245 [2023-12-09 15:41:40,000 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1608 transitions. [2023-12-09 15:41:40,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1608 transitions. [2023-12-09 15:41:40,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:41:40,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1608 transitions. [2023-12-09 15:41:40,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 178.66666666666666) internal successors, (1608), 9 states have internal predecessors, (1608), 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:41:40,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 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:41:40,014 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 211.0) internal successors, (2110), 10 states have internal predecessors, (2110), 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:41:40,014 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 498 predicate places. [2023-12-09 15:41:40,014 INFO L500 AbstractCegarLoop]: Abstraction has has 687 places, 5909 transitions, 149508 flow [2023-12-09 15:41:40,015 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 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:41:40,015 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:41:40,015 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] [2023-12-09 15:41:40,023 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-09 15:41:40,023 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:41:40,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:41:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2031012362, now seen corresponding path program 9 times [2023-12-09 15:41:40,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:41:40,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230734523] [2023-12-09 15:41:40,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:41:40,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:41:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:41:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:41:40,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:41:40,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230734523] [2023-12-09 15:41:40,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230734523] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:41:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:41:40,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:41:40,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644793269] [2023-12-09 15:41:40,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:41:40,353 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:41:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:41:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:41:40,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:41:40,354 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:41:40,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 5909 transitions, 149508 flow. Second operand has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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:41:40,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:41:40,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:41:40,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:42:09,132 INFO L124 PetriNetUnfolderBase]: 25558/58782 cut-off events. [2023-12-09 15:42:09,133 INFO L125 PetriNetUnfolderBase]: For 986237/999234 co-relation queries the response was YES. [2023-12-09 15:42:09,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506461 conditions, 58782 events. 25558/58782 cut-off events. For 986237/999234 co-relation queries the response was YES. Maximal size of possible extension queue 1850. Compared 683334 event pairs, 664 based on Foata normal form. 250/55002 useless extension candidates. Maximal degree in co-relation 478239. Up to 31112 conditions per place. [2023-12-09 15:42:09,826 INFO L140 encePairwiseOnDemand]: 201/211 looper letters, 3088 selfloop transitions, 536 changer transitions 56/6493 dead transitions. [2023-12-09 15:42:09,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 6493 transitions, 178820 flow [2023-12-09 15:42:09,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:42:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:42:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1781 transitions. [2023-12-09 15:42:09,829 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8440758293838863 [2023-12-09 15:42:09,829 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1781 transitions. [2023-12-09 15:42:09,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1781 transitions. [2023-12-09 15:42:09,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:42:09,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1781 transitions. [2023-12-09 15:42:09,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 178.1) internal successors, (1781), 10 states have internal predecessors, (1781), 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:09,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 211.0) internal successors, (2321), 11 states have internal predecessors, (2321), 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:09,846 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 211.0) internal successors, (2321), 11 states have internal predecessors, (2321), 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:09,847 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 507 predicate places. [2023-12-09 15:42:09,847 INFO L500 AbstractCegarLoop]: Abstraction has has 696 places, 6493 transitions, 178820 flow [2023-12-09 15:42:09,847 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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:09,847 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:42:09,860 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] [2023-12-09 15:42:09,860 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-09 15:42:09,860 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:42:09,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:42:09,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2020860284, now seen corresponding path program 10 times [2023-12-09 15:42:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:42:09,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173321073] [2023-12-09 15:42:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:42:09,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:42:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:42:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:42:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:42:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173321073] [2023-12-09 15:42:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173321073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:42:10,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:42:10,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:42:10,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275706698] [2023-12-09 15:42:10,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:42:10,201 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:42:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:42:10,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:42:10,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:42:10,202 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:42:10,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 6493 transitions, 178820 flow. Second operand has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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:10,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:42:10,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:42:10,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:42:44,250 INFO L124 PetriNetUnfolderBase]: 26583/61503 cut-off events. [2023-12-09 15:42:44,251 INFO L125 PetriNetUnfolderBase]: For 1148320/1162377 co-relation queries the response was YES. [2023-12-09 15:42:44,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544326 conditions, 61503 events. 26583/61503 cut-off events. For 1148320/1162377 co-relation queries the response was YES. Maximal size of possible extension queue 1972. Compared 723575 event pairs, 750 based on Foata normal form. 424/57676 useless extension candidates. Maximal degree in co-relation 513091. Up to 32681 conditions per place. [2023-12-09 15:42:45,024 INFO L140 encePairwiseOnDemand]: 201/211 looper letters, 2965 selfloop transitions, 810 changer transitions 56/6644 dead transitions. [2023-12-09 15:42:45,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 6644 transitions, 192437 flow [2023-12-09 15:42:45,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:42:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:42:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2126 transitions. [2023-12-09 15:42:45,026 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.839652448657188 [2023-12-09 15:42:45,026 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2126 transitions. [2023-12-09 15:42:45,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2126 transitions. [2023-12-09 15:42:45,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:42:45,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2126 transitions. [2023-12-09 15:42:45,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 177.16666666666666) internal successors, (2126), 12 states have internal predecessors, (2126), 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:45,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 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:45,045 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 211.0) internal successors, (2743), 13 states have internal predecessors, (2743), 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:45,046 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 518 predicate places. [2023-12-09 15:42:45,046 INFO L500 AbstractCegarLoop]: Abstraction has has 707 places, 6644 transitions, 192437 flow [2023-12-09 15:42:45,046 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 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:45,046 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:42:45,046 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] [2023-12-09 15:42:45,046 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-09 15:42:45,046 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:42:45,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:42:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1694412868, now seen corresponding path program 11 times [2023-12-09 15:42:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:42:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831277768] [2023-12-09 15:42:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:42:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:42:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:42:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:42:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:42:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831277768] [2023-12-09 15:42:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831277768] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:42:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:42:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:42:45,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900487708] [2023-12-09 15:42:45,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:42:45,552 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:42:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:42:45,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:42:45,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:42:45,553 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:42:45,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 6644 transitions, 192437 flow. Second operand has 7 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 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:45,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:42:45,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:42:45,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:43:20,985 INFO L124 PetriNetUnfolderBase]: 27679/63954 cut-off events. [2023-12-09 15:43:20,985 INFO L125 PetriNetUnfolderBase]: For 1333153/1348176 co-relation queries the response was YES. [2023-12-09 15:43:21,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584272 conditions, 63954 events. 27679/63954 cut-off events. For 1333153/1348176 co-relation queries the response was YES. Maximal size of possible extension queue 2080. Compared 756780 event pairs, 774 based on Foata normal form. 103/59705 useless extension candidates. Maximal degree in co-relation 549978. Up to 34236 conditions per place. [2023-12-09 15:43:21,798 INFO L140 encePairwiseOnDemand]: 201/211 looper letters, 3256 selfloop transitions, 642 changer transitions 56/6767 dead transitions. [2023-12-09 15:43:21,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 6767 transitions, 205298 flow [2023-12-09 15:43:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:43:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:43:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1416 transitions. [2023-12-09 15:43:21,799 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8388625592417062 [2023-12-09 15:43:21,799 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1416 transitions. [2023-12-09 15:43:21,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1416 transitions. [2023-12-09 15:43:21,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:43:21,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1416 transitions. [2023-12-09 15:43:21,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 177.0) internal successors, (1416), 8 states have internal predecessors, (1416), 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:43:21,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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:43:21,820 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 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:43:21,820 INFO L308 CegarLoopForPetriNet]: 189 programPoint places, 525 predicate places. [2023-12-09 15:43:21,820 INFO L500 AbstractCegarLoop]: Abstraction has has 714 places, 6767 transitions, 205298 flow [2023-12-09 15:43:21,820 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 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:43:21,820 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:43:21,820 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] [2023-12-09 15:43:21,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-09 15:43:21,821 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:43:21,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:43:21,821 INFO L85 PathProgramCache]: Analyzing trace with hash -87184330, now seen corresponding path program 12 times [2023-12-09 15:43:21,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:43:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159641876] [2023-12-09 15:43:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:43:21,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:43:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:43:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:43:22,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:43:22,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159641876] [2023-12-09 15:43:22,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159641876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:43:22,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:43:22,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:43:22,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264832168] [2023-12-09 15:43:22,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:43:22,117 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:43:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:43:22,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:43:22,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:43:22,118 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 211 [2023-12-09 15:43:22,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 6767 transitions, 205298 flow. Second operand has 7 states, 7 states have (on average 170.57142857142858) internal successors, (1194), 7 states have internal predecessors, (1194), 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:43:22,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:43:22,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 211 [2023-12-09 15:43:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:43:51,821 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:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:43:52,021 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:43:52,021 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-09 15:43:52,021 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (7states, 168/211 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 464295 conditions, 48256 events (20776/48255 cut-off events. For 1123680/1136902 co-relation queries the response was YES. Maximal size of possible extension queue 2186. Compared 594243 event pairs, 481 based on Foata normal form. 95/46605 useless extension candidates. Maximal degree in co-relation 446846. Up to 24507 conditions per place.). [2023-12-09 15:43:52,022 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:43:52,022 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:43:52,023 INFO L457 BasicCegarLoop]: Path program histogram: [12, 8, 2, 1] [2023-12-09 15:43:52,025 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:43:52,025 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:43:52,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:43:52 BasicIcfg [2023-12-09 15:43:52,027 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:43:52,027 INFO L158 Benchmark]: Toolchain (without parser) took 247322.87ms. Allocated memory was 179.3MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 147.5MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2023-12-09 15:43:52,027 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 179.3MB. Free memory was 137.8MB in the beginning and 137.5MB in the end (delta: 265.7kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:43:52,028 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.36ms. Allocated memory is still 179.3MB. Free memory was 147.1MB in the beginning and 135.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:43:52,028 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.84ms. Allocated memory is still 179.3MB. Free memory was 135.4MB in the beginning and 133.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:43:52,028 INFO L158 Benchmark]: Boogie Preprocessor took 19.92ms. Allocated memory is still 179.3MB. Free memory was 133.3MB in the beginning and 131.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:43:52,028 INFO L158 Benchmark]: RCFGBuilder took 346.03ms. Allocated memory is still 179.3MB. Free memory was 131.4MB in the beginning and 112.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-09 15:43:52,028 INFO L158 Benchmark]: TraceAbstraction took 246766.95ms. Allocated memory was 179.3MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 111.9MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. [2023-12-09 15:43:52,029 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.14ms. Allocated memory is still 179.3MB. Free memory was 137.8MB in the beginning and 137.5MB in the end (delta: 265.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 160.36ms. Allocated memory is still 179.3MB. Free memory was 147.1MB in the beginning and 135.4MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.84ms. Allocated memory is still 179.3MB. Free memory was 135.4MB in the beginning and 133.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.92ms. Allocated memory is still 179.3MB. Free memory was 133.3MB in the beginning and 131.4MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 346.03ms. Allocated memory is still 179.3MB. Free memory was 131.4MB in the beginning and 112.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 246766.95ms. Allocated memory was 179.3MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 111.9MB in the beginning and 3.9GB in the end (delta: -3.7GB). Peak memory consumption was 3.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (7states, 168/211 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 464295 conditions, 48256 events (20776/48255 cut-off events. For 1123680/1136902 co-relation queries the response was YES. Maximal size of possible extension queue 2186. Compared 594243 event pairs, 481 based on Foata normal form. 95/46605 useless extension candidates. Maximal degree in co-relation 446846. Up to 24507 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (7states, 168/211 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 464295 conditions, 48256 events (20776/48255 cut-off events. For 1123680/1136902 co-relation queries the response was YES. Maximal size of possible extension queue 2186. Compared 594243 event pairs, 481 based on Foata normal form. 95/46605 useless extension candidates. Maximal degree in co-relation 446846. Up to 24507 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (7states, 168/211 universal loopers) in iteration 23,while PetriNetUnfolder was constructing finite prefix that currently has 464295 conditions, 48256 events (20776/48255 cut-off events. For 1123680/1136902 co-relation queries the response was YES. Maximal size of possible extension queue 2186. Compared 594243 event pairs, 481 based on Foata normal form. 95/46605 useless extension candidates. Maximal degree in co-relation 446846. Up to 24507 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 288 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: 246.7s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 233.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5789 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5789 mSDsluCounter, 13334 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5360 IncrementalHoareTripleChecker+Unchecked, 11696 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15149 IncrementalHoareTripleChecker+Invalid, 20626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 1638 mSDtfsCounter, 15149 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2036 GetRequests, 1419 SyntacticMatches, 10 SemanticMatches, 607 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 17192 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205298occurred in iteration=22, InterpolantAutomatonStates: 548, 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, 10.1s InterpolantComputationTime, 3421 NumberOfCodeBlocks, 3388 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4009 ConstructedInterpolants, 38 QuantifiedInterpolants, 20755 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 34 InterpolantComputations, 18 PerfectInterpolantSequences, 27/45 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