/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:53:35,203 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:53:35,253 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-15 01:53:35,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:53:35,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:53:35,303 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:53:35,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:53:35,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:53:35,304 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:53:35,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:53:35,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:53:35,305 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:53:35,305 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:53:35,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:53:35,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:53:35,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:53:35,598 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:53:35,598 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:53:35,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-15 01:53:36,790 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574f61d2c/8c0948793f1e467f8ef51fbbb2144a1f/FLAGea5ab3dfc [2025-03-15 01:53:37,101 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:53:37,105 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-15 01:53:37,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574f61d2c/8c0948793f1e467f8ef51fbbb2144a1f/FLAGea5ab3dfc [2025-03-15 01:53:37,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/574f61d2c/8c0948793f1e467f8ef51fbbb2144a1f [2025-03-15 01:53:37,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:53:37,398 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:53:37,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:53:37,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:53:37,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:53:37,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f7b7587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37, skipping insertion in model container [2025-03-15 01:53:37,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:53:37,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:53:37,745 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:53:37,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:53:37,867 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:53:37,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37 WrapperNode [2025-03-15 01:53:37,868 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:53:37,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:53:37,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:53:37,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:53:37,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,913 INFO L138 Inliner]: procedures = 364, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-03-15 01:53:37,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:53:37,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:53:37,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:53:37,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:53:37,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,930 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:53:37,942 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:53:37,942 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:53:37,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:53:37,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (1/1) ... [2025-03-15 01:53:37,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:53:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:37,974 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-15 01:53:37,976 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-15 01:53:37,996 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:53:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:53:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:53:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-03-15 01:53:37,997 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-03-15 01:53:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:53:37,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:53:37,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:53:37,998 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:53:38,131 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:53:38,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:53:38,283 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:53:38,283 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:53:38,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:53:38,300 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:53:38,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:53:38 BoogieIcfgContainer [2025-03-15 01:53:38,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:53:38,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:53:38,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:53:38,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:53:38,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:53:37" (1/3) ... [2025-03-15 01:53:38,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702648e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:53:38, skipping insertion in model container [2025-03-15 01:53:38,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:37" (2/3) ... [2025-03-15 01:53:38,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702648e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:53:38, skipping insertion in model container [2025-03-15 01:53:38,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:53:38" (3/3) ... [2025-03-15 01:53:38,307 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.i [2025-03-15 01:53:38,318 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:53:38,320 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.i that has 2 procedures, 102 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:53:38,321 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:53:38,355 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 01:53:38,379 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:53:38,387 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;@40873c66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:53:38,388 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 01:53:38,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:53:38,428 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2025-03-15 01:53:38,430 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 01:53:38,430 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:38,430 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] [2025-03-15 01:53:38,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:38,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:38,436 INFO L85 PathProgramCache]: Analyzing trace with hash 57489993, now seen corresponding path program 1 times [2025-03-15 01:53:38,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:38,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459672074] [2025-03-15 01:53:38,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:38,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:38,702 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-15 01:53:38,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:38,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459672074] [2025-03-15 01:53:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459672074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:38,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:53:38,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795744179] [2025-03-15 01:53:38,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:38,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:53:38,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:38,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:53:38,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:53:38,736 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 107 [2025-03-15 01:53:38,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 107 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-15 01:53:38,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:38,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 107 [2025-03-15 01:53:38,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:38,863 INFO L124 PetriNetUnfolderBase]: 54/298 cut-off events. [2025-03-15 01:53:38,863 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2025-03-15 01:53:38,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 298 events. 54/298 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1360 event pairs, 10 based on Foata normal form. 15/264 useless extension candidates. Maximal degree in co-relation 345. Up to 90 conditions per place. [2025-03-15 01:53:38,872 INFO L140 encePairwiseOnDemand]: 97/107 looper letters, 18 selfloop transitions, 3 changer transitions 13/104 dead transitions. [2025-03-15 01:53:38,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 104 transitions, 267 flow [2025-03-15 01:53:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:53:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:53:38,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 289 transitions. [2025-03-15 01:53:38,884 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9003115264797508 [2025-03-15 01:53:38,886 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, -6 predicate places. [2025-03-15 01:53:38,886 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 104 transitions, 267 flow [2025-03-15 01:53:38,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 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-15 01:53:38,887 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:38,887 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] [2025-03-15 01:53:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:53:38,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:38,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:38,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1287358008, now seen corresponding path program 1 times [2025-03-15 01:53:38,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:38,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575457283] [2025-03-15 01:53:38,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:38,999 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-15 01:53:38,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:38,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575457283] [2025-03-15 01:53:38,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575457283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:38,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:38,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:53:39,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966905058] [2025-03-15 01:53:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:39,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:53:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:39,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:53:39,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:53:39,003 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:39,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 104 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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-15 01:53:39,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:39,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:39,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:39,213 INFO L124 PetriNetUnfolderBase]: 138/513 cut-off events. [2025-03-15 01:53:39,214 INFO L125 PetriNetUnfolderBase]: For 107/131 co-relation queries the response was YES. [2025-03-15 01:53:39,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 513 events. 138/513 cut-off events. For 107/131 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2738 event pairs, 43 based on Foata normal form. 2/413 useless extension candidates. Maximal degree in co-relation 914. Up to 192 conditions per place. [2025-03-15 01:53:39,221 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 38 selfloop transitions, 7 changer transitions 13/122 dead transitions. [2025-03-15 01:53:39,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 122 transitions, 423 flow [2025-03-15 01:53:39,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:53:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:53:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 443 transitions. [2025-03-15 01:53:39,223 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8280373831775701 [2025-03-15 01:53:39,223 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, -2 predicate places. [2025-03-15 01:53:39,224 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 122 transitions, 423 flow [2025-03-15 01:53:39,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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-15 01:53:39,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:39,224 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] [2025-03-15 01:53:39,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:53:39,224 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:39,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash -502572795, now seen corresponding path program 1 times [2025-03-15 01:53:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126529100] [2025-03-15 01:53:39,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:39,332 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-15 01:53:39,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:39,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126529100] [2025-03-15 01:53:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126529100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:39,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:53:39,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445858316] [2025-03-15 01:53:39,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:39,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:53:39,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:39,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:53:39,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:53:39,335 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2025-03-15 01:53:39,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 122 transitions, 423 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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-15 01:53:39,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:39,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2025-03-15 01:53:39,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:39,539 INFO L124 PetriNetUnfolderBase]: 261/878 cut-off events. [2025-03-15 01:53:39,540 INFO L125 PetriNetUnfolderBase]: For 389/494 co-relation queries the response was YES. [2025-03-15 01:53:39,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 878 events. 261/878 cut-off events. For 389/494 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5267 event pairs, 87 based on Foata normal form. 2/696 useless extension candidates. Maximal degree in co-relation 1967. Up to 378 conditions per place. [2025-03-15 01:53:39,551 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 34 selfloop transitions, 4 changer transitions 11/136 dead transitions. [2025-03-15 01:53:39,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 136 transitions, 558 flow [2025-03-15 01:53:39,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:53:39,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:53:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2025-03-15 01:53:39,554 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.822429906542056 [2025-03-15 01:53:39,554 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 2 predicate places. [2025-03-15 01:53:39,554 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 136 transitions, 558 flow [2025-03-15 01:53:39,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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-15 01:53:39,555 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:39,555 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] [2025-03-15 01:53:39,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:53:39,555 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:39,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash 416369785, now seen corresponding path program 1 times [2025-03-15 01:53:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396080820] [2025-03-15 01:53:39,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:39,675 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-15 01:53:39,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:39,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396080820] [2025-03-15 01:53:39,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396080820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:39,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:39,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:53:39,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192527979] [2025-03-15 01:53:39,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:39,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:53:39,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:39,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:53:39,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:53:39,677 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2025-03-15 01:53:39,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 136 transitions, 558 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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-15 01:53:39,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:39,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2025-03-15 01:53:39,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:39,861 INFO L124 PetriNetUnfolderBase]: 448/1440 cut-off events. [2025-03-15 01:53:39,862 INFO L125 PetriNetUnfolderBase]: For 1651/1889 co-relation queries the response was YES. [2025-03-15 01:53:39,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 1440 events. 448/1440 cut-off events. For 1651/1889 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9016 event pairs, 193 based on Foata normal form. 28/1173 useless extension candidates. Maximal degree in co-relation 3797. Up to 634 conditions per place. [2025-03-15 01:53:39,873 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 54 selfloop transitions, 4 changer transitions 11/163 dead transitions. [2025-03-15 01:53:39,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 163 transitions, 856 flow [2025-03-15 01:53:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:53:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:53:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 449 transitions. [2025-03-15 01:53:39,875 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8392523364485981 [2025-03-15 01:53:39,877 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 6 predicate places. [2025-03-15 01:53:39,878 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 163 transitions, 856 flow [2025-03-15 01:53:39,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 0 states have call successors, (0), 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-15 01:53:39,878 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:39,878 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] [2025-03-15 01:53:39,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:53:39,878 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:39,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:39,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1554436515, now seen corresponding path program 1 times [2025-03-15 01:53:39,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:39,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091244338] [2025-03-15 01:53:39,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:39,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:39,991 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-15 01:53:39,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:39,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091244338] [2025-03-15 01:53:39,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091244338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:39,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:39,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:53:39,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354846644] [2025-03-15 01:53:39,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:39,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:53:39,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:39,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:53:39,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:53:39,993 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 107 [2025-03-15 01:53:39,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 163 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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-15 01:53:39,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:39,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 107 [2025-03-15 01:53:39,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:40,081 INFO L124 PetriNetUnfolderBase]: 160/631 cut-off events. [2025-03-15 01:53:40,081 INFO L125 PetriNetUnfolderBase]: For 2510/2835 co-relation queries the response was YES. [2025-03-15 01:53:40,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 631 events. 160/631 cut-off events. For 2510/2835 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3413 event pairs, 57 based on Foata normal form. 62/558 useless extension candidates. Maximal degree in co-relation 1811. Up to 275 conditions per place. [2025-03-15 01:53:40,085 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 7 selfloop transitions, 36 changer transitions 11/148 dead transitions. [2025-03-15 01:53:40,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 148 transitions, 844 flow [2025-03-15 01:53:40,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:53:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:53:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2025-03-15 01:53:40,087 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8660436137071651 [2025-03-15 01:53:40,087 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 7 predicate places. [2025-03-15 01:53:40,087 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 148 transitions, 844 flow [2025-03-15 01:53:40,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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-15 01:53:40,088 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:40,088 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] [2025-03-15 01:53:40,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:53:40,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:40,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:40,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2042046418, now seen corresponding path program 1 times [2025-03-15 01:53:40,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:40,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794396533] [2025-03-15 01:53:40,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:40,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:40,181 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-15 01:53:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794396533] [2025-03-15 01:53:40,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794396533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:40,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:53:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103589366] [2025-03-15 01:53:40,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:40,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:53:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:40,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:53:40,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:53:40,184 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:40,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 148 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 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-15 01:53:40,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:40,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:40,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:40,389 INFO L124 PetriNetUnfolderBase]: 230/1008 cut-off events. [2025-03-15 01:53:40,390 INFO L125 PetriNetUnfolderBase]: For 3918/4946 co-relation queries the response was YES. [2025-03-15 01:53:40,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3350 conditions, 1008 events. 230/1008 cut-off events. For 3918/4946 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6584 event pairs, 87 based on Foata normal form. 11/816 useless extension candidates. Maximal degree in co-relation 3231. Up to 413 conditions per place. [2025-03-15 01:53:40,394 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 94 selfloop transitions, 6 changer transitions 13/189 dead transitions. [2025-03-15 01:53:40,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 189 transitions, 1443 flow [2025-03-15 01:53:40,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:53:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:53:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 528 transitions. [2025-03-15 01:53:40,397 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.822429906542056 [2025-03-15 01:53:40,397 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 12 predicate places. [2025-03-15 01:53:40,397 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 189 transitions, 1443 flow [2025-03-15 01:53:40,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 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-15 01:53:40,398 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:40,398 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] [2025-03-15 01:53:40,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:53:40,398 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1449465568, now seen corresponding path program 1 times [2025-03-15 01:53:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137456829] [2025-03-15 01:53:40,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:40,463 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-15 01:53:40,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:40,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137456829] [2025-03-15 01:53:40,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137456829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:40,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:40,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:53:40,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958772410] [2025-03-15 01:53:40,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:40,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:53:40,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:40,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:53:40,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:53:40,465 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:40,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 189 transitions, 1443 flow. Second operand has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 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-15 01:53:40,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:40,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:40,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:40,612 INFO L124 PetriNetUnfolderBase]: 247/955 cut-off events. [2025-03-15 01:53:40,612 INFO L125 PetriNetUnfolderBase]: For 5792/7256 co-relation queries the response was YES. [2025-03-15 01:53:40,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 955 events. 247/955 cut-off events. For 5792/7256 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6204 event pairs, 81 based on Foata normal form. 33/779 useless extension candidates. Maximal degree in co-relation 3596. Up to 406 conditions per place. [2025-03-15 01:53:40,618 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 101 selfloop transitions, 11 changer transitions 13/201 dead transitions. [2025-03-15 01:53:40,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 201 transitions, 1781 flow [2025-03-15 01:53:40,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:53:40,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:53:40,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 593 transitions. [2025-03-15 01:53:40,620 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7917222963951935 [2025-03-15 01:53:40,622 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 18 predicate places. [2025-03-15 01:53:40,622 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 201 transitions, 1781 flow [2025-03-15 01:53:40,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 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-15 01:53:40,622 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:40,622 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] [2025-03-15 01:53:40,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:53:40,622 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:40,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:40,623 INFO L85 PathProgramCache]: Analyzing trace with hash 182559375, now seen corresponding path program 1 times [2025-03-15 01:53:40,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:40,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345871829] [2025-03-15 01:53:40,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:40,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:40,711 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-15 01:53:40,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:40,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345871829] [2025-03-15 01:53:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345871829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:40,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:40,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:53:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010582050] [2025-03-15 01:53:40,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:40,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:53:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:40,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:53:40,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:53:40,713 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:40,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 201 transitions, 1781 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 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-15 01:53:40,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:40,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:40,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:40,887 INFO L124 PetriNetUnfolderBase]: 246/1056 cut-off events. [2025-03-15 01:53:40,888 INFO L125 PetriNetUnfolderBase]: For 7264/8362 co-relation queries the response was YES. [2025-03-15 01:53:40,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4487 conditions, 1056 events. 246/1056 cut-off events. For 7264/8362 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7036 event pairs, 88 based on Foata normal form. 0/855 useless extension candidates. Maximal degree in co-relation 4338. Up to 447 conditions per place. [2025-03-15 01:53:40,895 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 103 selfloop transitions, 7 changer transitions 13/199 dead transitions. [2025-03-15 01:53:40,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 199 transitions, 1991 flow [2025-03-15 01:53:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:53:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:53:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 587 transitions. [2025-03-15 01:53:40,897 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7837116154873164 [2025-03-15 01:53:40,898 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 21 predicate places. [2025-03-15 01:53:40,898 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 199 transitions, 1991 flow [2025-03-15 01:53:40,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 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-15 01:53:40,898 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:40,898 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] [2025-03-15 01:53:40,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:53:40,898 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:40,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:40,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1282978617, now seen corresponding path program 1 times [2025-03-15 01:53:40,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:40,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517664574] [2025-03-15 01:53:40,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:40,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:41,007 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-15 01:53:41,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:41,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517664574] [2025-03-15 01:53:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517664574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:41,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:53:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943564280] [2025-03-15 01:53:41,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:53:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:41,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:53:41,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:53:41,008 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:41,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 199 transitions, 1991 flow. Second operand has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 states have internal predecessors, (482), 0 states have call successors, (0), 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-15 01:53:41,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:41,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:41,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:41,256 INFO L124 PetriNetUnfolderBase]: 265/1189 cut-off events. [2025-03-15 01:53:41,256 INFO L125 PetriNetUnfolderBase]: For 10324/11581 co-relation queries the response was YES. [2025-03-15 01:53:41,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5709 conditions, 1189 events. 265/1189 cut-off events. For 10324/11581 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 8164 event pairs, 106 based on Foata normal form. 7/969 useless extension candidates. Maximal degree in co-relation 5544. Up to 540 conditions per place. [2025-03-15 01:53:41,264 INFO L140 encePairwiseOnDemand]: 100/107 looper letters, 120 selfloop transitions, 13 changer transitions 15/224 dead transitions. [2025-03-15 01:53:41,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 224 transitions, 2632 flow [2025-03-15 01:53:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:53:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:53:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 686 transitions. [2025-03-15 01:53:41,266 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8014018691588785 [2025-03-15 01:53:41,266 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 28 predicate places. [2025-03-15 01:53:41,267 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 224 transitions, 2632 flow [2025-03-15 01:53:41,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.33333333333333) internal successors, (482), 6 states have internal predecessors, (482), 0 states have call successors, (0), 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-15 01:53:41,267 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:41,267 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:53:41,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:53:41,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:41,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:41,268 INFO L85 PathProgramCache]: Analyzing trace with hash 970714139, now seen corresponding path program 1 times [2025-03-15 01:53:41,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:41,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109136048] [2025-03-15 01:53:41,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:41,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:41,343 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-15 01:53:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109136048] [2025-03-15 01:53:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109136048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:53:41,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639020424] [2025-03-15 01:53:41,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:41,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:53:41,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:41,349 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-15 01:53:41,350 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-15 01:53:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:41,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:53:41,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:53:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:41,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:53:41,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639020424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:41,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:53:41,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:53:41,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150246739] [2025-03-15 01:53:41,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:41,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:53:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:41,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:53:41,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:53:41,506 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2025-03-15 01:53:41,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 224 transitions, 2632 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 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-15 01:53:41,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:41,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2025-03-15 01:53:41,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:41,717 INFO L124 PetriNetUnfolderBase]: 260/1005 cut-off events. [2025-03-15 01:53:41,717 INFO L125 PetriNetUnfolderBase]: For 16004/18344 co-relation queries the response was YES. [2025-03-15 01:53:41,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5360 conditions, 1005 events. 260/1005 cut-off events. For 16004/18344 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6734 event pairs, 65 based on Foata normal form. 109/919 useless extension candidates. Maximal degree in co-relation 5175. Up to 438 conditions per place. [2025-03-15 01:53:41,724 INFO L140 encePairwiseOnDemand]: 102/107 looper letters, 94 selfloop transitions, 6 changer transitions 15/232 dead transitions. [2025-03-15 01:53:41,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 232 transitions, 3014 flow [2025-03-15 01:53:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:53:41,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:53:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 603 transitions. [2025-03-15 01:53:41,726 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8050734312416555 [2025-03-15 01:53:41,726 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 33 predicate places. [2025-03-15 01:53:41,726 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 232 transitions, 3014 flow [2025-03-15 01:53:41,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 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-15 01:53:41,727 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:41,727 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:53:41,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:53:41,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-15 01:53:41,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:41,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:41,930 INFO L85 PathProgramCache]: Analyzing trace with hash 27367440, now seen corresponding path program 1 times [2025-03-15 01:53:41,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:41,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661917835] [2025-03-15 01:53:41,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:41,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:53:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661917835] [2025-03-15 01:53:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661917835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:53:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067697284] [2025-03-15 01:53:41,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:41,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:53:41,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:41,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:53:41,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:53:41,976 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 107 [2025-03-15 01:53:41,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 232 transitions, 3014 flow. Second operand has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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-15 01:53:41,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:41,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 107 [2025-03-15 01:53:41,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:42,111 INFO L124 PetriNetUnfolderBase]: 254/1143 cut-off events. [2025-03-15 01:53:42,111 INFO L125 PetriNetUnfolderBase]: For 13391/14879 co-relation queries the response was YES. [2025-03-15 01:53:42,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6258 conditions, 1143 events. 254/1143 cut-off events. For 13391/14879 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 7724 event pairs, 59 based on Foata normal form. 65/1029 useless extension candidates. Maximal degree in co-relation 6077. Up to 498 conditions per place. [2025-03-15 01:53:42,119 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 106 selfloop transitions, 8 changer transitions 15/246 dead transitions. [2025-03-15 01:53:42,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 246 transitions, 3572 flow [2025-03-15 01:53:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:53:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:53:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 429 transitions. [2025-03-15 01:53:42,121 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8018691588785046 [2025-03-15 01:53:42,121 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 36 predicate places. [2025-03-15 01:53:42,121 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 246 transitions, 3572 flow [2025-03-15 01:53:42,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.5) internal successors, (342), 4 states have internal predecessors, (342), 0 states have call successors, (0), 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-15 01:53:42,122 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:42,122 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:53:42,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:53:42,122 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:42,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:42,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1291905966, now seen corresponding path program 1 times [2025-03-15 01:53:42,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:42,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090801246] [2025-03-15 01:53:42,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:42,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:42,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:42,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090801246] [2025-03-15 01:53:42,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090801246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:53:42,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288057308] [2025-03-15 01:53:42,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:42,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:53:42,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:42,183 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-15 01:53:42,184 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-15 01:53:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:42,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:53:42,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:53:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:42,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:53:42,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:42,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288057308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:53:42,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:53:42,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 01:53:42,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899511404] [2025-03-15 01:53:42,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:53:42,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:53:42,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:42,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:53:42,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:53:42,368 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:42,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 246 transitions, 3572 flow. Second operand has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 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-15 01:53:42,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:42,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:42,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:42,777 INFO L124 PetriNetUnfolderBase]: 404/1867 cut-off events. [2025-03-15 01:53:42,777 INFO L125 PetriNetUnfolderBase]: For 23321/25484 co-relation queries the response was YES. [2025-03-15 01:53:42,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10948 conditions, 1867 events. 404/1867 cut-off events. For 23321/25484 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13618 event pairs, 110 based on Foata normal form. 18/1630 useless extension candidates. Maximal degree in co-relation 10680. Up to 798 conditions per place. [2025-03-15 01:53:42,800 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 216 selfloop transitions, 43 changer transitions 19/352 dead transitions. [2025-03-15 01:53:42,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 352 transitions, 6178 flow [2025-03-15 01:53:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 01:53:42,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 01:53:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1521 transitions. [2025-03-15 01:53:42,805 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7897196261682243 [2025-03-15 01:53:42,806 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 53 predicate places. [2025-03-15 01:53:42,806 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 352 transitions, 6178 flow [2025-03-15 01:53:42,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 81.81818181818181) internal successors, (900), 11 states have internal predecessors, (900), 0 states have call successors, (0), 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-15 01:53:42,807 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:42,807 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:53:42,815 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-15 01:53:43,011 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,SelfDestructingSolverStorable11 [2025-03-15 01:53:43,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:43,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:43,012 INFO L85 PathProgramCache]: Analyzing trace with hash 23460841, now seen corresponding path program 1 times [2025-03-15 01:53:43,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:43,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572841594] [2025-03-15 01:53:43,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:43,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572841594] [2025-03-15 01:53:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572841594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:53:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028099697] [2025-03-15 01:53:43,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:43,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:53:43,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:43,101 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-15 01:53:43,102 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-15 01:53:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:43,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:53:43,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:53:43,206 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:43,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:53:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028099697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:43,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:53:43,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:53:43,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422226468] [2025-03-15 01:53:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:43,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:53:43,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:43,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:53:43,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:53:43,207 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2025-03-15 01:53:43,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 352 transitions, 6178 flow. Second operand has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 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-15 01:53:43,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:43,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2025-03-15 01:53:43,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:43,482 INFO L124 PetriNetUnfolderBase]: 383/1557 cut-off events. [2025-03-15 01:53:43,483 INFO L125 PetriNetUnfolderBase]: For 29572/32659 co-relation queries the response was YES. [2025-03-15 01:53:43,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10188 conditions, 1557 events. 383/1557 cut-off events. For 29572/32659 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 11050 event pairs, 56 based on Foata normal form. 93/1432 useless extension candidates. Maximal degree in co-relation 9911. Up to 693 conditions per place. [2025-03-15 01:53:43,498 INFO L140 encePairwiseOnDemand]: 103/107 looper letters, 174 selfloop transitions, 5 changer transitions 19/357 dead transitions. [2025-03-15 01:53:43,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 357 transitions, 6698 flow [2025-03-15 01:53:43,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:53:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:53:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 353 transitions. [2025-03-15 01:53:43,504 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8247663551401869 [2025-03-15 01:53:43,505 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 55 predicate places. [2025-03-15 01:53:43,505 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 357 transitions, 6698 flow [2025-03-15 01:53:43,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 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-15 01:53:43,505 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:43,505 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:53:43,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 01:53:43,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:53:43,706 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:43,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:43,707 INFO L85 PathProgramCache]: Analyzing trace with hash 727286382, now seen corresponding path program 1 times [2025-03-15 01:53:43,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:43,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029488789] [2025-03-15 01:53:43,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:43,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:53:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029488789] [2025-03-15 01:53:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029488789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:53:43,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:53:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:53:43,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816842327] [2025-03-15 01:53:43,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:53:43,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:53:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:43,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:53:43,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:53:43,752 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 107 [2025-03-15 01:53:43,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 357 transitions, 6698 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 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-15 01:53:43,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:43,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 107 [2025-03-15 01:53:43,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:43,978 INFO L124 PetriNetUnfolderBase]: 390/1539 cut-off events. [2025-03-15 01:53:43,979 INFO L125 PetriNetUnfolderBase]: For 28982/32019 co-relation queries the response was YES. [2025-03-15 01:53:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10836 conditions, 1539 events. 390/1539 cut-off events. For 28982/32019 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10682 event pairs, 63 based on Foata normal form. 121/1462 useless extension candidates. Maximal degree in co-relation 10534. Up to 681 conditions per place. [2025-03-15 01:53:43,990 INFO L140 encePairwiseOnDemand]: 101/107 looper letters, 189 selfloop transitions, 8 changer transitions 19/375 dead transitions. [2025-03-15 01:53:43,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 375 transitions, 7628 flow [2025-03-15 01:53:43,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:53:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:53:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2025-03-15 01:53:43,992 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8186915887850468 [2025-03-15 01:53:43,992 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 58 predicate places. [2025-03-15 01:53:43,992 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 375 transitions, 7628 flow [2025-03-15 01:53:43,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 0 states have call successors, (0), 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-15 01:53:43,993 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:43,993 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:53:43,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:53:43,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:43,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:43,994 INFO L85 PathProgramCache]: Analyzing trace with hash 368667839, now seen corresponding path program 1 times [2025-03-15 01:53:43,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:43,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27012697] [2025-03-15 01:53:43,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:43,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:44,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:44,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27012697] [2025-03-15 01:53:44,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27012697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:53:44,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918469179] [2025-03-15 01:53:44,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:44,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:53:44,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:44,064 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-15 01:53:44,066 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-15 01:53:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:44,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 01:53:44,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:53:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:44,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:53:44,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:44,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918469179] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:53:44,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:53:44,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-15 01:53:44,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675912077] [2025-03-15 01:53:44,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:53:44,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:53:44,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:44,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:53:44,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:53:44,267 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:44,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 375 transitions, 7628 flow. Second operand has 14 states, 14 states have (on average 81.21428571428571) internal successors, (1137), 14 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:53:44,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:44,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:44,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:45,203 INFO L124 PetriNetUnfolderBase]: 869/3897 cut-off events. [2025-03-15 01:53:45,203 INFO L125 PetriNetUnfolderBase]: For 77679/84573 co-relation queries the response was YES. [2025-03-15 01:53:45,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27334 conditions, 3897 events. 869/3897 cut-off events. For 77679/84573 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 36187 event pairs, 169 based on Foata normal form. 60/3473 useless extension candidates. Maximal degree in co-relation 26419. Up to 1605 conditions per place. [2025-03-15 01:53:45,232 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 582 selfloop transitions, 84 changer transitions 55/793 dead transitions. [2025-03-15 01:53:45,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 793 transitions, 19816 flow [2025-03-15 01:53:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-15 01:53:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-15 01:53:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2324 transitions. [2025-03-15 01:53:45,238 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8044305988231222 [2025-03-15 01:53:45,239 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 84 predicate places. [2025-03-15 01:53:45,239 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 793 transitions, 19816 flow [2025-03-15 01:53:45,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.21428571428571) internal successors, (1137), 14 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:53:45,239 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:45,240 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:53:45,246 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-15 01:53:45,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-15 01:53:45,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:45,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:45,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1152670856, now seen corresponding path program 1 times [2025-03-15 01:53:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071500364] [2025-03-15 01:53:45,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:45,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071500364] [2025-03-15 01:53:45,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071500364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:53:45,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718558102] [2025-03-15 01:53:45,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:45,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:53:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:45,572 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-15 01:53:45,573 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-15 01:53:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:45,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 01:53:45,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:53:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:45,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:53:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:45,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718558102] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:53:45,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:53:45,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 01:53:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953324480] [2025-03-15 01:53:45,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:53:45,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-15 01:53:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:45,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-15 01:53:45,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-03-15 01:53:45,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:45,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 793 transitions, 19816 flow. Second operand has 19 states, 19 states have (on average 81.47368421052632) internal successors, (1548), 19 states have internal predecessors, (1548), 0 states have call successors, (0), 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-15 01:53:45,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:45,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:45,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:49,103 INFO L124 PetriNetUnfolderBase]: 2204/10367 cut-off events. [2025-03-15 01:53:49,104 INFO L125 PetriNetUnfolderBase]: For 213197/226196 co-relation queries the response was YES. [2025-03-15 01:53:49,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75419 conditions, 10367 events. 2204/10367 cut-off events. For 213197/226196 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 107550 event pairs, 493 based on Foata normal form. 124/9232 useless extension candidates. Maximal degree in co-relation 72808. Up to 4528 conditions per place. [2025-03-15 01:53:49,216 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 1393 selfloop transitions, 208 changer transitions 141/1814 dead transitions. [2025-03-15 01:53:49,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 1814 transitions, 51885 flow [2025-03-15 01:53:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-15 01:53:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-15 01:53:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4464 transitions. [2025-03-15 01:53:49,224 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8023005032350827 [2025-03-15 01:53:49,225 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 135 predicate places. [2025-03-15 01:53:49,225 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 1814 transitions, 51885 flow [2025-03-15 01:53:49,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 81.47368421052632) internal successors, (1548), 19 states have internal predecessors, (1548), 0 states have call successors, (0), 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-15 01:53:49,227 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:53:49,227 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:53:49,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 01:53:49,427 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,SelfDestructingSolverStorable15 [2025-03-15 01:53:49,428 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:53:49,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:53:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1379406865, now seen corresponding path program 1 times [2025-03-15 01:53:49,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:53:49,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118904139] [2025-03-15 01:53:49,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:49,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:53:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:49,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:53:49,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118904139] [2025-03-15 01:53:49,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118904139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:53:49,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041710499] [2025-03-15 01:53:49,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:53:49,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:53:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:49,702 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-15 01:53:49,711 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-15 01:53:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:53:49,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-15 01:53:49,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:53:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:49,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:53:50,203 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:53:50,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041710499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:53:50,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:53:50,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2025-03-15 01:53:50,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383938442] [2025-03-15 01:53:50,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:53:50,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 01:53:50,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:53:50,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 01:53:50,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2025-03-15 01:53:50,206 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:53:50,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 1814 transitions, 51885 flow. Second operand has 30 states, 30 states have (on average 81.1) internal successors, (2433), 30 states have internal predecessors, (2433), 0 states have call successors, (0), 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-15 01:53:50,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:53:50,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:53:50,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:53:52,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([275] L1330-->L1330-3: Formula: (and (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#mymutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#mymutex~0.base_21|) |v_~#mymutex~0.offset_21| 0))) (= |v_thread_function_mutexThread1of1ForFork0_#t~ret33_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#mymutex~0.base=|v_~#mymutex~0.base_21|, ~#mymutex~0.offset=|v_~#mymutex~0.offset_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, thread_function_mutexThread1of1ForFork0_#t~ret33=|v_thread_function_mutexThread1of1ForFork0_#t~ret33_1|, ~#mymutex~0.offset=|v_~#mymutex~0.offset_21|, ~#mymutex~0.base=|v_~#mymutex~0.base_21|} AuxVars[] AssignedVars[#pthreadsMutex, thread_function_mutexThread1of1ForFork0_#t~ret33][626], [72#L1349true, 111#true, 139#true, 2927#(and (<= ~myglobal~0 6) (<= thread_function_mutexThread1of1ForFork0_~j~0 6)), 359#(<= |ULTIMATE.start_main_~i~1#1| 19), thread_function_mutexThread1of1ForFork0InUse, 108#true, 117#true, 159#(and (<= 1 thread_function_mutexThread1of1ForFork0_~j~0) (<= 1 ~myglobal~0)), 991#true, 364#true, 937#(<= 0 (+ thread_function_mutexThread1of1ForFork0_~i~0 2147483648)), 2063#(and (<= ~myglobal~0 2147483644) (<= thread_function_mutexThread1of1ForFork0_~j~0 2147483644)), 40#L1330-3true, 986#(<= thread_function_mutexThread1of1ForFork0_~i~0 19), 138#(and (<= 1 thread_function_mutexThread1of1ForFork0_~j~0) (<= 1 ~myglobal~0)), 160#true, 123#true, 129#true, 176#(<= 1 |ULTIMATE.start_main_~i~1#1|)]) [2025-03-15 01:53:52,350 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2025-03-15 01:53:52,350 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-03-15 01:53:52,350 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-15 01:53:52,350 INFO L297 olderBase$Statistics]: existing Event has 107 ancestors and is cut-off event [2025-03-15 01:53:55,379 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([275] L1330-->L1330-3: Formula: (and (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#mymutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#mymutex~0.base_21|) |v_~#mymutex~0.offset_21| 0))) (= |v_thread_function_mutexThread1of1ForFork0_#t~ret33_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#mymutex~0.base=|v_~#mymutex~0.base_21|, ~#mymutex~0.offset=|v_~#mymutex~0.offset_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, thread_function_mutexThread1of1ForFork0_#t~ret33=|v_thread_function_mutexThread1of1ForFork0_#t~ret33_1|, ~#mymutex~0.offset=|v_~#mymutex~0.offset_21|, ~#mymutex~0.base=|v_~#mymutex~0.base_21|} AuxVars[] AssignedVars[#pthreadsMutex, thread_function_mutexThread1of1ForFork0_#t~ret33][1794], [111#true, 139#true, 83#L1347-6true, 2977#(and (<= ~myglobal~0 2147483642) (<= thread_function_mutexThread1of1ForFork0_~j~0 2147483642)), thread_function_mutexThread1of1ForFork0InUse, 108#true, 117#true, 159#(and (<= 1 thread_function_mutexThread1of1ForFork0_~j~0) (<= 1 ~myglobal~0)), 991#true, 364#true, 937#(<= 0 (+ thread_function_mutexThread1of1ForFork0_~i~0 2147483648)), 40#L1330-3true, 1439#true, 986#(<= thread_function_mutexThread1of1ForFork0_~i~0 19), 160#true, 138#(and (<= 1 thread_function_mutexThread1of1ForFork0_~j~0) (<= 1 ~myglobal~0)), 123#true, 357#true, 129#true, 176#(<= 1 |ULTIMATE.start_main_~i~1#1|)]) [2025-03-15 01:53:55,380 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2025-03-15 01:53:55,380 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2025-03-15 01:53:55,380 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 01:53:55,380 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2025-03-15 01:53:55,380 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([275] L1330-->L1330-3: Formula: (and (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#mymutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#mymutex~0.base_21|) |v_~#mymutex~0.offset_21| 0))) (= |v_thread_function_mutexThread1of1ForFork0_#t~ret33_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#mymutex~0.base=|v_~#mymutex~0.base_21|, ~#mymutex~0.offset=|v_~#mymutex~0.offset_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, thread_function_mutexThread1of1ForFork0_#t~ret33=|v_thread_function_mutexThread1of1ForFork0_#t~ret33_1|, ~#mymutex~0.offset=|v_~#mymutex~0.offset_21|, ~#mymutex~0.base=|v_~#mymutex~0.base_21|} AuxVars[] AssignedVars[#pthreadsMutex, thread_function_mutexThread1of1ForFork0_#t~ret33][1794], [139#true, 111#true, 2977#(and (<= ~myglobal~0 2147483642) (<= thread_function_mutexThread1of1ForFork0_~j~0 2147483642)), thread_function_mutexThread1of1ForFork0InUse, 108#true, 117#true, 159#(and (<= 1 thread_function_mutexThread1of1ForFork0_~j~0) (<= 1 ~myglobal~0)), 991#true, 364#true, 937#(<= 0 (+ thread_function_mutexThread1of1ForFork0_~i~0 2147483648)), 40#L1330-3true, 1439#true, 986#(<= thread_function_mutexThread1of1ForFork0_~i~0 19), 90#L1353true, 138#(and (<= 1 thread_function_mutexThread1of1ForFork0_~j~0) (<= 1 ~myglobal~0)), 160#true, 123#true, 129#true, 357#true, 176#(<= 1 |ULTIMATE.start_main_~i~1#1|)]) [2025-03-15 01:53:55,380 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2025-03-15 01:53:55,380 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2025-03-15 01:53:55,380 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 01:53:55,380 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2025-03-15 01:54:06,511 INFO L124 PetriNetUnfolderBase]: 7208/36217 cut-off events. [2025-03-15 01:54:06,511 INFO L125 PetriNetUnfolderBase]: For 775467/809072 co-relation queries the response was YES. [2025-03-15 01:54:06,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269993 conditions, 36217 events. 7208/36217 cut-off events. For 775467/809072 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 450132 event pairs, 1842 based on Foata normal form. 309/32282 useless extension candidates. Maximal degree in co-relation 260298. Up to 16912 conditions per place. [2025-03-15 01:54:07,010 INFO L140 encePairwiseOnDemand]: 98/107 looper letters, 4444 selfloop transitions, 616 changer transitions 501/5633 dead transitions. [2025-03-15 01:54:07,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 5633 transitions, 178625 flow [2025-03-15 01:54:07,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2025-03-15 01:54:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2025-03-15 01:54:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 10492 transitions. [2025-03-15 01:54:07,017 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8103807831930177 [2025-03-15 01:54:07,018 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 255 predicate places. [2025-03-15 01:54:07,018 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 5633 transitions, 178625 flow [2025-03-15 01:54:07,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 81.1) internal successors, (2433), 30 states have internal predecessors, (2433), 0 states have call successors, (0), 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-15 01:54:07,019 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:07,019 INFO L221 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-03-15 01:54:07,025 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-15 01:54:07,223 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,SelfDestructingSolverStorable16 [2025-03-15 01:54:07,223 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:07,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:07,224 INFO L85 PathProgramCache]: Analyzing trace with hash -515460241, now seen corresponding path program 2 times [2025-03-15 01:54:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389541559] [2025-03-15 01:54:07,224 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:07,249 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:54:07,249 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:07,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:07,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389541559] [2025-03-15 01:54:07,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389541559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:07,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889893952] [2025-03-15 01:54:07,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:07,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:07,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:07,808 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-15 01:54:07,810 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-15 01:54:07,923 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:54:07,923 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:07,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-15 01:54:07,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:08,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:54:08,427 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:08,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889893952] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:54:08,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:54:08,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2025-03-15 01:54:08,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237261768] [2025-03-15 01:54:08,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:54:08,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-15 01:54:08,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:08,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-15 01:54:08,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=882, Unknown=0, NotChecked=0, Total=1332 [2025-03-15 01:54:08,431 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:54:08,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 5633 transitions, 178625 flow. Second operand has 37 states, 37 states have (on average 82.0) internal successors, (3034), 37 states have internal predecessors, (3034), 0 states have call successors, (0), 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-15 01:54:08,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:08,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:54:08,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:48,242 INFO L124 PetriNetUnfolderBase]: 24641/127517 cut-off events. [2025-03-15 01:56:48,242 INFO L125 PetriNetUnfolderBase]: For 3006530/3102944 co-relation queries the response was YES. [2025-03-15 01:56:49,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 988557 conditions, 127517 events. 24641/127517 cut-off events. For 3006530/3102944 co-relation queries the response was YES. Maximal size of possible extension queue 970. Compared 1820578 event pairs, 6571 based on Foata normal form. 998/113637 useless extension candidates. Maximal degree in co-relation 949527. Up to 62421 conditions per place. [2025-03-15 01:56:50,630 INFO L140 encePairwiseOnDemand]: 99/107 looper letters, 15509 selfloop transitions, 2426 changer transitions 1899/19906 dead transitions. [2025-03-15 01:56:50,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 19906 transitions, 669580 flow [2025-03-15 01:56:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2025-03-15 01:56:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2025-03-15 01:56:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 13377 transitions. [2025-03-15 01:56:50,673 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8014018691588785 [2025-03-15 01:56:50,674 INFO L298 CegarLoopForPetriNet]: 105 programPoint places, 410 predicate places. [2025-03-15 01:56:50,674 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 19906 transitions, 669580 flow [2025-03-15 01:56:50,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 82.0) internal successors, (3034), 37 states have internal predecessors, (3034), 0 states have call successors, (0), 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-15 01:56:50,680 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:50,680 INFO L221 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:50,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:56:50,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:56:50,882 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:56:50,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:50,884 INFO L85 PathProgramCache]: Analyzing trace with hash -636038072, now seen corresponding path program 2 times [2025-03-15 01:56:50,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:50,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876274986] [2025-03-15 01:56:50,891 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:56:50,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:51,022 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:56:51,022 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:56:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876274986] [2025-03-15 01:56:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876274986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:56:51,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954456415] [2025-03-15 01:56:51,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:56:51,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:56:51,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:56:51,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:56:51,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 01:56:52,120 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:56:52,120 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:52,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-15 01:56:52,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:56:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:56:52,347 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:56:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:56:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954456415] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:56:52,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:56:52,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2025-03-15 01:56:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660334849] [2025-03-15 01:56:52,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:56:52,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-15 01:56:52,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:52,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-15 01:56:52,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1281, Unknown=0, NotChecked=0, Total=1806 [2025-03-15 01:56:52,859 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 107 [2025-03-15 01:56:52,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 19906 transitions, 669580 flow. Second operand has 43 states, 43 states have (on average 81.5813953488372) internal successors, (3508), 43 states have internal predecessors, (3508), 0 states have call successors, (0), 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-15 01:56:52,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:52,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 107 [2025-03-15 01:56:52,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 02:07:08,400 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 02:07:08,404 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-15 02:07:09,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2025-03-15 02:07:09,130 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 13 remaining) [2025-03-15 02:07:09,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 02:07:09,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:07:09,333 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). [2025-03-15 02:07:09,336 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-15 02:07:09,336 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-15 02:07:09,337 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-15 02:07:09,337 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-15 02:07:09,337 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 13 remaining) [2025-03-15 02:07:09,337 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-15 02:07:09,337 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-15 02:07:09,338 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-15 02:07:09,338 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-15 02:07:09,338 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-15 02:07:09,338 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-15 02:07:09,338 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-15 02:07:09,339 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:07:09,348 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:07:09,349 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:07:09,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:07:09 BasicIcfg [2025-03-15 02:07:09,356 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:07:09,357 INFO L158 Benchmark]: Toolchain (without parser) took 811959.12ms. Allocated memory was 71.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 41.3MB in the beginning and 415.2MB in the end (delta: -373.9MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-03-15 02:07:09,358 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:07:09,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.11ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 27.2MB in the end (delta: 13.9MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2025-03-15 02:07:09,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.55ms. Allocated memory is still 71.3MB. Free memory was 27.2MB in the beginning and 25.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:07:09,359 INFO L158 Benchmark]: Boogie Preprocessor took 28.45ms. Allocated memory is still 71.3MB. Free memory was 25.2MB in the beginning and 24.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 02:07:09,359 INFO L158 Benchmark]: RCFGBuilder took 358.32ms. Allocated memory is still 71.3MB. Free memory was 24.0MB in the beginning and 30.5MB in the end (delta: -6.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2025-03-15 02:07:09,360 INFO L158 Benchmark]: TraceAbstraction took 811053.84ms. Allocated memory was 71.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 29.3MB in the beginning and 415.2MB in the end (delta: -386.0MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2025-03-15 02:07:09,362 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.15ms. Allocated memory is still 71.3MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 469.11ms. Allocated memory is still 71.3MB. Free memory was 41.2MB in the beginning and 27.2MB in the end (delta: 13.9MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.55ms. Allocated memory is still 71.3MB. Free memory was 27.2MB in the beginning and 25.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.45ms. Allocated memory is still 71.3MB. Free memory was 25.2MB in the beginning and 24.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 358.32ms. Allocated memory is still 71.3MB. Free memory was 24.0MB in the beginning and 30.5MB in the end (delta: -6.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * TraceAbstraction took 811053.84ms. Allocated memory was 71.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 29.3MB in the beginning and 415.2MB in the end (delta: -386.0MB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1327]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1350]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1350]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1347]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1347]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1343]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1327]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1323]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - TimeoutResultAtElement [Line: 1323]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (43states, 78/107 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 774116 conditions, 92765 events (17879/92764 cut-off events. For 2785679/2903867 co-relation queries the response was YES. Maximal size of possible extension queue 2073. Compared 1492736 event pairs, 4517 based on Foata normal form. 1775/86131 useless extension candidates. Maximal degree in co-relation 747164. Up to 41834 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 131 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 811.0s, OverallIterations: 19, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 802.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5918 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5918 mSDsluCounter, 417 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291 mSDsCounter, 235 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4348 IncrementalHoareTripleChecker+Invalid, 4583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 235 mSolverCounterUnsat, 126 mSDtfsCounter, 4348 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2177 GetRequests, 1583 SyntacticMatches, 0 SemanticMatches, 594 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28961 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=669580occurred in iteration=18, InterpolantAutomatonStates: 444, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2339 NumberOfCodeBlocks, 2339 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 3071 ConstructedInterpolants, 0 QuantifiedInterpolants, 7301 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1888 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 33 InterpolantComputations, 13 PerfectInterpolantSequences, 50/1121 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 Completed graceful shutdown