/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/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:47:07,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:47:07,578 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 14:47:07,604 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:47:07,605 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:47:07,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:47:07,606 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:47:07,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:47:07,606 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:47:07,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:47:07,610 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:47:07,610 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:47:07,610 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:47:07,611 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:47:07,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:47:07,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:47:07,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:47:07,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:47:07,612 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:47:07,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:47:07,612 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:47:07,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:47:07,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:47:07,613 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:47:07,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:47:07,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:47:07,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:47:07,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:47:07,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:47:07,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:47:07,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:47:07,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:47:07,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:47:07,615 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 14:47:07,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:47:07,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:47:07,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:47:07,815 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:47:07,815 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:47:07,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2023-12-09 14:47:08,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:47:09,115 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:47:09,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2023-12-09 14:47:09,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4206ea248/08fb0852e50e44c0b448e76f9c721ff9/FLAG9c6ef65bd [2023-12-09 14:47:09,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4206ea248/08fb0852e50e44c0b448e76f9c721ff9 [2023-12-09 14:47:09,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:47:09,140 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:47:09,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:47:09,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:47:09,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:47:09,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22722086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09, skipping insertion in model container [2023-12-09 14:47:09,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,172 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:47:09,455 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-12-09 14:47:09,459 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-12-09 14:47:09,462 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:47:09,469 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:47:09,507 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2023-12-09 14:47:09,509 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2023-12-09 14:47:09,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:47:09,577 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:47:09,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09 WrapperNode [2023-12-09 14:47:09,578 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:47:09,579 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:47:09,579 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:47:09,579 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:47:09,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,623 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2023-12-09 14:47:09,623 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:47:09,624 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:47:09,624 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:47:09,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:47:09,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,646 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:47:09,650 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:47:09,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:47:09,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:47:09,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (1/1) ... [2023-12-09 14:47:09,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:47:09,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:09,733 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 14:47:09,736 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 14:47:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-09 14:47:09,760 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-09 14:47:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-09 14:47:09,760 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-09 14:47:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:47:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:47:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 14:47:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 14:47:09,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:47:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 14:47:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:47:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:47:09,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:47:09,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:47:09,762 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 14:47:09,866 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:47:09,867 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:47:10,176 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:47:10,201 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:47:10,202 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-09 14:47:10,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:47:10 BoogieIcfgContainer [2023-12-09 14:47:10,203 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:47:10,204 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:47:10,204 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:47:10,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:47:10,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:47:09" (1/3) ... [2023-12-09 14:47:10,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8b21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:47:10, skipping insertion in model container [2023-12-09 14:47:10,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:47:09" (2/3) ... [2023-12-09 14:47:10,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e8b21a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:47:10, skipping insertion in model container [2023-12-09 14:47:10,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:47:10" (3/3) ... [2023-12-09 14:47:10,208 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-12-09 14:47:10,220 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:47:10,220 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-09 14:47:10,221 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:47:10,389 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 14:47:10,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 470 flow [2023-12-09 14:47:10,493 INFO L124 PetriNetUnfolderBase]: 13/226 cut-off events. [2023-12-09 14:47:10,493 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:47:10,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 226 events. 13/226 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 375 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2023-12-09 14:47:10,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 470 flow [2023-12-09 14:47:10,510 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 216 transitions, 441 flow [2023-12-09 14:47:10,517 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:47:10,522 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;@1fb89d9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:47:10,522 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:47:10,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:47:10,535 INFO L124 PetriNetUnfolderBase]: 1/58 cut-off events. [2023-12-09 14:47:10,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:47:10,536 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:10,536 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] [2023-12-09 14:47:10,537 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:10,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash -484014062, now seen corresponding path program 1 times [2023-12-09 14:47:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:10,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248775434] [2023-12-09 14:47:10,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:10,723 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 14:47:10,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:10,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248775434] [2023-12-09 14:47:10,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248775434] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:10,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:10,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:47:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618609440] [2023-12-09 14:47:10,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:10,731 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:47:10,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:47:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:47:10,755 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 228 [2023-12-09 14:47:10,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 216 transitions, 441 flow. Second operand has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 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 14:47:10,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:10,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 228 [2023-12-09 14:47:10,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:10,849 INFO L124 PetriNetUnfolderBase]: 26/374 cut-off events. [2023-12-09 14:47:10,850 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-12-09 14:47:10,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 374 events. 26/374 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1274 event pairs, 8 based on Foata normal form. 10/364 useless extension candidates. Maximal degree in co-relation 325. Up to 24 conditions per place. [2023-12-09 14:47:10,854 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 7 selfloop transitions, 0 changer transitions 3/207 dead transitions. [2023-12-09 14:47:10,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 207 transitions, 437 flow [2023-12-09 14:47:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:47:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:47:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 437 transitions. [2023-12-09 14:47:10,872 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2023-12-09 14:47:10,872 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 437 transitions. [2023-12-09 14:47:10,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 437 transitions. [2023-12-09 14:47:10,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:10,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 437 transitions. [2023-12-09 14:47:10,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 0 states have call successors, (0), 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 14:47:10,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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 14:47:10,883 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 228.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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 14:47:10,885 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, -4 predicate places. [2023-12-09 14:47:10,886 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 207 transitions, 437 flow [2023-12-09 14:47:10,886 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 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 14:47:10,886 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:10,886 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] [2023-12-09 14:47:10,886 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:47:10,887 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:10,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 559808428, now seen corresponding path program 1 times [2023-12-09 14:47:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308320099] [2023-12-09 14:47:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:11,958 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 14:47:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:11,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308320099] [2023-12-09 14:47:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308320099] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:11,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-09 14:47:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810481369] [2023-12-09 14:47:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:11,960 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-09 14:47:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:11,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-09 14:47:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-09 14:47:11,965 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-12-09 14:47:11,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 207 transitions, 437 flow. Second operand has 12 states, 12 states have (on average 158.66666666666666) internal successors, (1904), 12 states have internal predecessors, (1904), 0 states have call successors, (0), 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 14:47:11,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:11,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-12-09 14:47:11,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:12,693 INFO L124 PetriNetUnfolderBase]: 841/3185 cut-off events. [2023-12-09 14:47:12,693 INFO L125 PetriNetUnfolderBase]: For 287/289 co-relation queries the response was YES. [2023-12-09 14:47:12,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4677 conditions, 3185 events. 841/3185 cut-off events. For 287/289 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 25285 event pairs, 621 based on Foata normal form. 0/2968 useless extension candidates. Maximal degree in co-relation 4301. Up to 1207 conditions per place. [2023-12-09 14:47:12,718 INFO L140 encePairwiseOnDemand]: 211/228 looper letters, 46 selfloop transitions, 16 changer transitions 0/203 dead transitions. [2023-12-09 14:47:12,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 553 flow [2023-12-09 14:47:12,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 14:47:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 14:47:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1923 transitions. [2023-12-09 14:47:12,727 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7028508771929824 [2023-12-09 14:47:12,727 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1923 transitions. [2023-12-09 14:47:12,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1923 transitions. [2023-12-09 14:47:12,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:12,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1923 transitions. [2023-12-09 14:47:12,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 160.25) internal successors, (1923), 12 states have internal predecessors, (1923), 0 states have call successors, (0), 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 14:47:12,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 0 states have call successors, (0), 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 14:47:12,740 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 0 states have call successors, (0), 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 14:47:12,742 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 4 predicate places. [2023-12-09 14:47:12,742 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 203 transitions, 553 flow [2023-12-09 14:47:12,743 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 158.66666666666666) internal successors, (1904), 12 states have internal predecessors, (1904), 0 states have call successors, (0), 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 14:47:12,744 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:12,744 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] [2023-12-09 14:47:12,745 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:47:12,745 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:12,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:12,750 INFO L85 PathProgramCache]: Analyzing trace with hash 348938573, now seen corresponding path program 1 times [2023-12-09 14:47:12,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:12,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022184231] [2023-12-09 14:47:12,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:12,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:12,947 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 14:47:12,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:12,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022184231] [2023-12-09 14:47:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022184231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:12,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:47:12,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381311457] [2023-12-09 14:47:12,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:12,948 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:47:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:12,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:47:12,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:47:12,949 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 228 [2023-12-09 14:47:12,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 203 transitions, 553 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 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 14:47:12,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:12,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 228 [2023-12-09 14:47:12,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:13,068 INFO L124 PetriNetUnfolderBase]: 306/1259 cut-off events. [2023-12-09 14:47:13,068 INFO L125 PetriNetUnfolderBase]: For 747/783 co-relation queries the response was YES. [2023-12-09 14:47:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 1259 events. 306/1259 cut-off events. For 747/783 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7494 event pairs, 222 based on Foata normal form. 0/1167 useless extension candidates. Maximal degree in co-relation 1781. Up to 485 conditions per place. [2023-12-09 14:47:13,075 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 12 selfloop transitions, 2 changer transitions 9/209 dead transitions. [2023-12-09 14:47:13,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 629 flow [2023-12-09 14:47:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:47:13,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:47:13,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-12-09 14:47:13,077 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9371345029239766 [2023-12-09 14:47:13,077 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-12-09 14:47:13,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-12-09 14:47:13,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:13,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-12-09 14:47:13,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 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 14:47:13,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 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 14:47:13,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 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 14:47:13,081 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 6 predicate places. [2023-12-09 14:47:13,082 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 629 flow [2023-12-09 14:47:13,082 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 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 14:47:13,082 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:13,082 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] [2023-12-09 14:47:13,083 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:47:13,083 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:13,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:13,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1606788658, now seen corresponding path program 1 times [2023-12-09 14:47:13,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:13,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378146835] [2023-12-09 14:47:13,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:13,152 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 14:47:13,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:13,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378146835] [2023-12-09 14:47:13,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378146835] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:13,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:13,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:47:13,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6994017] [2023-12-09 14:47:13,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:13,153 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:47:13,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:13,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:47:13,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:47:13,154 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-12-09 14:47:13,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 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 14:47:13,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:13,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-12-09 14:47:13,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:13,394 INFO L124 PetriNetUnfolderBase]: 447/1756 cut-off events. [2023-12-09 14:47:13,395 INFO L125 PetriNetUnfolderBase]: For 2178/2255 co-relation queries the response was YES. [2023-12-09 14:47:13,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3594 conditions, 1756 events. 447/1756 cut-off events. For 2178/2255 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10388 event pairs, 294 based on Foata normal form. 2/1669 useless extension candidates. Maximal degree in co-relation 3089. Up to 702 conditions per place. [2023-12-09 14:47:13,404 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/216 dead transitions. [2023-12-09 14:47:13,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 718 flow [2023-12-09 14:47:13,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:47:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:47:13,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-12-09 14:47:13,408 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2023-12-09 14:47:13,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-12-09 14:47:13,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-12-09 14:47:13,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:13,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-12-09 14:47:13,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 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 14:47:13,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 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 14:47:13,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 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 14:47:13,418 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 8 predicate places. [2023-12-09 14:47:13,418 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 718 flow [2023-12-09 14:47:13,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 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 14:47:13,419 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:13,419 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:47:13,419 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:47:13,420 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:13,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1287457348, now seen corresponding path program 1 times [2023-12-09 14:47:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440162561] [2023-12-09 14:47:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:13,588 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 14:47:13,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440162561] [2023-12-09 14:47:13,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440162561] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:13,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627039111] [2023-12-09 14:47:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:13,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:13,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:13,613 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 14:47:13,657 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 14:47:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:13,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-09 14:47:13,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:13,815 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 11 treesize of output 7 [2023-12-09 14:47:13,870 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 14:47:13,874 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:47:13,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627039111] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:13,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:47:13,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-09 14:47:13,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586090930] [2023-12-09 14:47:13,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:13,875 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:47:13,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:13,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:47:13,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 14:47:13,877 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-12-09 14:47:13,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 216 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 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 14:47:13,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:13,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-12-09 14:47:13,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:13,999 INFO L124 PetriNetUnfolderBase]: 201/1116 cut-off events. [2023-12-09 14:47:13,999 INFO L125 PetriNetUnfolderBase]: For 1887/1912 co-relation queries the response was YES. [2023-12-09 14:47:14,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2124 conditions, 1116 events. 201/1116 cut-off events. For 1887/1912 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 5780 event pairs, 111 based on Foata normal form. 62/1125 useless extension candidates. Maximal degree in co-relation 1578. Up to 383 conditions per place. [2023-12-09 14:47:14,004 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 15 selfloop transitions, 3 changer transitions 10/218 dead transitions. [2023-12-09 14:47:14,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 798 flow [2023-12-09 14:47:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:47:14,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:47:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2023-12-09 14:47:14,006 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2023-12-09 14:47:14,006 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2023-12-09 14:47:14,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2023-12-09 14:47:14,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:14,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2023-12-09 14:47:14,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 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 14:47:14,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 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 14:47:14,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 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 14:47:14,012 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 10 predicate places. [2023-12-09 14:47:14,014 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 798 flow [2023-12-09 14:47:14,015 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 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 14:47:14,017 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:14,018 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 14:47:14,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 14:47:14,222 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:14,223 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:14,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1206536814, now seen corresponding path program 1 times [2023-12-09 14:47:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878887083] [2023-12-09 14:47:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:14,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:14,339 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 14:47:14,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:14,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878887083] [2023-12-09 14:47:14,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878887083] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:14,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162314660] [2023-12-09 14:47:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:14,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:14,356 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 14:47:14,357 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 14:47:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:14,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:47:14,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:14,561 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 14:47:14,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:14,613 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 14:47:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162314660] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:14,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:14,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:47:14,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512581217] [2023-12-09 14:47:14,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:14,616 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:47:14,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:14,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:47:14,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:47:14,619 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:14,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 798 flow. Second operand has 10 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 0 states have call successors, (0), 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 14:47:14,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:14,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:14,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:14,821 INFO L124 PetriNetUnfolderBase]: 254/1403 cut-off events. [2023-12-09 14:47:14,822 INFO L125 PetriNetUnfolderBase]: For 2153/2196 co-relation queries the response was YES. [2023-12-09 14:47:14,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2877 conditions, 1403 events. 254/1403 cut-off events. For 2153/2196 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 6417 event pairs, 154 based on Foata normal form. 1/1344 useless extension candidates. Maximal degree in co-relation 2306. Up to 491 conditions per place. [2023-12-09 14:47:14,828 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 27 selfloop transitions, 9 changer transitions 10/231 dead transitions. [2023-12-09 14:47:14,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 231 transitions, 998 flow [2023-12-09 14:47:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:47:14,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:47:14,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1880 transitions. [2023-12-09 14:47:14,831 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2023-12-09 14:47:14,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1880 transitions. [2023-12-09 14:47:14,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1880 transitions. [2023-12-09 14:47:14,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:14,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1880 transitions. [2023-12-09 14:47:14,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 208.88888888888889) internal successors, (1880), 9 states have internal predecessors, (1880), 0 states have call successors, (0), 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 14:47:14,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 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 14:47:14,838 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 228.0) internal successors, (2280), 10 states have internal predecessors, (2280), 0 states have call successors, (0), 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 14:47:14,840 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 18 predicate places. [2023-12-09 14:47:14,840 INFO L500 AbstractCegarLoop]: Abstraction has has 228 places, 231 transitions, 998 flow [2023-12-09 14:47:14,841 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 0 states have call successors, (0), 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 14:47:14,841 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:14,842 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:14,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 14:47:15,046 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,SelfDestructingSolverStorable5 [2023-12-09 14:47:15,047 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:15,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1536100156, now seen corresponding path program 2 times [2023-12-09 14:47:15,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:15,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781946133] [2023-12-09 14:47:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781946133] [2023-12-09 14:47:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781946133] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691021170] [2023-12-09 14:47:15,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:47:15,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:15,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:15,278 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 14:47:15,310 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 14:47:15,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:47:15,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:15,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:47:15,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:15,590 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:15,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691021170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:15,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:15,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-12-09 14:47:15,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819764572] [2023-12-09 14:47:15,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:15,725 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 14:47:15,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:15,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 14:47:15,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-09 14:47:15,729 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:15,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 231 transitions, 998 flow. Second operand has 18 states, 18 states have (on average 207.5) internal successors, (3735), 18 states have internal predecessors, (3735), 0 states have call successors, (0), 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 14:47:15,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:15,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:15,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:16,274 INFO L124 PetriNetUnfolderBase]: 454/2521 cut-off events. [2023-12-09 14:47:16,274 INFO L125 PetriNetUnfolderBase]: For 4237/4297 co-relation queries the response was YES. [2023-12-09 14:47:16,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5426 conditions, 2521 events. 454/2521 cut-off events. For 4237/4297 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 11982 event pairs, 261 based on Foata normal form. 1/2439 useless extension candidates. Maximal degree in co-relation 4814. Up to 906 conditions per place. [2023-12-09 14:47:16,284 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 51 selfloop transitions, 21 changer transitions 10/267 dead transitions. [2023-12-09 14:47:16,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 267 transitions, 1546 flow [2023-12-09 14:47:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-09 14:47:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-09 14:47:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4374 transitions. [2023-12-09 14:47:16,291 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9135338345864662 [2023-12-09 14:47:16,291 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4374 transitions. [2023-12-09 14:47:16,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4374 transitions. [2023-12-09 14:47:16,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:16,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4374 transitions. [2023-12-09 14:47:16,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 208.28571428571428) internal successors, (4374), 21 states have internal predecessors, (4374), 0 states have call successors, (0), 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 14:47:16,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 228.0) internal successors, (5016), 22 states have internal predecessors, (5016), 0 states have call successors, (0), 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 14:47:16,308 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 228.0) internal successors, (5016), 22 states have internal predecessors, (5016), 0 states have call successors, (0), 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 14:47:16,309 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 38 predicate places. [2023-12-09 14:47:16,309 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 267 transitions, 1546 flow [2023-12-09 14:47:16,310 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 207.5) internal successors, (3735), 18 states have internal predecessors, (3735), 0 states have call successors, (0), 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 14:47:16,310 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:16,311 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:16,319 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 14:47:16,517 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:16,517 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:16,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1357434690, now seen corresponding path program 3 times [2023-12-09 14:47:16,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:16,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275903171] [2023-12-09 14:47:16,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:16,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 0 proven. 679 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:17,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:17,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275903171] [2023-12-09 14:47:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275903171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565268263] [2023-12-09 14:47:17,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 14:47:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:17,281 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 14:47:17,321 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 14:47:17,520 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-09 14:47:17,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:17,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-09 14:47:17,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:18,503 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 11 treesize of output 7 [2023-12-09 14:47:18,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:18,559 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 14:47:18,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:18,733 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 27 treesize of output 11 [2023-12-09 14:47:18,770 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 23 treesize of output 11 [2023-12-09 14:47:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 679 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 350 trivial. 0 not checked. [2023-12-09 14:47:18,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:47:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565268263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:18,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:47:18,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2023-12-09 14:47:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078910768] [2023-12-09 14:47:18,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:18,830 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-09 14:47:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:18,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-09 14:47:18,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2023-12-09 14:47:18,832 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-12-09 14:47:18,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 267 transitions, 1546 flow. Second operand has 13 states, 13 states have (on average 161.53846153846155) internal successors, (2100), 13 states have internal predecessors, (2100), 0 states have call successors, (0), 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 14:47:18,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:18,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-12-09 14:47:18,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:19,719 INFO L124 PetriNetUnfolderBase]: 1158/4647 cut-off events. [2023-12-09 14:47:19,719 INFO L125 PetriNetUnfolderBase]: For 12788/12931 co-relation queries the response was YES. [2023-12-09 14:47:19,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13497 conditions, 4647 events. 1158/4647 cut-off events. For 12788/12931 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 27423 event pairs, 96 based on Foata normal form. 1/4532 useless extension candidates. Maximal degree in co-relation 12432. Up to 1983 conditions per place. [2023-12-09 14:47:19,752 INFO L140 encePairwiseOnDemand]: 209/228 looper letters, 187 selfloop transitions, 26 changer transitions 13/386 dead transitions. [2023-12-09 14:47:19,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 386 transitions, 3592 flow [2023-12-09 14:47:19,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 14:47:19,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 14:47:19,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2131 transitions. [2023-12-09 14:47:19,755 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7189608636977058 [2023-12-09 14:47:19,755 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2131 transitions. [2023-12-09 14:47:19,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2131 transitions. [2023-12-09 14:47:19,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:19,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2131 transitions. [2023-12-09 14:47:19,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 163.92307692307693) internal successors, (2131), 13 states have internal predecessors, (2131), 0 states have call successors, (0), 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 14:47:19,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 228.0) internal successors, (3192), 14 states have internal predecessors, (3192), 0 states have call successors, (0), 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 14:47:19,824 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 228.0) internal successors, (3192), 14 states have internal predecessors, (3192), 0 states have call successors, (0), 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 14:47:19,825 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 50 predicate places. [2023-12-09 14:47:19,825 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 386 transitions, 3592 flow [2023-12-09 14:47:19,825 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 161.53846153846155) internal successors, (2100), 13 states have internal predecessors, (2100), 0 states have call successors, (0), 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 14:47:19,825 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:19,826 INFO L233 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:19,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-09 14:47:20,027 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:20,027 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:20,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash 483837613, now seen corresponding path program 1 times [2023-12-09 14:47:20,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:20,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623492321] [2023-12-09 14:47:20,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:20,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:20,578 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:20,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:20,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623492321] [2023-12-09 14:47:20,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623492321] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:20,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026960001] [2023-12-09 14:47:20,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:20,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:20,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:20,580 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 14:47:20,609 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 14:47:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:20,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-09 14:47:20,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:20,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 667 backedges. 0 proven. 667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:21,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026960001] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:21,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:21,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-12-09 14:47:21,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231534337] [2023-12-09 14:47:21,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:21,383 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-09 14:47:21,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-09 14:47:21,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-12-09 14:47:21,387 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:21,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 386 transitions, 3592 flow. Second operand has 34 states, 34 states have (on average 207.5) internal successors, (7055), 34 states have internal predecessors, (7055), 0 states have call successors, (0), 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 14:47:21,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:21,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:21,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:23,511 INFO L124 PetriNetUnfolderBase]: 2362/9179 cut-off events. [2023-12-09 14:47:23,511 INFO L125 PetriNetUnfolderBase]: For 30173/30369 co-relation queries the response was YES. [2023-12-09 14:47:23,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28434 conditions, 9179 events. 2362/9179 cut-off events. For 30173/30369 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 55043 event pairs, 136 based on Foata normal form. 2/9005 useless extension candidates. Maximal degree in co-relation 27316. Up to 4051 conditions per place. [2023-12-09 14:47:23,551 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 265 selfloop transitions, 45 changer transitions 13/546 dead transitions. [2023-12-09 14:47:23,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 546 transitions, 7014 flow [2023-12-09 14:47:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-09 14:47:23,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-12-09 14:47:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9362 transitions. [2023-12-09 14:47:23,565 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9124756335282651 [2023-12-09 14:47:23,565 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9362 transitions. [2023-12-09 14:47:23,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9362 transitions. [2023-12-09 14:47:23,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:23,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9362 transitions. [2023-12-09 14:47:23,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 208.04444444444445) internal successors, (9362), 45 states have internal predecessors, (9362), 0 states have call successors, (0), 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 14:47:23,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 228.0) internal successors, (10488), 46 states have internal predecessors, (10488), 0 states have call successors, (0), 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 14:47:23,592 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 228.0) internal successors, (10488), 46 states have internal predecessors, (10488), 0 states have call successors, (0), 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 14:47:23,592 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 94 predicate places. [2023-12-09 14:47:23,592 INFO L500 AbstractCegarLoop]: Abstraction has has 304 places, 546 transitions, 7014 flow [2023-12-09 14:47:23,594 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 207.5) internal successors, (7055), 34 states have internal predecessors, (7055), 0 states have call successors, (0), 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 14:47:23,594 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:23,594 INFO L233 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:23,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-09 14:47:23,802 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:23,802 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:23,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash -793582591, now seen corresponding path program 2 times [2023-12-09 14:47:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909370568] [2023-12-09 14:47:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:23,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:25,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 0 proven. 3347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:25,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:25,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909370568] [2023-12-09 14:47:25,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909370568] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:25,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229823299] [2023-12-09 14:47:25,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:47:25,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:25,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:25,161 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 14:47:25,162 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 14:47:25,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:47:25,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:25,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-09 14:47:25,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 0 proven. 3347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:25,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3347 backedges. 0 proven. 3347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:26,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229823299] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:26,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:26,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 43 [2023-12-09 14:47:26,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112088646] [2023-12-09 14:47:26,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:26,770 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-12-09 14:47:26,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:26,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-12-09 14:47:26,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2023-12-09 14:47:26,778 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:26,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 546 transitions, 7014 flow. Second operand has 43 states, 43 states have (on average 207.5581395348837) internal successors, (8925), 43 states have internal predecessors, (8925), 0 states have call successors, (0), 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 14:47:26,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:26,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:26,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:30,536 INFO L124 PetriNetUnfolderBase]: 3114/11978 cut-off events. [2023-12-09 14:47:30,536 INFO L125 PetriNetUnfolderBase]: For 47511/47750 co-relation queries the response was YES. [2023-12-09 14:47:30,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39309 conditions, 11978 events. 3114/11978 cut-off events. For 47511/47750 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 71949 event pairs, 176 based on Foata normal form. 1/11763 useless extension candidates. Maximal degree in co-relation 38145. Up to 5346 conditions per place. [2023-12-09 14:47:30,615 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 349 selfloop transitions, 60 changer transitions 14/646 dead transitions. [2023-12-09 14:47:30,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 646 transitions, 9792 flow [2023-12-09 14:47:30,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-09 14:47:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-12-09 14:47:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 12474 transitions. [2023-12-09 14:47:30,626 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9118421052631579 [2023-12-09 14:47:30,627 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 12474 transitions. [2023-12-09 14:47:30,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 12474 transitions. [2023-12-09 14:47:30,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:30,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 12474 transitions. [2023-12-09 14:47:30,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 207.9) internal successors, (12474), 60 states have internal predecessors, (12474), 0 states have call successors, (0), 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 14:47:30,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 228.0) internal successors, (13908), 61 states have internal predecessors, (13908), 0 states have call successors, (0), 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 14:47:30,660 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 228.0) internal successors, (13908), 61 states have internal predecessors, (13908), 0 states have call successors, (0), 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 14:47:30,661 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 153 predicate places. [2023-12-09 14:47:30,661 INFO L500 AbstractCegarLoop]: Abstraction has has 363 places, 646 transitions, 9792 flow [2023-12-09 14:47:30,663 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 207.5581395348837) internal successors, (8925), 43 states have internal predecessors, (8925), 0 states have call successors, (0), 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 14:47:30,663 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:30,663 INFO L233 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:30,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 14:47:30,869 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:30,870 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:30,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash -289855929, now seen corresponding path program 3 times [2023-12-09 14:47:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:30,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342824938] [2023-12-09 14:47:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6046 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2023-12-09 14:47:34,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:34,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342824938] [2023-12-09 14:47:34,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342824938] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:34,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:34,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 14:47:34,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209139957] [2023-12-09 14:47:34,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:34,405 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 14:47:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 14:47:34,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2023-12-09 14:47:34,408 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 228 [2023-12-09 14:47:34,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 646 transitions, 9792 flow. Second operand has 16 states, 16 states have (on average 144.0625) internal successors, (2305), 16 states have internal predecessors, (2305), 0 states have call successors, (0), 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 14:47:34,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:34,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 228 [2023-12-09 14:47:34,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:38,116 INFO L124 PetriNetUnfolderBase]: 3087/11823 cut-off events. [2023-12-09 14:47:38,117 INFO L125 PetriNetUnfolderBase]: For 53099/53452 co-relation queries the response was YES. [2023-12-09 14:47:38,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46027 conditions, 11823 events. 3087/11823 cut-off events. For 53099/53452 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 70367 event pairs, 150 based on Foata normal form. 1/11608 useless extension candidates. Maximal degree in co-relation 44680. Up to 7175 conditions per place. [2023-12-09 14:47:38,166 INFO L140 encePairwiseOnDemand]: 207/228 looper letters, 430 selfloop transitions, 25 changer transitions 16/670 dead transitions. [2023-12-09 14:47:38,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 670 transitions, 10905 flow [2023-12-09 14:47:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-09 14:47:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-12-09 14:47:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2327 transitions. [2023-12-09 14:47:38,168 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6378837719298246 [2023-12-09 14:47:38,168 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2327 transitions. [2023-12-09 14:47:38,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2327 transitions. [2023-12-09 14:47:38,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:38,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2327 transitions. [2023-12-09 14:47:38,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 145.4375) internal successors, (2327), 16 states have internal predecessors, (2327), 0 states have call successors, (0), 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 14:47:38,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 228.0) internal successors, (3876), 17 states have internal predecessors, (3876), 0 states have call successors, (0), 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 14:47:38,174 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 228.0) internal successors, (3876), 17 states have internal predecessors, (3876), 0 states have call successors, (0), 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 14:47:38,174 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 168 predicate places. [2023-12-09 14:47:38,174 INFO L500 AbstractCegarLoop]: Abstraction has has 378 places, 670 transitions, 10905 flow [2023-12-09 14:47:38,175 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 144.0625) internal successors, (2305), 16 states have internal predecessors, (2305), 0 states have call successors, (0), 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 14:47:38,175 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:38,175 INFO L233 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:47:38,175 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-09 14:47:38,176 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:47:38,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1051764564, now seen corresponding path program 4 times [2023-12-09 14:47:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:38,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620750925] [2023-12-09 14:47:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:38,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3321 proven. 229 refuted. 0 times theorem prover too weak. 2530 trivial. 0 not checked. [2023-12-09 14:47:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:41,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620750925] [2023-12-09 14:47:41,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620750925] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:41,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55957462] [2023-12-09 14:47:41,304 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 14:47:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:41,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:41,309 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:47:41,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 14:47:49,697 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 14:47:49,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:49,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 1658 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-09 14:47:49,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:51,350 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 11 treesize of output 7 [2023-12-09 14:47:51,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:51,419 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 14:47:51,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:51,584 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 27 treesize of output 11 [2023-12-09 14:47:51,623 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 23 treesize of output 11 [2023-12-09 14:47:51,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 19 treesize of output 11 [2023-12-09 14:47:51,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:51,820 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 14:47:51,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:51,923 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 27 treesize of output 11 [2023-12-09 14:47:51,936 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 23 treesize of output 11 [2023-12-09 14:47:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3411 proven. 351 refuted. 0 times theorem prover too weak. 2318 trivial. 0 not checked. [2023-12-09 14:47:51,986 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:52,316 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20))))) is different from false [2023-12-09 14:47:52,376 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) is different from false [2023-12-09 14:47:52,384 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1)))))) is different from false [2023-12-09 14:47:52,393 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1))) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) is different from false [2023-12-09 14:47:52,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int)) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 20))))) is different from false [2023-12-09 14:47:52,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) is different from false [2023-12-09 14:47:52,474 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse1) 20)) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|)))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147|)))) is different from false [2023-12-09 14:47:52,500 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147|) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse3))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|))))) is different from false [2023-12-09 14:47:52,685 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| Int) (v_ArrVal_1536 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| Int) (v_ArrVal_1540 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_111| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1536) |c_~#queue~0.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1540) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_111|) .cse1) 20)) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_147|) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_143|))))) is different from false [2023-12-09 14:47:52,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:47:52,760 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 205 treesize of output 145 [2023-12-09 14:47:52,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:47:52,783 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 229 treesize of output 227 [2023-12-09 14:47:52,791 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 93 treesize of output 85 [2023-12-09 14:47:52,798 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 9 [2023-12-09 14:47:52,829 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 8 treesize of output 4 [2023-12-09 14:47:52,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:47:52,876 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 85 treesize of output 77 [2023-12-09 14:47:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6080 backedges. 3047 proven. 282 refuted. 0 times theorem prover too weak. 2372 trivial. 379 not checked. [2023-12-09 14:47:53,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55957462] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:53,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:53,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 22] total 58 [2023-12-09 14:47:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162862642] [2023-12-09 14:47:53,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:53,360 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-09 14:47:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-09 14:47:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=2018, Unknown=9, NotChecked=918, Total=3306 [2023-12-09 14:47:53,366 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-12-09 14:47:53,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 670 transitions, 10905 flow. Second operand has 58 states, 58 states have (on average 160.5) internal successors, (9309), 58 states have internal predecessors, (9309), 0 states have call successors, (0), 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 14:47:53,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:53,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-12-09 14:47:53,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:48:04,610 INFO L124 PetriNetUnfolderBase]: 6902/25045 cut-off events. [2023-12-09 14:48:04,611 INFO L125 PetriNetUnfolderBase]: For 141676/142171 co-relation queries the response was YES. [2023-12-09 14:48:04,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113907 conditions, 25045 events. 6902/25045 cut-off events. For 141676/142171 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 180395 event pairs, 133 based on Foata normal form. 0/24790 useless extension candidates. Maximal degree in co-relation 111384. Up to 14692 conditions per place. [2023-12-09 14:48:04,732 INFO L140 encePairwiseOnDemand]: 204/228 looper letters, 974 selfloop transitions, 118 changer transitions 22/1325 dead transitions. [2023-12-09 14:48:04,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 1325 transitions, 28300 flow [2023-12-09 14:48:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-09 14:48:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-12-09 14:48:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5370 transitions. [2023-12-09 14:48:04,737 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7137161084529505 [2023-12-09 14:48:04,737 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5370 transitions. [2023-12-09 14:48:04,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5370 transitions. [2023-12-09 14:48:04,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:48:04,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5370 transitions. [2023-12-09 14:48:04,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 162.72727272727272) internal successors, (5370), 33 states have internal predecessors, (5370), 0 states have call successors, (0), 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 14:48:04,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 228.0) internal successors, (7752), 34 states have internal predecessors, (7752), 0 states have call successors, (0), 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 14:48:04,747 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 228.0) internal successors, (7752), 34 states have internal predecessors, (7752), 0 states have call successors, (0), 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 14:48:04,747 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 200 predicate places. [2023-12-09 14:48:04,747 INFO L500 AbstractCegarLoop]: Abstraction has has 410 places, 1325 transitions, 28300 flow [2023-12-09 14:48:04,749 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 160.5) internal successors, (9309), 58 states have internal predecessors, (9309), 0 states have call successors, (0), 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 14:48:04,749 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:48:04,749 INFO L233 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:48:04,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-09 14:48:04,959 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:48:04,959 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-12-09 14:48:04,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:48:04,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1885775990, now seen corresponding path program 5 times [2023-12-09 14:48:04,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:48:04,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146932] [2023-12-09 14:48:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:48:04,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:48:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:48:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6296 backedges. 2151 proven. 765 refuted. 0 times theorem prover too weak. 3380 trivial. 0 not checked. [2023-12-09 14:48:10,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:48:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146932] [2023-12-09 14:48:10,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146932] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:48:10,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103737246] [2023-12-09 14:48:10,743 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 14:48:10,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:48:10,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:48:10,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 14:48:10,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 14:48:29,272 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2023-12-09 14:48:29,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:48:29,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 256 conjunts are in the unsatisfiable core [2023-12-09 14:48:29,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:48:29,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 32 treesize of output 16 [2023-12-09 14:48:29,529 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-12-09 14:48:29,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 34 treesize of output 28 [2023-12-09 14:48:29,801 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:29,812 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-09 14:48:29,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 56 [2023-12-09 14:48:29,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:29,868 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 44 treesize of output 28 [2023-12-09 14:48:30,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 34 [2023-12-09 14:48:30,257 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-12-09 14:48:30,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 58 treesize of output 46 [2023-12-09 14:48:30,734 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:30,743 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-09 14:48:30,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 75 [2023-12-09 14:48:30,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:30,822 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 69 treesize of output 47 [2023-12-09 14:48:30,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 13 [2023-12-09 14:48:31,023 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-12-09 14:48:31,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 33 treesize of output 27 [2023-12-09 14:48:31,399 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:31,408 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-12-09 14:48:31,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2023-12-09 14:48:31,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:31,469 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 54 treesize of output 38 [2023-12-09 14:48:31,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 44 [2023-12-09 14:48:31,906 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-12-09 14:48:31,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 68 treesize of output 56 [2023-12-09 14:48:32,286 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:32,296 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-09 14:48:32,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-12-09 14:48:32,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:32,356 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 54 treesize of output 38 [2023-12-09 14:48:32,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 44 [2023-12-09 14:48:32,802 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-12-09 14:48:32,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 68 treesize of output 56 [2023-12-09 14:48:33,211 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:33,220 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-09 14:48:33,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-12-09 14:48:33,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:33,283 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 54 treesize of output 38 [2023-12-09 14:48:33,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 66 treesize of output 44 [2023-12-09 14:48:33,764 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2023-12-09 14:48:33,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 68 treesize of output 56 [2023-12-09 14:48:34,221 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:34,230 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-12-09 14:48:34,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 66 [2023-12-09 14:48:34,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:34,284 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 54 treesize of output 38 [2023-12-09 14:48:34,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 23 treesize of output 13 [2023-12-09 14:48:34,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:34,570 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 33 treesize of output 13 [2023-12-09 14:48:34,985 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:35,047 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-12-09 14:48:35,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-12-09 14:48:35,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:35,092 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 29 treesize of output 13 [2023-12-09 14:48:35,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 3 [2023-12-09 14:48:35,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:35,446 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 33 treesize of output 13 [2023-12-09 14:48:35,898 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:35,905 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-12-09 14:48:35,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-12-09 14:48:35,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:35,950 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 29 treesize of output 13 [2023-12-09 14:48:36,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 15 [2023-12-09 14:48:36,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:36,316 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 33 treesize of output 13 [2023-12-09 14:48:36,789 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:48:36,796 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2023-12-09 14:48:36,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 16 [2023-12-09 14:48:36,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:36,832 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 29 treesize of output 13 [2023-12-09 14:48:37,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 15 [2023-12-09 14:48:37,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:48:37,226 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 43 treesize of output 13 [2023-12-09 14:48:37,470 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-12-09 14:48:37,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 42 treesize of output 16 [2023-12-09 14:48:37,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 29 treesize of output 13 [2023-12-09 14:48:37,483 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 19 treesize of output 7 [2023-12-09 14:48:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6296 backedges. 4429 proven. 837 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2023-12-09 14:48:37,532 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-09 14:51:32,300 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 14:51:32,309 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 14:51:33,214 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-12-09 14:51:33,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-09 14:51:33,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:33,414 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-09 14:51:33,415 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 150 known predicates. [2023-12-09 14:51:33,416 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:51:33,416 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-12-09 14:51:33,416 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-12-09 14:51:33,416 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:51:33,417 INFO L457 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1] [2023-12-09 14:51:33,420 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 14:51:33,420 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 14:51:33,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:51:33 BasicIcfg [2023-12-09 14:51:33,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 14:51:33,430 INFO L158 Benchmark]: Toolchain (without parser) took 264290.21ms. Allocated memory was 267.4MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 229.2MB in the beginning and 1.1GB in the end (delta: -882.1MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-12-09 14:51:33,430 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 14:51:33,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.46ms. Allocated memory is still 267.4MB. Free memory was 229.2MB in the beginning and 198.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-09 14:51:33,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.98ms. Allocated memory is still 267.4MB. Free memory was 198.8MB in the beginning and 195.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-09 14:51:33,430 INFO L158 Benchmark]: Boogie Preprocessor took 25.36ms. Allocated memory is still 267.4MB. Free memory was 195.6MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 14:51:33,430 INFO L158 Benchmark]: RCFGBuilder took 553.07ms. Allocated memory is still 267.4MB. Free memory was 193.6MB in the beginning and 169.9MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-09 14:51:33,431 INFO L158 Benchmark]: TraceAbstraction took 263225.50ms. Allocated memory was 267.4MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 169.4MB in the beginning and 1.1GB in the end (delta: -941.8MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2023-12-09 14:51:33,431 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 198.2MB. Free memory is still 147.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.46ms. Allocated memory is still 267.4MB. Free memory was 229.2MB in the beginning and 198.8MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.98ms. Allocated memory is still 267.4MB. Free memory was 198.8MB in the beginning and 195.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.36ms. Allocated memory is still 267.4MB. Free memory was 195.6MB in the beginning and 193.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 553.07ms. Allocated memory is still 267.4MB. Free memory was 193.6MB in the beginning and 169.9MB in the end (delta: 23.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 263225.50ms. Allocated memory was 267.4MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 169.4MB in the beginning and 1.1GB in the end (delta: -941.8MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 150 known predicates. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 150 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 150 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 823 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 150 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 locations, 5 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: 263.0s, OverallIterations: 13, TraceHistogramMax: 20, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1667 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1667 mSDsluCounter, 1323 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2218 IncrementalHoareTripleChecker+Unchecked, 1120 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4427 IncrementalHoareTripleChecker+Invalid, 6740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 203 mSDtfsCounter, 4427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5260 GetRequests, 4865 SyntacticMatches, 50 SemanticMatches, 345 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 5601 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28300occurred in iteration=12, InterpolantAutomatonStates: 220, 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.4s SsaConstructionTime, 9.1s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 6586 NumberOfCodeBlocks, 6426 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 8744 ConstructedInterpolants, 58 QuantifiedInterpolants, 32308 SizeOfPredicates, 97 NumberOfNonLiveVariables, 5435 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 23725/37988 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