/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_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 14:47:07,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 14:47:07,469 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,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 14:47:07,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 14:47:07,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 14:47:07,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 14:47:07,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 14:47:07,494 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 14:47:07,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 14:47:07,498 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 14:47:07,498 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 14:47:07,498 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 14:47:07,499 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 14:47:07,499 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 14:47:07,499 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 14:47:07,499 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 14:47:07,499 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 14:47:07,499 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 14:47:07,500 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 14:47:07,500 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 14:47:07,500 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 14:47:07,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 14:47:07,501 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 14:47:07,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 14:47:07,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:47:07,501 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 14:47:07,501 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 14:47:07,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 14:47:07,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 14:47:07,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 14:47:07,502 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 14:47:07,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 14:47:07,503 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,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 14:47:07,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 14:47:07,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 14:47:07,718 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 14:47:07,719 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 14:47:07,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-12-09 14:47:08,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 14:47:09,241 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 14:47:09,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-12-09 14:47:09,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f529094/d8da54c351174af2912e6c6d3318f526/FLAG21e120be3 [2023-12-09 14:47:09,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f529094/d8da54c351174af2912e6c6d3318f526 [2023-12-09 14:47:09,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 14:47:09,304 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 14:47:09,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 14:47:09,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 14:47:09,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 14:47:09,310 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,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d98bd5 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,325 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,380 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 14:47:09,786 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_longest.i[43280,43293] [2023-12-09 14:47:09,792 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_longest.i[43553,43566] [2023-12-09 14:47:09,795 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:47:09,803 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 14:47:09,915 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_longest.i[43280,43293] [2023-12-09 14:47:09,917 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_longest.i[43553,43566] [2023-12-09 14:47:09,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 14:47:09,994 INFO L206 MainTranslator]: Completed translation [2023-12-09 14:47:09,994 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,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 14:47:09,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 14:47:09,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 14:47:09,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 14:47:09,999 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:10,023 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:10,044 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2023-12-09 14:47:10,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 14:47:10,045 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 14:47:10,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 14:47:10,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 14:47:10,050 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:10,050 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:10,054 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:10,054 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:10,062 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:10,064 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:10,066 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:10,066 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:10,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 14:47:10,069 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 14:47:10,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 14:47:10,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 14:47:10,070 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:10,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 14:47:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:10,095 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:10,107 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:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-12-09 14:47:10,169 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-12-09 14:47:10,169 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-12-09 14:47:10,170 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 14:47:10,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 14:47:10,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 14:47:10,171 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:10,274 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 14:47:10,276 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 14:47:10,534 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 14:47:10,568 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 14:47:10,571 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-09 14:47:10,573 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,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 14:47:10,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 14:47:10,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 14:47:10,580 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 14:47:10,581 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,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4d391f 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,581 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,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4d391f 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,584 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,585 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-12-09 14:47:10,598 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 14:47:10,598 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-09 14:47:10,598 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 14:47:10,693 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 14:47:10,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 470 flow [2023-12-09 14:47:10,803 INFO L124 PetriNetUnfolderBase]: 13/226 cut-off events. [2023-12-09 14:47:10,803 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 14:47:10,810 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,810 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 470 flow [2023-12-09 14:47:10,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 216 transitions, 441 flow [2023-12-09 14:47:10,822 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 14:47:10,826 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;@1481bf9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 14:47:10,826 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-09 14:47:10,840 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 14:47:10,841 INFO L124 PetriNetUnfolderBase]: 1/58 cut-off events. [2023-12-09 14:47:10,841 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 14:47:10,841 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:10,841 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,842 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,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:10,845 INFO L85 PathProgramCache]: Analyzing trace with hash -484014062, now seen corresponding path program 1 times [2023-12-09 14:47:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:10,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153169272] [2023-12-09 14:47:10,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:10,851 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,007 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,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:11,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153169272] [2023-12-09 14:47:11,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153169272] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:11,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:11,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-09 14:47:11,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970028806] [2023-12-09 14:47:11,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:11,014 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-09 14:47:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:11,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-09 14:47:11,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-09 14:47:11,066 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 228 [2023-12-09 14:47:11,069 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:11,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:11,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 228 [2023-12-09 14:47:11,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:11,166 INFO L124 PetriNetUnfolderBase]: 26/374 cut-off events. [2023-12-09 14:47:11,166 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-12-09 14:47:11,169 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:11,171 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 7 selfloop transitions, 0 changer transitions 3/207 dead transitions. [2023-12-09 14:47:11,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 207 transitions, 437 flow [2023-12-09 14:47:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-09 14:47:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-12-09 14:47:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 437 transitions. [2023-12-09 14:47:11,181 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2023-12-09 14:47:11,182 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 437 transitions. [2023-12-09 14:47:11,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 437 transitions. [2023-12-09 14:47:11,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:11,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 437 transitions. [2023-12-09 14:47:11,188 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:11,192 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:11,193 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:11,196 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, -4 predicate places. [2023-12-09 14:47:11,196 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 207 transitions, 437 flow [2023-12-09 14:47:11,196 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:11,196 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:11,197 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:11,197 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 14:47:11,197 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:11,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:11,198 INFO L85 PathProgramCache]: Analyzing trace with hash 559808428, now seen corresponding path program 1 times [2023-12-09 14:47:11,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:11,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254314902] [2023-12-09 14:47:11,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:11,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:12,284 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,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:12,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254314902] [2023-12-09 14:47:12,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254314902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:12,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:12,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-09 14:47:12,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071759352] [2023-12-09 14:47:12,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:12,286 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-09 14:47:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:12,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-09 14:47:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-09 14:47:12,296 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-12-09 14:47:12,300 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:12,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:12,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-12-09 14:47:12,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:13,127 INFO L124 PetriNetUnfolderBase]: 841/3185 cut-off events. [2023-12-09 14:47:13,127 INFO L125 PetriNetUnfolderBase]: For 287/289 co-relation queries the response was YES. [2023-12-09 14:47:13,148 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:13,158 INFO L140 encePairwiseOnDemand]: 211/228 looper letters, 46 selfloop transitions, 16 changer transitions 0/203 dead transitions. [2023-12-09 14:47:13,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 203 transitions, 553 flow [2023-12-09 14:47:13,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 14:47:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 14:47:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1923 transitions. [2023-12-09 14:47:13,170 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7028508771929824 [2023-12-09 14:47:13,170 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1923 transitions. [2023-12-09 14:47:13,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1923 transitions. [2023-12-09 14:47:13,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:13,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1923 transitions. [2023-12-09 14:47:13,181 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:13,188 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:13,189 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:13,190 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 4 predicate places. [2023-12-09 14:47:13,190 INFO L500 AbstractCegarLoop]: Abstraction has has 214 places, 203 transitions, 553 flow [2023-12-09 14:47:13,191 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:13,191 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:13,191 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:13,191 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 14:47:13,191 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:13,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:13,192 INFO L85 PathProgramCache]: Analyzing trace with hash 348938573, now seen corresponding path program 1 times [2023-12-09 14:47:13,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:13,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703624108] [2023-12-09 14:47:13,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:13,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:13,359 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,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:13,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703624108] [2023-12-09 14:47:13,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703624108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:13,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:13,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:47:13,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480528540] [2023-12-09 14:47:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:13,361 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:47:13,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:47:13,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:47:13,363 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 228 [2023-12-09 14:47:13,363 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:13,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:13,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 228 [2023-12-09 14:47:13,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:13,597 INFO L124 PetriNetUnfolderBase]: 306/1259 cut-off events. [2023-12-09 14:47:13,598 INFO L125 PetriNetUnfolderBase]: For 747/783 co-relation queries the response was YES. [2023-12-09 14:47:13,601 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,620 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 12 selfloop transitions, 2 changer transitions 9/209 dead transitions. [2023-12-09 14:47:13,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 629 flow [2023-12-09 14:47:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:47:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:47:13,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 641 transitions. [2023-12-09 14:47:13,625 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9371345029239766 [2023-12-09 14:47:13,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 641 transitions. [2023-12-09 14:47:13,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 641 transitions. [2023-12-09 14:47:13,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:13,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 641 transitions. [2023-12-09 14:47:13,627 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,630 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,630 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,632 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 6 predicate places. [2023-12-09 14:47:13,633 INFO L500 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 629 flow [2023-12-09 14:47:13,633 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,633 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:13,634 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,634 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 14:47:13,634 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,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:13,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1606788658, now seen corresponding path program 1 times [2023-12-09 14:47:13,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:13,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844859959] [2023-12-09 14:47:13,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:13,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:13,733 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,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:13,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844859959] [2023-12-09 14:47:13,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844859959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:13,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 14:47:13,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 14:47:13,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971145602] [2023-12-09 14:47:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:13,739 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:47:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:13,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:47:13,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 14:47:13,742 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-12-09 14:47:13,742 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,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:13,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-12-09 14:47:13,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:13,946 INFO L124 PetriNetUnfolderBase]: 447/1756 cut-off events. [2023-12-09 14:47:13,946 INFO L125 PetriNetUnfolderBase]: For 2178/2255 co-relation queries the response was YES. [2023-12-09 14:47:13,949 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,953 INFO L140 encePairwiseOnDemand]: 225/228 looper letters, 21 selfloop transitions, 2 changer transitions 6/216 dead transitions. [2023-12-09 14:47:13,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 718 flow [2023-12-09 14:47:13,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:47:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:47:13,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2023-12-09 14:47:13,955 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.935672514619883 [2023-12-09 14:47:13,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2023-12-09 14:47:13,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2023-12-09 14:47:13,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:13,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2023-12-09 14:47:13,957 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,958 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,959 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,961 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 8 predicate places. [2023-12-09 14:47:13,961 INFO L500 AbstractCegarLoop]: Abstraction has has 218 places, 216 transitions, 718 flow [2023-12-09 14:47:13,961 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,962 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:13,962 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,962 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 14:47:13,962 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,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:13,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1287457348, now seen corresponding path program 1 times [2023-12-09 14:47:13,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:13,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318111695] [2023-12-09 14:47:13,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:13,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:14,105 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,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:14,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318111695] [2023-12-09 14:47:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318111695] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:14,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873304231] [2023-12-09 14:47:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:14,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:14,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:14,123 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:14,155 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:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:14,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-09 14:47:14,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:14,315 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:14,355 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:14,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:47:14,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873304231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:14,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:47:14,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-09 14:47:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168676443] [2023-12-09 14:47:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:14,357 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 14:47:14,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:14,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 14:47:14,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 14:47:14,358 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 228 [2023-12-09 14:47:14,358 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:14,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:14,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 228 [2023-12-09 14:47:14,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:14,505 INFO L124 PetriNetUnfolderBase]: 201/1116 cut-off events. [2023-12-09 14:47:14,505 INFO L125 PetriNetUnfolderBase]: For 1887/1912 co-relation queries the response was YES. [2023-12-09 14:47:14,507 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,509 INFO L140 encePairwiseOnDemand]: 224/228 looper letters, 15 selfloop transitions, 3 changer transitions 10/218 dead transitions. [2023-12-09 14:47:14,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 218 transitions, 798 flow [2023-12-09 14:47:14,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 14:47:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 14:47:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2023-12-09 14:47:14,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9298245614035088 [2023-12-09 14:47:14,511 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2023-12-09 14:47:14,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2023-12-09 14:47:14,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:14,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2023-12-09 14:47:14,514 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,515 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,515 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,517 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 10 predicate places. [2023-12-09 14:47:14,519 INFO L500 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 798 flow [2023-12-09 14:47:14,520 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,523 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:14,523 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,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 14:47:14,729 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,730 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,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:14,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1206536814, now seen corresponding path program 1 times [2023-12-09 14:47:14,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:14,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859921792] [2023-12-09 14:47:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:14,842 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,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:14,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859921792] [2023-12-09 14:47:14,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859921792] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:14,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469172332] [2023-12-09 14:47:14,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:14,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:14,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:14,851 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,851 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,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:14,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 14:47:14,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:15,082 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:15,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:15,166 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:15,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469172332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:15,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:15,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 14:47:15,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109438413] [2023-12-09 14:47:15,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:15,167 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 14:47:15,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:15,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 14:47:15,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 14:47:15,169 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:15,170 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:15,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:15,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:15,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:15,580 INFO L124 PetriNetUnfolderBase]: 254/1403 cut-off events. [2023-12-09 14:47:15,580 INFO L125 PetriNetUnfolderBase]: For 2153/2196 co-relation queries the response was YES. [2023-12-09 14:47:15,583 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:15,586 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 27 selfloop transitions, 9 changer transitions 10/231 dead transitions. [2023-12-09 14:47:15,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 231 transitions, 998 flow [2023-12-09 14:47:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 14:47:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 14:47:15,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1880 transitions. [2023-12-09 14:47:15,603 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9161793372319688 [2023-12-09 14:47:15,603 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1880 transitions. [2023-12-09 14:47:15,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1880 transitions. [2023-12-09 14:47:15,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:15,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1880 transitions. [2023-12-09 14:47:15,606 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:15,608 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:15,610 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:15,612 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 18 predicate places. [2023-12-09 14:47:15,612 INFO L500 AbstractCegarLoop]: Abstraction has has 228 places, 231 transitions, 998 flow [2023-12-09 14:47:15,613 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:15,613 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:15,613 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:15,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 14:47:15,813 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,814 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,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1536100156, now seen corresponding path program 2 times [2023-12-09 14:47:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903815266] [2023-12-09 14:47:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:16,074 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:16,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903815266] [2023-12-09 14:47:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903815266] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:16,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086182348] [2023-12-09 14:47:16,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:47:16,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:16,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:16,076 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:16,110 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:16,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:47:16,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:16,255 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 14:47:16,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:16,376 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:16,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:16,516 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:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086182348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:16,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-12-09 14:47:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101256087] [2023-12-09 14:47:16,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:16,517 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 14:47:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:16,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 14:47:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-09 14:47:16,520 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:16,523 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:16,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:16,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:16,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:16,994 INFO L124 PetriNetUnfolderBase]: 454/2521 cut-off events. [2023-12-09 14:47:16,994 INFO L125 PetriNetUnfolderBase]: For 4237/4297 co-relation queries the response was YES. [2023-12-09 14:47:16,998 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:17,003 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 51 selfloop transitions, 21 changer transitions 10/267 dead transitions. [2023-12-09 14:47:17,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 267 transitions, 1546 flow [2023-12-09 14:47:17,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-09 14:47:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-12-09 14:47:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4374 transitions. [2023-12-09 14:47:17,010 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9135338345864662 [2023-12-09 14:47:17,011 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4374 transitions. [2023-12-09 14:47:17,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4374 transitions. [2023-12-09 14:47:17,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:17,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4374 transitions. [2023-12-09 14:47:17,018 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:17,024 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:17,026 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:17,026 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 38 predicate places. [2023-12-09 14:47:17,026 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 267 transitions, 1546 flow [2023-12-09 14:47:17,028 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:17,028 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:17,028 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:17,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-09 14:47:17,235 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:17,236 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:17,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:17,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1357434690, now seen corresponding path program 3 times [2023-12-09 14:47:17,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:17,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205845283] [2023-12-09 14:47:17,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:17,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:17,695 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,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205845283] [2023-12-09 14:47:17,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205845283] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:17,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001320197] [2023-12-09 14:47:17,696 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 14:47:17,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:17,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:17,697 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,724 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,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-09 14:47:17,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:17,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-09 14:47:17,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:18,992 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:19,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:19,052 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:19,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:19,253 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:19,322 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:19,381 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:19,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 14:47:19,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001320197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 14:47:19,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 14:47:19,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 28 [2023-12-09 14:47:19,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114771878] [2023-12-09 14:47:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 14:47:19,382 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-09 14:47:19,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:19,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-09 14:47:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2023-12-09 14:47:19,384 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 228 [2023-12-09 14:47:19,385 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:19,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:19,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 228 [2023-12-09 14:47:19,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:20,474 INFO L124 PetriNetUnfolderBase]: 1158/4647 cut-off events. [2023-12-09 14:47:20,475 INFO L125 PetriNetUnfolderBase]: For 12788/12931 co-relation queries the response was YES. [2023-12-09 14:47:20,489 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:20,507 INFO L140 encePairwiseOnDemand]: 209/228 looper letters, 187 selfloop transitions, 26 changer transitions 13/386 dead transitions. [2023-12-09 14:47:20,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 386 transitions, 3592 flow [2023-12-09 14:47:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 14:47:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 14:47:20,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2131 transitions. [2023-12-09 14:47:20,511 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7189608636977058 [2023-12-09 14:47:20,511 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2131 transitions. [2023-12-09 14:47:20,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2131 transitions. [2023-12-09 14:47:20,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:20,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2131 transitions. [2023-12-09 14:47:20,514 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:20,576 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:20,577 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:20,577 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 50 predicate places. [2023-12-09 14:47:20,577 INFO L500 AbstractCegarLoop]: Abstraction has has 260 places, 386 transitions, 3592 flow [2023-12-09 14:47:20,578 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:20,578 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:20,578 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:20,586 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,783 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,784 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,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:20,784 INFO L85 PathProgramCache]: Analyzing trace with hash 483837613, now seen corresponding path program 1 times [2023-12-09 14:47:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539922299] [2023-12-09 14:47:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:20,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:21,178 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,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539922299] [2023-12-09 14:47:21,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539922299] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:21,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956174082] [2023-12-09 14:47:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:21,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:21,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:21,193 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:21,251 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:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:21,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-09 14:47:21,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:21,665 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,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:22,095 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:22,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956174082] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:22,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:22,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2023-12-09 14:47:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843615010] [2023-12-09 14:47:22,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:22,096 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-09 14:47:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:22,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-09 14:47:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2023-12-09 14:47:22,102 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:22,106 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:22,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:22,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:22,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:24,373 INFO L124 PetriNetUnfolderBase]: 2362/9179 cut-off events. [2023-12-09 14:47:24,373 INFO L125 PetriNetUnfolderBase]: For 30173/30369 co-relation queries the response was YES. [2023-12-09 14:47:24,393 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:24,428 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 265 selfloop transitions, 45 changer transitions 13/546 dead transitions. [2023-12-09 14:47:24,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 546 transitions, 7014 flow [2023-12-09 14:47:24,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-09 14:47:24,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-12-09 14:47:24,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9362 transitions. [2023-12-09 14:47:24,442 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9124756335282651 [2023-12-09 14:47:24,442 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9362 transitions. [2023-12-09 14:47:24,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9362 transitions. [2023-12-09 14:47:24,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:24,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9362 transitions. [2023-12-09 14:47:24,463 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:24,474 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:24,476 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:24,477 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 94 predicate places. [2023-12-09 14:47:24,477 INFO L500 AbstractCegarLoop]: Abstraction has has 304 places, 546 transitions, 7014 flow [2023-12-09 14:47:24,478 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:24,478 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:24,478 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:24,483 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:24,683 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:24,683 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:24,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:24,684 INFO L85 PathProgramCache]: Analyzing trace with hash -793582591, now seen corresponding path program 2 times [2023-12-09 14:47:24,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:24,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187622586] [2023-12-09 14:47:24,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:24,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:26,191 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,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:26,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187622586] [2023-12-09 14:47:26,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187622586] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:26,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5222826] [2023-12-09 14:47:26,192 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 14:47:26,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:26,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:26,208 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:26,247 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:26,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 14:47:26,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:26,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 1318 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-09 14:47:26,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:27,038 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:27,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:28,092 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:28,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5222826] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:28,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:28,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2023-12-09 14:47:28,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868290346] [2023-12-09 14:47:28,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:28,094 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-09 14:47:28,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:28,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-09 14:47:28,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2023-12-09 14:47:28,105 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:47:28,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 546 transitions, 7014 flow. Second operand has 66 states, 66 states have (on average 207.5) internal successors, (13695), 66 states have internal predecessors, (13695), 0 states have call successors, (0), 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:28,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:28,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:47:28,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:47:36,174 INFO L124 PetriNetUnfolderBase]: 4771/18235 cut-off events. [2023-12-09 14:47:36,174 INFO L125 PetriNetUnfolderBase]: For 71471/71749 co-relation queries the response was YES. [2023-12-09 14:47:36,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59829 conditions, 18235 events. 4771/18235 cut-off events. For 71471/71749 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 109974 event pairs, 224 based on Foata normal form. 2/17939 useless extension candidates. Maximal degree in co-relation 58656. Up to 8189 conditions per place. [2023-12-09 14:47:36,281 INFO L140 encePairwiseOnDemand]: 222/228 looper letters, 536 selfloop transitions, 93 changer transitions 14/866 dead transitions. [2023-12-09 14:47:36,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 866 transitions, 14500 flow [2023-12-09 14:47:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-12-09 14:47:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2023-12-09 14:47:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 19338 transitions. [2023-12-09 14:47:36,296 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9119977362761743 [2023-12-09 14:47:36,296 INFO L72 ComplementDD]: Start complementDD. Operand 93 states and 19338 transitions. [2023-12-09 14:47:36,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 19338 transitions. [2023-12-09 14:47:36,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:47:36,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 93 states and 19338 transitions. [2023-12-09 14:47:36,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 94 states, 93 states have (on average 207.93548387096774) internal successors, (19338), 93 states have internal predecessors, (19338), 0 states have call successors, (0), 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:36,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 94 states, 94 states have (on average 228.0) internal successors, (21432), 94 states have internal predecessors, (21432), 0 states have call successors, (0), 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:36,489 INFO L81 ComplementDD]: Finished complementDD. Result has 94 states, 94 states have (on average 228.0) internal successors, (21432), 94 states have internal predecessors, (21432), 0 states have call successors, (0), 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:36,502 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 186 predicate places. [2023-12-09 14:47:36,502 INFO L500 AbstractCegarLoop]: Abstraction has has 396 places, 866 transitions, 14500 flow [2023-12-09 14:47:36,505 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 207.5) internal successors, (13695), 66 states have internal predecessors, (13695), 0 states have call successors, (0), 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:36,505 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:47:36,505 INFO L233 CegarLoopForPetriNet]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,523 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:36,706 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:36,706 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:36,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:47:36,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1030497961, now seen corresponding path program 3 times [2023-12-09 14:47:36,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:47:36,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692436097] [2023-12-09 14:47:36,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:47:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:47:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:47:41,802 INFO L134 CoverageAnalysis]: Checked inductivity of 14851 backedges. 0 proven. 14851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:47:41,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:47:41,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692436097] [2023-12-09 14:47:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692436097] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:47:41,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043959096] [2023-12-09 14:47:41,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 14:47:41,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:47:41,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:47:41,804 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,805 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:42,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-09 14:47:42,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 14:47:42,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 77 conjunts are in the unsatisfiable core [2023-12-09 14:47:42,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:47:46,178 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:46,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:46,257 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:46,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:46,500 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:46,547 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:46,712 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:46,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 14:47:46,771 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:46,941 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:46,962 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:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 14851 backedges. 1921 proven. 694 refuted. 0 times theorem prover too weak. 12236 trivial. 0 not checked. [2023-12-09 14:47:47,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:47:47,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800))) is different from false [2023-12-09 14:47:47,422 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-09 14:47:47,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800))) is different from false [2023-12-09 14:47:47,434 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2023-12-09 14:47:47,447 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (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 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 800)) is different from false [2023-12-09 14:47:47,548 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) (= .cse4 800)))) is different from false [2023-12-09 14:47:47,584 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse3 (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|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 800) (forall ((|v_t1Thread1of1ForFork1_enqueue_~x#1_93| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_1528 (Array Int Int))) (not (= (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_93|)) .cse2)) 800))))))) is different from false [2023-12-09 14:47:53,020 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_93| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int) (v_ArrVal_1528 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= 800 (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1528) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_93|)) .cse2)))) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_123|)))))) is different from false [2023-12-09 14:47:53,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:47:53,528 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 231 treesize of output 161 [2023-12-09 14:47:53,568 INFO L349 Elim1Store]: treesize reduction 42, result has 58.0 percent of original size [2023-12-09 14:47:53,568 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 280 treesize of output 253 [2023-12-09 14:47:53,573 WARN L561 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2023-12-09 14:47:53,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:47:53,598 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 204 treesize of output 194 [2023-12-09 14:47:53,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:47:53,610 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 25 treesize of output 17 [2023-12-09 14:47:53,618 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 59 treesize of output 47 [2023-12-09 14:47:53,649 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:53,659 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:47:53,661 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 147 [2023-12-09 14:47:53,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 14:47:53,705 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 317 treesize of output 297 [2023-12-09 14:47:53,742 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:47:53,743 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-09 14:47:53,753 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-09 14:47:53,754 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-12-09 14:47:54,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14851 backedges. 977 proven. 1081 refuted. 0 times theorem prover too weak. 12236 trivial. 557 not checked. [2023-12-09 14:47:54,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043959096] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:47:54,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:47:54,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 21, 24] total 106 [2023-12-09 14:47:54,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577029224] [2023-12-09 14:47:54,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:47:54,963 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2023-12-09 14:47:54,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:47:54,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2023-12-09 14:47:54,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1317, Invalid=8196, Unknown=25, NotChecked=1592, Total=11130 [2023-12-09 14:47:54,977 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 228 [2023-12-09 14:47:54,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 866 transitions, 14500 flow. Second operand has 106 states, 106 states have (on average 153.5) internal successors, (16271), 106 states have internal predecessors, (16271), 0 states have call successors, (0), 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:54,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:47:54,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 228 [2023-12-09 14:47:54,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 14:50:30,238 INFO L124 PetriNetUnfolderBase]: 12398/42071 cut-off events. [2023-12-09 14:50:30,238 INFO L125 PetriNetUnfolderBase]: For 187858/188152 co-relation queries the response was YES. [2023-12-09 14:50:30,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168126 conditions, 42071 events. 12398/42071 cut-off events. For 187858/188152 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 303602 event pairs, 129 based on Foata normal form. 0/41758 useless extension candidates. Maximal degree in co-relation 165861. Up to 19506 conditions per place. [2023-12-09 14:50:30,516 INFO L140 encePairwiseOnDemand]: 197/228 looper letters, 3763 selfloop transitions, 2545 changer transitions 22/6455 dead transitions. [2023-12-09 14:50:30,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1406 places, 6455 transitions, 73717 flow [2023-12-09 14:50:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 1011 states. [2023-12-09 14:50:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2023-12-09 14:50:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 152902 transitions. [2023-12-09 14:50:30,622 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.663326218612803 [2023-12-09 14:50:30,622 INFO L72 ComplementDD]: Start complementDD. Operand 1011 states and 152902 transitions. [2023-12-09 14:50:30,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1011 states and 152902 transitions. [2023-12-09 14:50:30,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 14:50:30,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 1011 states and 152902 transitions. [2023-12-09 14:50:30,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 1012 states, 1011 states have (on average 151.2383778437191) internal successors, (152902), 1011 states have internal predecessors, (152902), 0 states have call successors, (0), 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:50:30,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 1012 states, 1012 states have (on average 228.0) internal successors, (230736), 1012 states have internal predecessors, (230736), 0 states have call successors, (0), 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:50:31,044 INFO L81 ComplementDD]: Finished complementDD. Result has 1012 states, 1012 states have (on average 228.0) internal successors, (230736), 1012 states have internal predecessors, (230736), 0 states have call successors, (0), 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:50:31,044 INFO L308 CegarLoopForPetriNet]: 210 programPoint places, 1196 predicate places. [2023-12-09 14:50:31,044 INFO L500 AbstractCegarLoop]: Abstraction has has 1406 places, 6455 transitions, 73717 flow [2023-12-09 14:50:31,047 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 153.5) internal successors, (16271), 106 states have internal predecessors, (16271), 0 states have call successors, (0), 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:50:31,047 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 14:50:31,047 INFO L233 CegarLoopForPetriNet]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 22, 22, 22, 22, 22, 22, 22, 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, 1, 1, 1] [2023-12-09 14:50:31,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 14:50:31,253 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:50:31,253 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:50:31,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 14:50:31,254 INFO L85 PathProgramCache]: Analyzing trace with hash 741150049, now seen corresponding path program 1 times [2023-12-09 14:50:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 14:50:31,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701680334] [2023-12-09 14:50:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:50:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 14:50:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:50:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 16388 backedges. 0 proven. 16388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:50:37,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 14:50:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701680334] [2023-12-09 14:50:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701680334] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 14:50:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948678010] [2023-12-09 14:50:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 14:50:37,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 14:50:37,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 14:50:37,260 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:50:37,264 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:50:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 14:50:37,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 2502 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-09 14:50:37,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 14:50:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16388 backedges. 0 proven. 16388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:50:38,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 14:50:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16388 backedges. 0 proven. 16388 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 14:50:42,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948678010] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 14:50:42,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 14:50:42,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 134 [2023-12-09 14:50:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644041853] [2023-12-09 14:50:42,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 14:50:42,741 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 134 states [2023-12-09 14:50:42,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 14:50:42,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2023-12-09 14:50:42,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4556, Invalid=13266, Unknown=0, NotChecked=0, Total=17822 [2023-12-09 14:50:42,758 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 228 [2023-12-09 14:50:42,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1406 places, 6455 transitions, 73717 flow. Second operand has 134 states, 134 states have (on average 207.50746268656715) internal successors, (27806), 134 states have internal predecessors, (27806), 0 states have call successors, (0), 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:50:42,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 14:50:42,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 228 [2023-12-09 14:50:42,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 14:51:17,823 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:17,823 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:17,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2023-12-09 14:51:17,956 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-12-09 14:51:17,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-09 14:51:18,158 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,SelfDestructingSolverStorable11 [2023-12-09 14:51:18,159 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (134states, 205/228 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 165953 conditions, 39583 events (11769/39582 cut-off events. For 205803/205913 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 283350 event pairs, 31 based on Foata normal form. 0/39412 useless extension candidates. Maximal degree in co-relation 165655. Up to 18507 conditions per place.). [2023-12-09 14:51:18,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-12-09 14:51:18,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-12-09 14:51:18,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-12-09 14:51:18,160 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-12-09 14:51:18,161 INFO L457 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1] [2023-12-09 14:51:18,164 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 14:51:18,164 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 14:51:18,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:51:18 BasicIcfg [2023-12-09 14:51:18,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 14:51:18,167 INFO L158 Benchmark]: Toolchain (without parser) took 248862.70ms. Allocated memory was 192.9MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 128.3MB in the beginning and 608.5MB in the end (delta: -480.2MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2023-12-09 14:51:18,167 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 14:51:18,167 INFO L158 Benchmark]: CACSL2BoogieTranslator took 688.59ms. Allocated memory was 192.9MB in the beginning and 261.1MB in the end (delta: 68.2MB). Free memory was 128.2MB in the beginning and 218.0MB in the end (delta: -89.8MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. [2023-12-09 14:51:18,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.59ms. Allocated memory is still 261.1MB. Free memory was 218.0MB in the beginning and 214.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-09 14:51:18,167 INFO L158 Benchmark]: Boogie Preprocessor took 23.84ms. Allocated memory is still 261.1MB. Free memory was 214.9MB in the beginning and 212.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 14:51:18,168 INFO L158 Benchmark]: RCFGBuilder took 504.72ms. Allocated memory is still 261.1MB. Free memory was 212.8MB in the beginning and 189.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-09 14:51:18,168 INFO L158 Benchmark]: TraceAbstraction took 247590.82ms. Allocated memory was 261.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 188.7MB in the beginning and 608.5MB in the end (delta: -419.8MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-12-09 14:51:18,169 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.12ms. Allocated memory is still 192.9MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 688.59ms. Allocated memory was 192.9MB in the beginning and 261.1MB in the end (delta: 68.2MB). Free memory was 128.2MB in the beginning and 218.0MB in the end (delta: -89.8MB). Peak memory consumption was 31.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.59ms. Allocated memory is still 261.1MB. Free memory was 218.0MB in the beginning and 214.9MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.84ms. Allocated memory is still 261.1MB. Free memory was 214.9MB in the beginning and 212.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 504.72ms. Allocated memory is still 261.1MB. Free memory was 212.8MB in the beginning and 189.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 247590.82ms. Allocated memory was 261.1MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 188.7MB in the beginning and 608.5MB in the end (delta: -419.8MB). Peak memory consumption was 1.6GB. 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 enhancing Floyd-Hoare automaton (134states, 205/228 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 165953 conditions, 39583 events (11769/39582 cut-off events. For 205803/205913 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 283350 event pairs, 31 based on Foata normal form. 0/39412 useless extension candidates. Maximal degree in co-relation 165655. Up to 18507 conditions per place.). - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (134states, 205/228 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 165953 conditions, 39583 events (11769/39582 cut-off events. For 205803/205913 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 283350 event pairs, 31 based on Foata normal form. 0/39412 useless extension candidates. Maximal degree in co-relation 165655. Up to 18507 conditions per place.). - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (134states, 205/228 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 165953 conditions, 39583 events (11769/39582 cut-off events. For 205803/205913 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 283350 event pairs, 31 based on Foata normal form. 0/39412 useless extension candidates. Maximal degree in co-relation 165655. Up to 18507 conditions per place.). - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (134states, 205/228 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 165953 conditions, 39583 events (11769/39582 cut-off events. For 205803/205913 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 283350 event pairs, 31 based on Foata normal form. 0/39412 useless extension candidates. Maximal degree in co-relation 165655. Up to 18507 conditions per place.). - 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: 247.4s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 205.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15417 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15417 mSDsluCounter, 2311 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 48424 IncrementalHoareTripleChecker+Unchecked, 2141 mSDsCounter, 1115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8405 IncrementalHoareTripleChecker+Invalid, 57944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1115 mSolverCounterUnsat, 170 mSDtfsCounter, 8405 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11240 GetRequests, 9091 SyntacticMatches, 568 SemanticMatches, 1581 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 936754 ImplicationChecksByTransitivity, 138.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73717occurred in iteration=11, InterpolantAutomatonStates: 1215, 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.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 9010 NumberOfCodeBlocks, 7898 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 12779 ConstructedInterpolants, 58 QuantifiedInterpolants, 48797 SizeOfPredicates, 160 NumberOfNonLiveVariables, 6787 ConjunctsInSsa, 279 ConjunctsInUnsatCore, 26 InterpolantComputations, 6 PerfectInterpolantSequences, 28050/107419 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