/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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.positions.where.we.compute.the.hoare.annotation All -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-14 23:42:53,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 23:42:53,542 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 [2025-03-14 23:42:53,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 23:42:53,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 23:42:53,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 23:42:53,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 23:42:53,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 23:42:53,560 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 23:42:53,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 23:42:53,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 23:42:53,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 23:42:53,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 23:42:53,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 23:42:53,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-14 23:42:53,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 23:42:53,575 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:42:53,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 23:42:53,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2025-03-14 23:42:53,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 23:42:53,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 23:42:53,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 23:42:53,817 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 23:42:53,817 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 23:42:53,818 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-03-14 23:42:54,927 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718502009/4b34fe52fc104af4ad19f5039c4d3595/FLAG6f3796b33 [2025-03-14 23:42:55,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 23:42:55,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-03-14 23:42:55,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718502009/4b34fe52fc104af4ad19f5039c4d3595/FLAG6f3796b33 [2025-03-14 23:42:55,176 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/718502009/4b34fe52fc104af4ad19f5039c4d3595 [2025-03-14 23:42:55,178 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 23:42:55,180 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-14 23:42:55,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 23:42:55,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 23:42:55,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 23:42:55,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a497d69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55, skipping insertion in model container [2025-03-14 23:42:55,185 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,212 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 23:42:55,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2025-03-14 23:42:55,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2025-03-14 23:42:55,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2025-03-14 23:42:55,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:42:55,409 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 23:42:55,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30451,30464] [2025-03-14 23:42:55,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30681,30694] [2025-03-14 23:42:55,435 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i[30979,30992] [2025-03-14 23:42:55,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 23:42:55,466 INFO L204 MainTranslator]: Completed translation [2025-03-14 23:42:55,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55 WrapperNode [2025-03-14 23:42:55,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 23:42:55,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 23:42:55,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 23:42:55,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 23:42:55,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,506 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2025-03-14 23:42:55,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 23:42:55,506 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 23:42:55,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 23:42:55,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 23:42:55,513 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,529 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 23:42:55,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-14 23:42:55,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-14 23:42:55,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-14 23:42:55,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (1/1) ... [2025-03-14 23:42:55,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-14 23:42:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:55,584 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) [2025-03-14 23:42:55,589 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 [2025-03-14 23:42:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 23:42:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-14 23:42:55,602 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-14 23:42:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-14 23:42:55,602 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-14 23:42:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 23:42:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 23:42:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 23:42:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 23:42:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 23:42:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 23:42:55,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 23:42:55,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 23:42:55,604 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 23:42:55,703 INFO L234 CfgBuilder]: Building ICFG [2025-03-14 23:42:55,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 23:42:55,892 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 23:42:55,892 INFO L283 CfgBuilder]: Performing block encoding [2025-03-14 23:42:55,905 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 23:42:55,905 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 23:42:55,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:42:55 BoogieIcfgContainer [2025-03-14 23:42:55,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-14 23:42:55,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 23:42:55,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 23:42:55,911 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 23:42:55,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 11:42:55" (1/3) ... [2025-03-14 23:42:55,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0bd99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:42:55, skipping insertion in model container [2025-03-14 23:42:55,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 11:42:55" (2/3) ... [2025-03-14 23:42:55,912 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0bd99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 11:42:55, skipping insertion in model container [2025-03-14 23:42:55,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.03 11:42:55" (3/3) ... [2025-03-14 23:42:55,912 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-03-14 23:42:55,924 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 23:42:55,925 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 146 locations, 1 initial locations, 2 loop locations, and 3 error locations. [2025-03-14 23:42:55,925 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 23:42:56,004 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 23:42:56,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 23:42:56,059 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7440c1fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 23:42:56,059 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-14 23:42:56,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 23:42:56,111 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2025-03-14 23:42:56,112 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 23:42:56,112 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:56,112 INFO L221 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] [2025-03-14 23:42:56,113 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:56,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash 920614276, now seen corresponding path program 1 times [2025-03-14 23:42:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:56,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680714823] [2025-03-14 23:42:56,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:56,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:56,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:56,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680714823] [2025-03-14 23:42:56,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680714823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:56,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:56,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-14 23:42:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162963512] [2025-03-14 23:42:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:56,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-14 23:42:56,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:56,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-14 23:42:56,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-14 23:42:56,707 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 154 [2025-03-14 23:42:56,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 154 transitions, 322 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:56,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:56,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 154 [2025-03-14 23:42:56,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:56,948 INFO L124 PetriNetUnfolderBase]: 150/824 cut-off events. [2025-03-14 23:42:56,948 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-14 23:42:56,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 824 events. 150/824 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5164 event pairs, 16 based on Foata normal form. 43/777 useless extension candidates. Maximal degree in co-relation 905. Up to 101 conditions per place. [2025-03-14 23:42:56,962 INFO L140 encePairwiseOnDemand]: 148/154 looper letters, 38 selfloop transitions, 3 changer transitions 7/168 dead transitions. [2025-03-14 23:42:56,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 168 transitions, 454 flow [2025-03-14 23:42:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-14 23:42:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-14 23:42:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2025-03-14 23:42:56,978 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9074675324675324 [2025-03-14 23:42:56,981 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, -4 predicate places. [2025-03-14 23:42:56,981 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 168 transitions, 454 flow [2025-03-14 23:42:56,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:56,981 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:56,981 INFO L221 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] [2025-03-14 23:42:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 23:42:56,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:56,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1526232458, now seen corresponding path program 1 times [2025-03-14 23:42:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:56,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617374670] [2025-03-14 23:42:56,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:57,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:57,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617374670] [2025-03-14 23:42:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617374670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:57,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:57,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 23:42:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818814972] [2025-03-14 23:42:57,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:57,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 23:42:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:57,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 23:42:57,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 23:42:57,203 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 154 [2025-03-14 23:42:57,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 168 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:57,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:57,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 154 [2025-03-14 23:42:57,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:57,382 INFO L124 PetriNetUnfolderBase]: 92/587 cut-off events. [2025-03-14 23:42:57,382 INFO L125 PetriNetUnfolderBase]: For 132/140 co-relation queries the response was YES. [2025-03-14 23:42:57,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 587 events. 92/587 cut-off events. For 132/140 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2842 event pairs, 18 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 776. Up to 100 conditions per place. [2025-03-14 23:42:57,386 INFO L140 encePairwiseOnDemand]: 145/154 looper letters, 31 selfloop transitions, 7 changer transitions 6/159 dead transitions. [2025-03-14 23:42:57,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 159 transitions, 492 flow [2025-03-14 23:42:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 23:42:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 23:42:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1136 transitions. [2025-03-14 23:42:57,390 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8196248196248196 [2025-03-14 23:42:57,390 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 4 predicate places. [2025-03-14 23:42:57,390 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 159 transitions, 492 flow [2025-03-14 23:42:57,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:57,391 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:57,391 INFO L221 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] [2025-03-14 23:42:57,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 23:42:57,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:57,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:57,393 INFO L85 PathProgramCache]: Analyzing trace with hash 192453702, now seen corresponding path program 1 times [2025-03-14 23:42:57,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:57,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2651397] [2025-03-14 23:42:57,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:57,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:57,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:57,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2651397] [2025-03-14 23:42:57,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2651397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:57,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:57,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 23:42:57,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235961067] [2025-03-14 23:42:57,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:57,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 23:42:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:57,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 23:42:57,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 23:42:57,508 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 154 [2025-03-14 23:42:57,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 159 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:57,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:57,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 154 [2025-03-14 23:42:57,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:57,631 INFO L124 PetriNetUnfolderBase]: 166/889 cut-off events. [2025-03-14 23:42:57,631 INFO L125 PetriNetUnfolderBase]: For 442/478 co-relation queries the response was YES. [2025-03-14 23:42:57,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 889 events. 166/889 cut-off events. For 442/478 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4716 event pairs, 36 based on Foata normal form. 0/802 useless extension candidates. Maximal degree in co-relation 1342. Up to 182 conditions per place. [2025-03-14 23:42:57,638 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 26 selfloop transitions, 3 changer transitions 8/166 dead transitions. [2025-03-14 23:42:57,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 166 transitions, 601 flow [2025-03-14 23:42:57,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 23:42:57,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 23:42:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2025-03-14 23:42:57,642 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2025-03-14 23:42:57,642 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 6 predicate places. [2025-03-14 23:42:57,642 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 166 transitions, 601 flow [2025-03-14 23:42:57,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:57,643 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:57,643 INFO L221 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] [2025-03-14 23:42:57,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 23:42:57,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:57,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2086265544, now seen corresponding path program 1 times [2025-03-14 23:42:57,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:57,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627833879] [2025-03-14 23:42:57,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:57,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:57,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627833879] [2025-03-14 23:42:57,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627833879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:57,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:57,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 23:42:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625918011] [2025-03-14 23:42:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:57,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 23:42:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:57,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 23:42:57,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-14 23:42:57,837 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 154 [2025-03-14 23:42:57,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 166 transitions, 601 flow. Second operand has 7 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:57,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:57,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 154 [2025-03-14 23:42:57,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:58,124 INFO L124 PetriNetUnfolderBase]: 401/1266 cut-off events. [2025-03-14 23:42:58,125 INFO L125 PetriNetUnfolderBase]: For 2496/2604 co-relation queries the response was YES. [2025-03-14 23:42:58,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 1266 events. 401/1266 cut-off events. For 2496/2604 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7969 event pairs, 73 based on Foata normal form. 7/1139 useless extension candidates. Maximal degree in co-relation 3335. Up to 546 conditions per place. [2025-03-14 23:42:58,133 INFO L140 encePairwiseOnDemand]: 143/154 looper letters, 89 selfloop transitions, 10 changer transitions 8/221 dead transitions. [2025-03-14 23:42:58,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 221 transitions, 1176 flow [2025-03-14 23:42:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 23:42:58,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 23:42:58,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1257 transitions. [2025-03-14 23:42:58,136 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8162337662337662 [2025-03-14 23:42:58,137 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 15 predicate places. [2025-03-14 23:42:58,137 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 221 transitions, 1176 flow [2025-03-14 23:42:58,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.42857142857143) internal successors, (843), 7 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:58,138 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:58,138 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:42:58,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 23:42:58,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:58,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:58,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1234134736, now seen corresponding path program 1 times [2025-03-14 23:42:58,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:58,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515207891] [2025-03-14 23:42:58,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:58,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:58,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515207891] [2025-03-14 23:42:58,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515207891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:58,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:58,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 23:42:58,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380173807] [2025-03-14 23:42:58,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:58,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 23:42:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:58,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 23:42:58,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 23:42:58,204 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 154 [2025-03-14 23:42:58,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 221 transitions, 1176 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:58,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:58,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 154 [2025-03-14 23:42:58,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:58,301 INFO L124 PetriNetUnfolderBase]: 271/908 cut-off events. [2025-03-14 23:42:58,301 INFO L125 PetriNetUnfolderBase]: For 2953/3021 co-relation queries the response was YES. [2025-03-14 23:42:58,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 908 events. 271/908 cut-off events. For 2953/3021 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5138 event pairs, 44 based on Foata normal form. 1/828 useless extension candidates. Maximal degree in co-relation 2541. Up to 309 conditions per place. [2025-03-14 23:42:58,306 INFO L140 encePairwiseOnDemand]: 148/154 looper letters, 70 selfloop transitions, 5 changer transitions 10/232 dead transitions. [2025-03-14 23:42:58,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 232 transitions, 1457 flow [2025-03-14 23:42:58,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 23:42:58,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 23:42:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2025-03-14 23:42:58,307 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9199134199134199 [2025-03-14 23:42:58,309 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 17 predicate places. [2025-03-14 23:42:58,309 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 232 transitions, 1457 flow [2025-03-14 23:42:58,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:58,310 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:58,310 INFO L221 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] [2025-03-14 23:42:58,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 23:42:58,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:58,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1313077997, now seen corresponding path program 1 times [2025-03-14 23:42:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969094059] [2025-03-14 23:42:58,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:58,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:58,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969094059] [2025-03-14 23:42:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969094059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:58,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 23:42:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584754535] [2025-03-14 23:42:58,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:58,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 23:42:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:58,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 23:42:58,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 23:42:58,412 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 154 [2025-03-14 23:42:58,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 232 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:58,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:58,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 154 [2025-03-14 23:42:58,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:58,501 INFO L124 PetriNetUnfolderBase]: 151/696 cut-off events. [2025-03-14 23:42:58,502 INFO L125 PetriNetUnfolderBase]: For 3801/3932 co-relation queries the response was YES. [2025-03-14 23:42:58,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 696 events. 151/696 cut-off events. For 3801/3932 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3475 event pairs, 23 based on Foata normal form. 86/726 useless extension candidates. Maximal degree in co-relation 1740. Up to 199 conditions per place. [2025-03-14 23:42:58,505 INFO L140 encePairwiseOnDemand]: 150/154 looper letters, 30 selfloop transitions, 17 changer transitions 32/220 dead transitions. [2025-03-14 23:42:58,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 220 transitions, 1484 flow [2025-03-14 23:42:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 23:42:58,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 23:42:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-03-14 23:42:58,507 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8917748917748918 [2025-03-14 23:42:58,509 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 19 predicate places. [2025-03-14 23:42:58,509 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 220 transitions, 1484 flow [2025-03-14 23:42:58,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:58,509 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:58,509 INFO L221 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] [2025-03-14 23:42:58,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 23:42:58,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2125410348, now seen corresponding path program 1 times [2025-03-14 23:42:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878395933] [2025-03-14 23:42:58,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-14 23:42:58,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1194885475] [2025-03-14 23:42:58,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:58,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:58,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:42:58,561 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) [2025-03-14 23:42:58,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-14 23:42:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:42:58,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-14 23:42:58,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:42:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:42:59,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 23:42:59,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:42:59,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878395933] [2025-03-14 23:42:59,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 23:42:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194885475] [2025-03-14 23:42:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194885475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:42:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:42:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-14 23:42:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024542676] [2025-03-14 23:42:59,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:42:59,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-14 23:42:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:42:59,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-14 23:42:59,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-14 23:42:59,062 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 154 [2025-03-14 23:42:59,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 220 transitions, 1484 flow. Second operand has 8 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:59,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:42:59,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 154 [2025-03-14 23:42:59,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:42:59,253 INFO L124 PetriNetUnfolderBase]: 161/819 cut-off events. [2025-03-14 23:42:59,253 INFO L125 PetriNetUnfolderBase]: For 4084/4139 co-relation queries the response was YES. [2025-03-14 23:42:59,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 819 events. 161/819 cut-off events. For 4084/4139 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4022 event pairs, 33 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 2071. Up to 224 conditions per place. [2025-03-14 23:42:59,259 INFO L140 encePairwiseOnDemand]: 144/154 looper letters, 75 selfloop transitions, 9 changer transitions 17/231 dead transitions. [2025-03-14 23:42:59,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 231 transitions, 1801 flow [2025-03-14 23:42:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-14 23:42:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-14 23:42:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1348 transitions. [2025-03-14 23:42:59,262 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7957497048406139 [2025-03-14 23:42:59,263 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 29 predicate places. [2025-03-14 23:42:59,263 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 231 transitions, 1801 flow [2025-03-14 23:42:59,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:42:59,263 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:42:59,263 INFO L221 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] [2025-03-14 23:42:59,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 23:42:59,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:42:59,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:42:59,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:42:59,465 INFO L85 PathProgramCache]: Analyzing trace with hash -771076104, now seen corresponding path program 1 times [2025-03-14 23:42:59,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:42:59,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061649533] [2025-03-14 23:42:59,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:42:59,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:42:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:43:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:43:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:43:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061649533] [2025-03-14 23:43:00,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061649533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:43:00,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:43:00,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-14 23:43:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632051611] [2025-03-14 23:43:00,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:43:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-14 23:43:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:43:00,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-14 23:43:00,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-14 23:43:00,360 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 154 [2025-03-14 23:43:00,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 231 transitions, 1801 flow. Second operand has 17 states, 17 states have (on average 78.52941176470588) internal successors, (1335), 17 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:00,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:43:00,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 154 [2025-03-14 23:43:00,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:43:01,194 INFO L124 PetriNetUnfolderBase]: 500/1690 cut-off events. [2025-03-14 23:43:01,194 INFO L125 PetriNetUnfolderBase]: For 8458/8692 co-relation queries the response was YES. [2025-03-14 23:43:01,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6033 conditions, 1690 events. 500/1690 cut-off events. For 8458/8692 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9858 event pairs, 186 based on Foata normal form. 7/1536 useless extension candidates. Maximal degree in co-relation 5017. Up to 635 conditions per place. [2025-03-14 23:43:01,203 INFO L140 encePairwiseOnDemand]: 130/154 looper letters, 238 selfloop transitions, 32 changer transitions 55/399 dead transitions. [2025-03-14 23:43:01,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 399 transitions, 3689 flow [2025-03-14 23:43:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-14 23:43:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-14 23:43:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2128 transitions. [2025-03-14 23:43:01,208 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5527272727272727 [2025-03-14 23:43:01,210 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 53 predicate places. [2025-03-14 23:43:01,210 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 399 transitions, 3689 flow [2025-03-14 23:43:01,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 78.52941176470588) internal successors, (1335), 17 states have internal predecessors, (1335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:01,211 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:43:01,211 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:43:01,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 23:43:01,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:43:01,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:43:01,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2069046059, now seen corresponding path program 1 times [2025-03-14 23:43:01,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:43:01,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003141123] [2025-03-14 23:43:01,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:43:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:43:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:43:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:43:01,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:43:01,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003141123] [2025-03-14 23:43:01,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003141123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:43:01,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:43:01,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 23:43:01,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806742878] [2025-03-14 23:43:01,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:43:01,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 23:43:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:43:01,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 23:43:01,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-14 23:43:01,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 154 [2025-03-14 23:43:01,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 399 transitions, 3689 flow. Second operand has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:01,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:43:01,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 154 [2025-03-14 23:43:01,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:43:01,563 INFO L124 PetriNetUnfolderBase]: 361/1253 cut-off events. [2025-03-14 23:43:01,563 INFO L125 PetriNetUnfolderBase]: For 8148/8346 co-relation queries the response was YES. [2025-03-14 23:43:01,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4841 conditions, 1253 events. 361/1253 cut-off events. For 8148/8346 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6405 event pairs, 105 based on Foata normal form. 1/1148 useless extension candidates. Maximal degree in co-relation 3790. Up to 445 conditions per place. [2025-03-14 23:43:01,571 INFO L140 encePairwiseOnDemand]: 147/154 looper letters, 79 selfloop transitions, 6 changer transitions 42/333 dead transitions. [2025-03-14 23:43:01,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 333 transitions, 3241 flow [2025-03-14 23:43:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-14 23:43:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-14 23:43:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1001 transitions. [2025-03-14 23:43:01,576 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8125 [2025-03-14 23:43:01,577 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 58 predicate places. [2025-03-14 23:43:01,577 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 333 transitions, 3241 flow [2025-03-14 23:43:01,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.83333333333333) internal successors, (755), 6 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:01,577 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:43:01,577 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:43:01,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 23:43:01,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:43:01,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:43:01,578 INFO L85 PathProgramCache]: Analyzing trace with hash -311434809, now seen corresponding path program 1 times [2025-03-14 23:43:01,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:43:01,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874375260] [2025-03-14 23:43:01,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:43:01,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:43:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:43:01,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:43:01,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:43:01,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874375260] [2025-03-14 23:43:01,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874375260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:43:01,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:43:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-14 23:43:01,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913691034] [2025-03-14 23:43:01,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:43:01,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 23:43:01,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:43:01,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 23:43:01,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-14 23:43:01,705 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 154 [2025-03-14 23:43:01,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 333 transitions, 3241 flow. Second operand has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:01,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:43:01,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 154 [2025-03-14 23:43:01,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:43:01,920 INFO L124 PetriNetUnfolderBase]: 403/1327 cut-off events. [2025-03-14 23:43:01,920 INFO L125 PetriNetUnfolderBase]: For 10337/10572 co-relation queries the response was YES. [2025-03-14 23:43:01,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5753 conditions, 1327 events. 403/1327 cut-off events. For 10337/10572 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6910 event pairs, 130 based on Foata normal form. 4/1223 useless extension candidates. Maximal degree in co-relation 4690. Up to 492 conditions per place. [2025-03-14 23:43:01,928 INFO L140 encePairwiseOnDemand]: 145/154 looper letters, 133 selfloop transitions, 29 changer transitions 41/338 dead transitions. [2025-03-14 23:43:01,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 338 transitions, 3745 flow [2025-03-14 23:43:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 23:43:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 23:43:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1102 transitions. [2025-03-14 23:43:01,932 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7950937950937951 [2025-03-14 23:43:01,932 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 63 predicate places. [2025-03-14 23:43:01,932 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 338 transitions, 3745 flow [2025-03-14 23:43:01,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.0) internal successors, (744), 6 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:01,932 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:43:01,932 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:43:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 23:43:01,933 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:43:01,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:43:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 189812839, now seen corresponding path program 1 times [2025-03-14 23:43:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:43:01,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828168514] [2025-03-14 23:43:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:43:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:43:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-14 23:43:01,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579679990] [2025-03-14 23:43:01,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:43:01,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:43:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:43:01,978 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) [2025-03-14 23:43:01,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-14 23:43:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:43:02,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-14 23:43:02,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:43:02,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:43:02,600 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 23:43:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:43:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828168514] [2025-03-14 23:43:02,600 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 23:43:02,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579679990] [2025-03-14 23:43:02,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579679990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:43:02,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:43:02,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-14 23:43:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285783274] [2025-03-14 23:43:02,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:43:02,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-14 23:43:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:43:02,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-14 23:43:02,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-14 23:43:02,602 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 154 [2025-03-14 23:43:02,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 338 transitions, 3745 flow. Second operand has 11 states, 11 states have (on average 118.45454545454545) internal successors, (1303), 11 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:02,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:43:02,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 154 [2025-03-14 23:43:02,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:43:02,963 INFO L124 PetriNetUnfolderBase]: 476/1494 cut-off events. [2025-03-14 23:43:02,963 INFO L125 PetriNetUnfolderBase]: For 14387/14738 co-relation queries the response was YES. [2025-03-14 23:43:02,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7104 conditions, 1494 events. 476/1494 cut-off events. For 14387/14738 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7400 event pairs, 149 based on Foata normal form. 2/1370 useless extension candidates. Maximal degree in co-relation 5924. Up to 570 conditions per place. [2025-03-14 23:43:02,972 INFO L140 encePairwiseOnDemand]: 142/154 looper letters, 89 selfloop transitions, 15 changer transitions 65/352 dead transitions. [2025-03-14 23:43:02,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 352 transitions, 4304 flow [2025-03-14 23:43:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-14 23:43:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-14 23:43:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1803 transitions. [2025-03-14 23:43:02,975 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7805194805194805 [2025-03-14 23:43:02,976 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 77 predicate places. [2025-03-14 23:43:02,976 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 352 transitions, 4304 flow [2025-03-14 23:43:02,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 118.45454545454545) internal successors, (1303), 11 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:02,976 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:43:02,976 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:43:02,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 23:43:03,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-14 23:43:03,177 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:43:03,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:43:03,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1868688091, now seen corresponding path program 1 times [2025-03-14 23:43:03,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:43:03,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170971156] [2025-03-14 23:43:03,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:43:03,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:43:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-14 23:43:03,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167800938] [2025-03-14 23:43:03,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 23:43:03,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:43:03,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:43:03,241 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) [2025-03-14 23:43:03,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-14 23:43:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 23:43:03,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-14 23:43:03,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:43:03,937 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 13 treesize of output 9 [2025-03-14 23:43:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:43:04,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 23:43:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:43:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170971156] [2025-03-14 23:43:04,159 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 23:43:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167800938] [2025-03-14 23:43:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167800938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:43:04,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:43:04,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-14 23:43:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043377948] [2025-03-14 23:43:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:43:04,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 23:43:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:43:04,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 23:43:04,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=535, Unknown=0, NotChecked=0, Total=600 [2025-03-14 23:43:04,161 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 154 [2025-03-14 23:43:04,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 352 transitions, 4304 flow. Second operand has 25 states, 25 states have (on average 65.32) internal successors, (1633), 25 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:04,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:43:04,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 154 [2025-03-14 23:43:04,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:43:05,682 INFO L124 PetriNetUnfolderBase]: 789/2340 cut-off events. [2025-03-14 23:43:05,682 INFO L125 PetriNetUnfolderBase]: For 22903/23741 co-relation queries the response was YES. [2025-03-14 23:43:05,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11925 conditions, 2340 events. 789/2340 cut-off events. For 22903/23741 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 13236 event pairs, 189 based on Foata normal form. 8/2178 useless extension candidates. Maximal degree in co-relation 10656. Up to 971 conditions per place. [2025-03-14 23:43:05,699 INFO L140 encePairwiseOnDemand]: 126/154 looper letters, 367 selfloop transitions, 52 changer transitions 80/555 dead transitions. [2025-03-14 23:43:05,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 555 transitions, 7432 flow [2025-03-14 23:43:05,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-14 23:43:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-03-14 23:43:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2432 transitions. [2025-03-14 23:43:05,704 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.45120593692022265 [2025-03-14 23:43:05,705 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 111 predicate places. [2025-03-14 23:43:05,705 INFO L471 AbstractCegarLoop]: Abstraction has has 263 places, 555 transitions, 7432 flow [2025-03-14 23:43:05,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 65.32) internal successors, (1633), 25 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:05,705 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:43:05,705 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:43:05,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-14 23:43:05,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:43:05,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:43:05,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:43:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1815838047, now seen corresponding path program 2 times [2025-03-14 23:43:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:43:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116794523] [2025-03-14 23:43:05,907 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:43:05,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:43:05,948 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:43:05,948 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2025-03-14 23:43:05,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552637024] [2025-03-14 23:43:05,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 23:43:05,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:43:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:43:05,951 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) [2025-03-14 23:43:05,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-14 23:43:06,070 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:43:06,070 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:43:06,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-14 23:43:06,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:43:06,683 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 [2025-03-14 23:43:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:43:06,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:43:07,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2025-03-14 23:43:07,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:07,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 274 [2025-03-14 23:43:07,528 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:07,533 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 267 [2025-03-14 23:43:07,719 INFO L349 Elim1Store]: treesize reduction 113, result has 27.6 percent of original size [2025-03-14 23:43:07,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 409 treesize of output 415 [2025-03-14 23:43:08,035 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:08,038 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 618 [2025-03-14 23:43:10,406 INFO L349 Elim1Store]: treesize reduction 1241, result has 26.7 percent of original size [2025-03-14 23:43:10,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 16 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 19 new quantified variables, introduced 83 case distinctions, treesize of input 696 treesize of output 4618 [2025-03-14 23:43:10,870 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:10,871 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 461 [2025-03-14 23:43:11,025 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:11,027 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 461 [2025-03-14 23:43:11,204 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:11,206 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 461 [2025-03-14 23:43:11,413 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:11,414 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 461 [2025-03-14 23:43:11,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 23:43:11,883 INFO L224 Elim1Store]: Index analysis took 236 ms [2025-03-14 23:43:11,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 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 464 treesize of output 2921 [2025-03-14 23:43:12,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-14 23:43:12,747 INFO L224 Elim1Store]: Index analysis took 209 ms [2025-03-14 23:43:12,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 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 464 treesize of output 2921 [2025-03-14 23:43:14,033 INFO L224 Elim1Store]: Index analysis took 459 ms [2025-03-14 23:43:14,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 14 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 464 treesize of output 2921 [2025-03-14 23:43:15,083 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:15,084 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 415 [2025-03-14 23:43:15,373 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:15,375 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 415 [2025-03-14 23:43:15,668 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:15,669 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 369 [2025-03-14 23:43:15,875 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:15,876 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 369 [2025-03-14 23:43:15,998 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,000 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 369 [2025-03-14 23:43:16,134 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,135 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 369 [2025-03-14 23:43:16,216 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,217 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 329 [2025-03-14 23:43:16,247 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,252 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 329 [2025-03-14 23:43:16,341 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,342 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 329 [2025-03-14 23:43:16,606 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,607 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 301 [2025-03-14 23:43:16,675 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,675 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 301 [2025-03-14 23:43:16,768 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,769 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 301 [2025-03-14 23:43:16,815 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,815 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 301 [2025-03-14 23:43:16,903 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,904 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 265 [2025-03-14 23:43:16,949 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,949 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 265 [2025-03-14 23:43:16,994 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:16,995 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 265 [2025-03-14 23:43:17,018 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,018 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 265 [2025-03-14 23:43:17,154 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,155 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 235 [2025-03-14 23:43:17,214 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,215 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 235 [2025-03-14 23:43:17,433 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,435 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 301 [2025-03-14 23:43:17,546 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,547 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 288 [2025-03-14 23:43:17,705 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,707 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 254 [2025-03-14 23:43:17,754 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,755 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 218 [2025-03-14 23:43:17,792 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,793 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 186 [2025-03-14 23:43:17,865 INFO L349 Elim1Store]: treesize reduction 160, result has 16.2 percent of original size [2025-03-14 23:43:17,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 199 treesize of output 177 [2025-03-14 23:43:17,902 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,903 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 114 [2025-03-14 23:43:17,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:43:17,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 127 [2025-03-14 23:43:17,951 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2025-03-14 23:43:20,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:43:20,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:43:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116794523] [2025-03-14 23:43:20,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 23:43:20,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552637024] [2025-03-14 23:43:20,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552637024] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:43:20,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:43:20,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 47 [2025-03-14 23:43:20,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969581939] [2025-03-14 23:43:20,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-14 23:43:20,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-14 23:43:20,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:43:20,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-14 23:43:20,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1951, Unknown=0, NotChecked=0, Total=2162 [2025-03-14 23:43:20,376 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 154 [2025-03-14 23:43:20,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 555 transitions, 7432 flow. Second operand has 47 states, 47 states have (on average 65.51063829787235) internal successors, (3079), 47 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:43:20,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:43:20,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 154 [2025-03-14 23:43:20,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:43:45,839 WARN L286 SmtUtils]: Spent 11.01s on a formula simplification. DAG size of input: 83 DAG size of output: 61 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 23:44:36,714 WARN L286 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 85 DAG size of output: 71 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 23:44:47,722 WARN L286 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 85 DAG size of output: 60 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 23:46:17,803 WARN L286 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 90 DAG size of output: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 23:47:14,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:47:19,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:47:22,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:47:27,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:47:34,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:47:39,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:48:24,766 INFO L124 PetriNetUnfolderBase]: 3421/10322 cut-off events. [2025-03-14 23:48:24,767 INFO L125 PetriNetUnfolderBase]: For 112158/119470 co-relation queries the response was YES. [2025-03-14 23:48:24,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56632 conditions, 10322 events. 3421/10322 cut-off events. For 112158/119470 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 90582 event pairs, 385 based on Foata normal form. 108/9551 useless extension candidates. Maximal degree in co-relation 54537. Up to 6008 conditions per place. [2025-03-14 23:48:24,831 INFO L140 encePairwiseOnDemand]: 116/154 looper letters, 1482 selfloop transitions, 722 changer transitions 714/2974 dead transitions. [2025-03-14 23:48:24,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 2974 transitions, 45591 flow [2025-03-14 23:48:24,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 279 states. [2025-03-14 23:48:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2025-03-14 23:48:24,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 18705 transitions. [2025-03-14 23:48:24,864 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4353442256668063 [2025-03-14 23:48:24,865 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 389 predicate places. [2025-03-14 23:48:24,865 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 2974 transitions, 45591 flow [2025-03-14 23:48:24,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 65.51063829787235) internal successors, (3079), 47 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:48:24,866 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:48:24,866 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:48:24,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-14 23:48:25,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:48:25,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:48:25,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:48:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1050014663, now seen corresponding path program 3 times [2025-03-14 23:48:25,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:48:25,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561118236] [2025-03-14 23:48:25,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:48:25,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:48:25,110 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:48:25,111 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2025-03-14 23:48:25,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714867430] [2025-03-14 23:48:25,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-14 23:48:25,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:48:25,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:48:25,116 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) [2025-03-14 23:48:25,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 23:48:25,341 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-14 23:48:25,342 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:48:25,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-14 23:48:25,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:48:26,072 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 [2025-03-14 23:48:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:48:26,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:48:26,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2025-03-14 23:48:26,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:48:26,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 274 [2025-03-14 23:48:26,985 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:48:26,988 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 254 [2025-03-14 23:48:27,168 INFO L349 Elim1Store]: treesize reduction 115, result has 27.2 percent of original size [2025-03-14 23:48:27,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 241 treesize of output 244 [2025-03-14 23:48:27,369 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:48:27,372 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 289 [2025-03-14 23:48:27,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:48:27,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 327 treesize of output 268 [2025-03-14 23:48:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:48:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:48:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561118236] [2025-03-14 23:48:31,303 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 23:48:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714867430] [2025-03-14 23:48:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714867430] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:48:31,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:48:31,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 47 [2025-03-14 23:48:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363771654] [2025-03-14 23:48:31,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-14 23:48:31,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-14 23:48:31,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:48:31,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-14 23:48:31,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1947, Unknown=0, NotChecked=0, Total=2162 [2025-03-14 23:48:31,307 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 154 [2025-03-14 23:48:31,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 2974 transitions, 45591 flow. Second operand has 47 states, 47 states have (on average 65.51063829787235) internal successors, (3079), 47 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:48:31,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:48:31,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 154 [2025-03-14 23:48:31,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:51:27,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:51:52,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:52:05,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:52:30,021 INFO L124 PetriNetUnfolderBase]: 7460/23280 cut-off events. [2025-03-14 23:52:30,022 INFO L125 PetriNetUnfolderBase]: For 283412/301327 co-relation queries the response was YES. [2025-03-14 23:52:30,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142715 conditions, 23280 events. 7460/23280 cut-off events. For 283412/301327 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 243225 event pairs, 454 based on Foata normal form. 434/21711 useless extension candidates. Maximal degree in co-relation 139146. Up to 14886 conditions per place. [2025-03-14 23:52:30,187 INFO L140 encePairwiseOnDemand]: 116/154 looper letters, 3822 selfloop transitions, 1908 changer transitions 2026/7812 dead transitions. [2025-03-14 23:52:30,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 800 places, 7812 transitions, 133979 flow [2025-03-14 23:52:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 260 states. [2025-03-14 23:52:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2025-03-14 23:52:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 17279 transitions. [2025-03-14 23:52:30,218 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43154345654345655 [2025-03-14 23:52:30,220 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 648 predicate places. [2025-03-14 23:52:30,220 INFO L471 AbstractCegarLoop]: Abstraction has has 800 places, 7812 transitions, 133979 flow [2025-03-14 23:52:30,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 65.51063829787235) internal successors, (3079), 47 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:52:30,223 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:52:30,224 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:52:30,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-14 23:52:30,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-14 23:52:30,424 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:52:30,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:52:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1402150647, now seen corresponding path program 4 times [2025-03-14 23:52:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:52:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029887541] [2025-03-14 23:52:30,426 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:52:30,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:52:30,572 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:52:30,572 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2025-03-14 23:52:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [338622624] [2025-03-14 23:52:30,582 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-14 23:52:30,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:52:30,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:52:30,585 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) [2025-03-14 23:52:30,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-14 23:52:30,776 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-14 23:52:30,776 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:52:30,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-14 23:52:30,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:52:31,483 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 13 treesize of output 9 [2025-03-14 23:52:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:52:31,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-14 23:52:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:52:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029887541] [2025-03-14 23:52:31,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 23:52:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338622624] [2025-03-14 23:52:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338622624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 23:52:31,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 23:52:31,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-14 23:52:31,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595988084] [2025-03-14 23:52:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 23:52:31,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-14 23:52:31,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:52:31,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-14 23:52:31,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2025-03-14 23:52:31,802 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 154 [2025-03-14 23:52:31,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 800 places, 7812 transitions, 133979 flow. Second operand has 25 states, 25 states have (on average 65.32) internal successors, (1633), 25 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:52:31,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:52:31,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 154 [2025-03-14 23:52:31,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:52:53,646 INFO L124 PetriNetUnfolderBase]: 8167/25488 cut-off events. [2025-03-14 23:52:53,647 INFO L125 PetriNetUnfolderBase]: For 337143/355594 co-relation queries the response was YES. [2025-03-14 23:52:53,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174494 conditions, 25488 events. 8167/25488 cut-off events. For 337143/355594 co-relation queries the response was YES. Maximal size of possible extension queue 548. Compared 271384 event pairs, 492 based on Foata normal form. 55/23382 useless extension candidates. Maximal degree in co-relation 170471. Up to 16452 conditions per place. [2025-03-14 23:52:53,783 INFO L140 encePairwiseOnDemand]: 127/154 looper letters, 6121 selfloop transitions, 168 changer transitions 2225/8570 dead transitions. [2025-03-14 23:52:53,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 838 places, 8570 transitions, 163888 flow [2025-03-14 23:52:53,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-14 23:52:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-03-14 23:52:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2673 transitions. [2025-03-14 23:52:53,785 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.44505494505494503 [2025-03-14 23:52:53,786 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 686 predicate places. [2025-03-14 23:52:53,786 INFO L471 AbstractCegarLoop]: Abstraction has has 838 places, 8570 transitions, 163888 flow [2025-03-14 23:52:53,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 65.32) internal successors, (1633), 25 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:52:53,786 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-14 23:52:53,786 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:52:53,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-14 23:52:53,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-14 23:52:53,987 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-14 23:52:53,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 23:52:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash -900251011, now seen corresponding path program 5 times [2025-03-14 23:52:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 23:52:53,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866988765] [2025-03-14 23:52:53,988 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:52:53,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 23:52:54,080 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:52:54,080 INFO L230 tOrderPrioritization]: Conjunction of SSA is unknown [2025-03-14 23:52:54,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051587829] [2025-03-14 23:52:54,082 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-14 23:52:54,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:52:54,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 23:52:54,089 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) [2025-03-14 23:52:54,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-14 23:52:54,297 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 23:52:54,297 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-14 23:52:54,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-14 23:52:54,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 23:52:55,152 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 [2025-03-14 23:52:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:52:55,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 23:52:55,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 97 [2025-03-14 23:52:55,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:52:55,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 97 treesize of output 274 [2025-03-14 23:52:56,056 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:52:56,061 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 256 [2025-03-14 23:52:56,204 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:52:56,209 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 243 [2025-03-14 23:52:56,317 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:52:56,319 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 254 [2025-03-14 23:52:56,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 23:52:56,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 244 [2025-03-14 23:53:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 23:53:00,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 23:53:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866988765] [2025-03-14 23:53:00,203 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-14 23:53:00,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051587829] [2025-03-14 23:53:00,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051587829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 23:53:00,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-14 23:53:00,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21] total 44 [2025-03-14 23:53:00,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343846771] [2025-03-14 23:53:00,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-14 23:53:00,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-14 23:53:00,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 23:53:00,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-14 23:53:00,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1709, Unknown=0, NotChecked=0, Total=1892 [2025-03-14 23:53:00,206 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 154 [2025-03-14 23:53:00,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 838 places, 8570 transitions, 163888 flow. Second operand has 44 states, 44 states have (on average 65.81818181818181) internal successors, (2896), 44 states have internal predecessors, (2896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 23:53:00,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 23:53:00,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 154 [2025-03-14 23:53:00,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 23:53:05,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:18,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:20,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:26,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:28,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:31,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:41,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:43,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:49,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:53:52,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:00,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:03,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:04,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:06,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:08,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:11,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:13,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:15,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:17,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:19,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-14 23:54:23,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:25,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:31,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:39,762 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 69 DAG size of output: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-14 23:54:41,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:43,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:46,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:48,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:50,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:52,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:54,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:56,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:54:59,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:01,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:03,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:05,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:08,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:10,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:12,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:14,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:16,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:19,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:21,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:24,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:26,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:28,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:30,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:33,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:35,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:37,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:40,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:42,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:45,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:48,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:55,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:55:57,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:05,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:08,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:10,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:12,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:14,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:16,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:18,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:25,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:27,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:29,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:31,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:33,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:35,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:38,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:40,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:43,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:45,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:47,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:49,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:52,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:54,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:56:56,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:57:00,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:57:09,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:57:11,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:57:13,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:57:15,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2025-03-14 23:57:17,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] Received shutdown request... [2025-03-14 23:57:19,277 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-14 23:57:19,277 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 [2025-03-14 23:57:20,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-14 23:57:20,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2025-03-14 23:57:20,183 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-03-14 23:57:20,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-14 23:57:20,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 23:57:20,387 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 61/154 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 26595 conditions, 3580 events (1138/3579 cut-off events. For 47094/50196 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32158 event pairs, 26 based on Foata normal form. 29/3523 useless extension candidates. Maximal degree in co-relation 24636. Up to 2327 conditions per place.). [2025-03-14 23:57:20,389 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-03-14 23:57:20,389 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-03-14 23:57:20,389 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-03-14 23:57:20,389 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-03-14 23:57:20,389 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-03-14 23:57:20,389 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-03-14 23:57:20,389 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-03-14 23:57:20,390 INFO L422 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 23:57:20,417 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 23:57:20,417 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 23:57:20,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 11:57:20 BasicIcfg [2025-03-14 23:57:20,425 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 23:57:20,426 INFO L158 Benchmark]: Toolchain (without parser) took 865247.06ms. Allocated memory was 71.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 43.3MB in the beginning and 337.1MB in the end (delta: -293.8MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-14 23:57:20,426 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:57:20,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.74ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 22.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-03-14 23:57:20,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.14ms. Allocated memory is still 71.3MB. Free memory was 22.3MB in the beginning and 20.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:57:20,426 INFO L158 Benchmark]: Boogie Preprocessor took 32.06ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 19.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-14 23:57:20,426 INFO L158 Benchmark]: RCFGBuilder took 366.81ms. Allocated memory is still 71.3MB. Free memory was 18.8MB in the beginning and 27.7MB in the end (delta: -8.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2025-03-14 23:57:20,426 INFO L158 Benchmark]: TraceAbstraction took 864517.71ms. Allocated memory was 71.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 26.5MB in the beginning and 337.1MB in the end (delta: -310.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2025-03-14 23:57:20,427 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.16ms. Allocated memory is still 71.3MB. Free memory was 37.1MB in the beginning and 37.1MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 285.74ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 22.3MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.14ms. Allocated memory is still 71.3MB. Free memory was 22.3MB in the beginning and 20.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 32.06ms. Allocated memory is still 71.3MB. Free memory was 20.3MB in the beginning and 19.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 366.81ms. Allocated memory is still 71.3MB. Free memory was 18.8MB in the beginning and 27.7MB in the end (delta: -8.9MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * TraceAbstraction took 864517.71ms. Allocated memory was 71.3MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 26.5MB in the beginning and 337.1MB in the end (delta: -310.7MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 61/154 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 26595 conditions, 3580 events (1138/3579 cut-off events. For 47094/50196 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32158 event pairs, 26 based on Foata normal form. 29/3523 useless extension candidates. Maximal degree in co-relation 24636. Up to 2327 conditions per place.). - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 61/154 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 26595 conditions, 3580 events (1138/3579 cut-off events. For 47094/50196 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32158 event pairs, 26 based on Foata normal form. 29/3523 useless extension candidates. Maximal degree in co-relation 24636. Up to 2327 conditions per place.). - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 61/154 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 26595 conditions, 3580 events (1138/3579 cut-off events. For 47094/50196 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32158 event pairs, 26 based on Foata normal form. 29/3523 useless extension candidates. Maximal degree in co-relation 24636. Up to 2327 conditions per place.). - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 61/154 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 26595 conditions, 3580 events (1138/3579 cut-off events. For 47094/50196 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32158 event pairs, 26 based on Foata normal form. 29/3523 useless extension candidates. Maximal degree in co-relation 24636. Up to 2327 conditions per place.). - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (44states, 61/154 universal loopers) in iteration 16,while PetriNetUnfolder was constructing finite prefix that currently has 26595 conditions, 3580 events (1138/3579 cut-off events. For 47094/50196 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 32158 event pairs, 26 based on Foata normal form. 29/3523 useless extension candidates. Maximal degree in co-relation 24636. Up to 2327 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 225 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 864.4s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 829.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 90 mSolverCounterUnknown, 5454 SdHoareTripleChecker+Valid, 237.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5454 mSDsluCounter, 14557 SdHoareTripleChecker+Invalid, 235.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13668 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24986 IncrementalHoareTripleChecker+Invalid, 25267 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 889 mSDtfsCounter, 24986 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2321 GetRequests, 1354 SyntacticMatches, 7 SemanticMatches, 960 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84219 ImplicationChecksByTransitivity, 560.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163888occurred in iteration=15, InterpolantAutomatonStates: 713, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 30.8s InterpolantComputationTime, 2975 NumberOfCodeBlocks, 2975 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2378 ConstructedInterpolants, 0 QuantifiedInterpolants, 27594 SizeOfPredicates, 118 NumberOfNonLiveVariables, 2376 ConjunctsInSsa, 289 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 4/56 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout [2025-03-14 23:57:20,432 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Exception during sending of exit command (exit): Stream Closed Completed graceful shutdown