/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/weaver/popl20-more-buffer-mult.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:49:57,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:49:57,516 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 02:49:57,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:49:57,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:49:57,567 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:49:57,567 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:49:57,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:49:57,568 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:49:57,568 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:49:57,584 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:49:57,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:49:57,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:49:57,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:49:57,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:49:57,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:49:57,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:49:57,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:49:57,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:49:57,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:49:57,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:49:57,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:49:57,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:49:57,589 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:49:57,589 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 02:49:57,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:49:57,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:49:57,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:49:57,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:49:57,875 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:49:57,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2025-03-15 02:49:59,190 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8575bba/26ef8b047c70496d9e148b88c5dc032f/FLAG2c55b8c2e [2025-03-15 02:49:59,394 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:49:59,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2025-03-15 02:49:59,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8575bba/26ef8b047c70496d9e148b88c5dc032f/FLAG2c55b8c2e [2025-03-15 02:49:59,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d8575bba/26ef8b047c70496d9e148b88c5dc032f [2025-03-15 02:49:59,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:49:59,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:49:59,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:49:59,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:49:59,429 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:49:59,430 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,431 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1669895d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59, skipping insertion in model container [2025-03-15 02:49:59,431 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:49:59,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:49:59,611 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:49:59,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:49:59,659 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:49:59,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59 WrapperNode [2025-03-15 02:49:59,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:49:59,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:49:59,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:49:59,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:49:59,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,693 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 326 [2025-03-15 02:49:59,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:49:59,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:49:59,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:49:59,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:49:59,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,719 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,720 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,730 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:49:59,731 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:49:59,732 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:49:59,732 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:49:59,732 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (1/1) ... [2025-03-15 02:49:59,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:49:59,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:49:59,758 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 02:49:59,760 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 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:49:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:49:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 02:49:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 02:49:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:49:59,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:49:59,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:49:59,784 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 02:49:59,858 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:49:59,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:50:00,341 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:50:00,341 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:50:00,679 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:50:00,679 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:50:00,680 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:50:00 BoogieIcfgContainer [2025-03-15 02:50:00,680 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:50:00,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:50:00,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:50:00,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:50:00,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:49:59" (1/3) ... [2025-03-15 02:50:00,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c4d12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:50:00, skipping insertion in model container [2025-03-15 02:50:00,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:49:59" (2/3) ... [2025-03-15 02:50:00,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65c4d12c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:50:00, skipping insertion in model container [2025-03-15 02:50:00,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:50:00" (3/3) ... [2025-03-15 02:50:00,693 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2025-03-15 02:50:00,710 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:50:00,713 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-buffer-mult.wvr.c that has 5 procedures, 244 locations, 1 initial locations, 6 loop locations, and 30 error locations. [2025-03-15 02:50:00,713 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:50:00,837 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 02:50:00,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:50:00,888 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;@63db64e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:50:00,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-15 02:50:00,932 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:50:00,932 INFO L124 PetriNetUnfolderBase]: 2/88 cut-off events. [2025-03-15 02:50:00,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:50:00,936 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:00,936 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:50:00,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:00,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:00,943 INFO L85 PathProgramCache]: Analyzing trace with hash 736584222, now seen corresponding path program 1 times [2025-03-15 02:50:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:00,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048851108] [2025-03-15 02:50:00,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:00,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:01,289 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 02:50:01,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048851108] [2025-03-15 02:50:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048851108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:50:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:50:01,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610408831] [2025-03-15 02:50:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:01,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:50:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:01,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:50:01,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:50:01,326 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 255 [2025-03-15 02:50:01,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 255 transitions, 538 flow. Second operand has 4 states, 4 states have (on average 181.5) internal successors, (726), 4 states have internal predecessors, (726), 0 states have call successors, (0), 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 02:50:01,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:01,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 255 [2025-03-15 02:50:01,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:04,748 INFO L124 PetriNetUnfolderBase]: 13075/18745 cut-off events. [2025-03-15 02:50:04,749 INFO L125 PetriNetUnfolderBase]: For 2882/2882 co-relation queries the response was YES. [2025-03-15 02:50:04,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36734 conditions, 18745 events. 13075/18745 cut-off events. For 2882/2882 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 120336 event pairs, 7753 based on Foata normal form. 7/7067 useless extension candidates. Maximal degree in co-relation 35920. Up to 16289 conditions per place. [2025-03-15 02:50:04,996 INFO L140 encePairwiseOnDemand]: 226/255 looper letters, 67 selfloop transitions, 10 changer transitions 14/248 dead transitions. [2025-03-15 02:50:04,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 248 transitions, 676 flow [2025-03-15 02:50:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:50:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:50:05,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 997 transitions. [2025-03-15 02:50:05,009 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7819607843137255 [2025-03-15 02:50:05,014 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, -15 predicate places. [2025-03-15 02:50:05,015 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 248 transitions, 676 flow [2025-03-15 02:50:05,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 181.5) internal successors, (726), 4 states have internal predecessors, (726), 0 states have call successors, (0), 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 02:50:05,016 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:05,016 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:50:05,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:50:05,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:05,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:05,018 INFO L85 PathProgramCache]: Analyzing trace with hash -270404989, now seen corresponding path program 1 times [2025-03-15 02:50:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978993266] [2025-03-15 02:50:05,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:05,261 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 02:50:05,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:05,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978993266] [2025-03-15 02:50:05,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978993266] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:50:05,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446652504] [2025-03-15 02:50:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:05,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:05,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:50:05,267 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 02:50:05,269 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 02:50:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:05,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:50:05,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:50:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:05,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:50:05,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446652504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:05,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:50:05,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:50:05,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923716082] [2025-03-15 02:50:05,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:05,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:50:05,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:05,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:50:05,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:50:05,478 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 255 [2025-03-15 02:50:05,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 248 transitions, 676 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 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 02:50:05,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:05,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 255 [2025-03-15 02:50:05,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:07,959 INFO L124 PetriNetUnfolderBase]: 13075/18743 cut-off events. [2025-03-15 02:50:07,959 INFO L125 PetriNetUnfolderBase]: For 3449/3899 co-relation queries the response was YES. [2025-03-15 02:50:08,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53033 conditions, 18743 events. 13075/18743 cut-off events. For 3449/3899 co-relation queries the response was YES. Maximal size of possible extension queue 1869. Compared 120576 event pairs, 7753 based on Foata normal form. 0/7060 useless extension candidates. Maximal degree in co-relation 51979. Up to 16287 conditions per place. [2025-03-15 02:50:08,251 INFO L140 encePairwiseOnDemand]: 243/255 looper letters, 59 selfloop transitions, 16 changer transitions 14/246 dead transitions. [2025-03-15 02:50:08,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 246 transitions, 820 flow [2025-03-15 02:50:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:50:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:50:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1338 transitions. [2025-03-15 02:50:08,254 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7495798319327731 [2025-03-15 02:50:08,254 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, -11 predicate places. [2025-03-15 02:50:08,255 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 246 transitions, 820 flow [2025-03-15 02:50:08,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 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 02:50:08,255 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:08,255 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, 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 02:50:08,264 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 02:50:08,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:08,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash 207380929, now seen corresponding path program 1 times [2025-03-15 02:50:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:08,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332577205] [2025-03-15 02:50:08,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:08,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332577205] [2025-03-15 02:50:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332577205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:50:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933339729] [2025-03-15 02:50:08,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:08,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:08,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:50:08,597 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 02:50:08,597 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 02:50:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:08,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:50:08,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:50:08,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:08,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:50:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933339729] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:50:08,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:50:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:50:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146934686] [2025-03-15 02:50:08,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:50:08,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:50:08,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:08,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:50:08,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:50:08,797 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 255 [2025-03-15 02:50:08,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 246 transitions, 820 flow. Second operand has 12 states, 12 states have (on average 182.83333333333334) internal successors, (2194), 12 states have internal predecessors, (2194), 0 states have call successors, (0), 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 02:50:08,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:08,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 255 [2025-03-15 02:50:08,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:11,450 INFO L124 PetriNetUnfolderBase]: 13081/18813 cut-off events. [2025-03-15 02:50:11,450 INFO L125 PetriNetUnfolderBase]: For 4568/5468 co-relation queries the response was YES. [2025-03-15 02:50:11,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69562 conditions, 18813 events. 13081/18813 cut-off events. For 4568/5468 co-relation queries the response was YES. Maximal size of possible extension queue 1865. Compared 121063 event pairs, 7753 based on Foata normal form. 0/7124 useless extension candidates. Maximal degree in co-relation 68038. Up to 16339 conditions per place. [2025-03-15 02:50:11,632 INFO L140 encePairwiseOnDemand]: 241/255 looper letters, 91 selfloop transitions, 36 changer transitions 14/298 dead transitions. [2025-03-15 02:50:11,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 298 transitions, 1388 flow [2025-03-15 02:50:11,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:50:11,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:50:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2654 transitions. [2025-03-15 02:50:11,637 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7434173669467787 [2025-03-15 02:50:11,637 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 2 predicate places. [2025-03-15 02:50:11,637 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 298 transitions, 1388 flow [2025-03-15 02:50:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 182.83333333333334) internal successors, (2194), 12 states have internal predecessors, (2194), 0 states have call successors, (0), 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 02:50:11,639 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:11,639 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:50:11,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-15 02:50:11,843 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,SelfDestructingSolverStorable2 [2025-03-15 02:50:11,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:11,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:11,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1577270286, now seen corresponding path program 2 times [2025-03-15 02:50:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842114469] [2025-03-15 02:50:11,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:50:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:11,864 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:50:11,865 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:50:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:50:11,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842114469] [2025-03-15 02:50:11,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842114469] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:50:11,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942467786] [2025-03-15 02:50:11,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:50:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:50:11,997 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 02:50:11,999 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 02:50:12,072 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:50:12,073 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:50:12,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:50:12,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:50:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:50:12,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:50:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:50:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942467786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:50:12,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:50:12,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-03-15 02:50:12,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131381804] [2025-03-15 02:50:12,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:50:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:50:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:12,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:50:12,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:50:12,264 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 255 [2025-03-15 02:50:12,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 298 transitions, 1388 flow. Second operand has 8 states, 8 states have (on average 164.125) internal successors, (1313), 8 states have internal predecessors, (1313), 0 states have call successors, (0), 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 02:50:12,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:12,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 255 [2025-03-15 02:50:12,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:14,211 INFO L124 PetriNetUnfolderBase]: 9237/13746 cut-off events. [2025-03-15 02:50:14,211 INFO L125 PetriNetUnfolderBase]: For 5252/6326 co-relation queries the response was YES. [2025-03-15 02:50:14,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61796 conditions, 13746 events. 9237/13746 cut-off events. For 5252/6326 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 89887 event pairs, 5587 based on Foata normal form. 0/5863 useless extension candidates. Maximal degree in co-relation 60164. Up to 11655 conditions per place. [2025-03-15 02:50:14,321 INFO L140 encePairwiseOnDemand]: 231/255 looper letters, 102 selfloop transitions, 41 changer transitions 14/296 dead transitions. [2025-03-15 02:50:14,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 296 transitions, 1660 flow [2025-03-15 02:50:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:50:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:50:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2342 transitions. [2025-03-15 02:50:14,327 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6560224089635854 [2025-03-15 02:50:14,328 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 12 predicate places. [2025-03-15 02:50:14,328 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 296 transitions, 1660 flow [2025-03-15 02:50:14,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 164.125) internal successors, (1313), 8 states have internal predecessors, (1313), 0 states have call successors, (0), 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 02:50:14,328 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:14,329 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:50:14,335 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 02:50:14,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:14,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:14,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:14,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1483959183, now seen corresponding path program 1 times [2025-03-15 02:50:14,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:14,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653738306] [2025-03-15 02:50:14,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:14,666 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 02:50:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653738306] [2025-03-15 02:50:14,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653738306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:14,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:50:14,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:50:14,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447376620] [2025-03-15 02:50:14,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:14,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:50:14,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:14,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:50:14,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:50:14,667 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 255 [2025-03-15 02:50:14,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 296 transitions, 1660 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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 02:50:14,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:14,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 255 [2025-03-15 02:50:14,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:17,697 INFO L124 PetriNetUnfolderBase]: 14643/22536 cut-off events. [2025-03-15 02:50:17,698 INFO L125 PetriNetUnfolderBase]: For 27093/28933 co-relation queries the response was YES. [2025-03-15 02:50:17,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112152 conditions, 22536 events. 14643/22536 cut-off events. For 27093/28933 co-relation queries the response was YES. Maximal size of possible extension queue 1893. Compared 180644 event pairs, 4201 based on Foata normal form. 0/10932 useless extension candidates. Maximal degree in co-relation 109771. Up to 17076 conditions per place. [2025-03-15 02:50:17,934 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 60 selfloop transitions, 2 changer transitions 15/325 dead transitions. [2025-03-15 02:50:17,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 325 transitions, 2083 flow [2025-03-15 02:50:17,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:50:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:50:17,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2025-03-15 02:50:17,936 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2025-03-15 02:50:17,936 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 14 predicate places. [2025-03-15 02:50:17,936 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 325 transitions, 2083 flow [2025-03-15 02:50:17,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 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 02:50:17,937 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:17,937 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:50:17,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:50:17,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:17,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:17,937 INFO L85 PathProgramCache]: Analyzing trace with hash -728005334, now seen corresponding path program 1 times [2025-03-15 02:50:17,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:17,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747621897] [2025-03-15 02:50:17,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:17,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:18,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:18,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747621897] [2025-03-15 02:50:18,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747621897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:50:18,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181646791] [2025-03-15 02:50:18,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:18,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:18,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:50:18,044 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 02:50:18,045 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 02:50:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:18,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:50:18,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:50:18,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:50:18,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:50:18,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181646791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:18,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:50:18,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2025-03-15 02:50:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795861710] [2025-03-15 02:50:18,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:18,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:50:18,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:18,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:50:18,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:50:18,225 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 255 [2025-03-15 02:50:18,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 325 transitions, 2083 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 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 02:50:18,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:18,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 255 [2025-03-15 02:50:18,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:21,628 INFO L124 PetriNetUnfolderBase]: 15598/24963 cut-off events. [2025-03-15 02:50:21,628 INFO L125 PetriNetUnfolderBase]: For 43007/45597 co-relation queries the response was YES. [2025-03-15 02:50:21,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138657 conditions, 24963 events. 15598/24963 cut-off events. For 43007/45597 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 203910 event pairs, 4948 based on Foata normal form. 328/12846 useless extension candidates. Maximal degree in co-relation 126583. Up to 18147 conditions per place. [2025-03-15 02:50:21,972 INFO L140 encePairwiseOnDemand]: 239/255 looper letters, 186 selfloop transitions, 12 changer transitions 16/388 dead transitions. [2025-03-15 02:50:21,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 388 transitions, 3139 flow [2025-03-15 02:50:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:50:21,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:50:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1696 transitions. [2025-03-15 02:50:21,976 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7389978213507625 [2025-03-15 02:50:21,976 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 22 predicate places. [2025-03-15 02:50:21,976 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 388 transitions, 3139 flow [2025-03-15 02:50:21,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 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 02:50:21,977 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:21,977 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:50:21,983 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 02:50:22,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:22,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:22,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:22,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1901282483, now seen corresponding path program 1 times [2025-03-15 02:50:22,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:22,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441065635] [2025-03-15 02:50:22,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:22,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:22,265 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 02:50:22,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:22,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441065635] [2025-03-15 02:50:22,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441065635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:22,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:50:22,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:50:22,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895858360] [2025-03-15 02:50:22,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:22,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:50:22,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:22,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:50:22,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:50:22,267 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 255 [2025-03-15 02:50:22,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 388 transitions, 3139 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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 02:50:22,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:22,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 255 [2025-03-15 02:50:22,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:24,894 INFO L124 PetriNetUnfolderBase]: 13318/21761 cut-off events. [2025-03-15 02:50:24,894 INFO L125 PetriNetUnfolderBase]: For 48134/51082 co-relation queries the response was YES. [2025-03-15 02:50:24,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134922 conditions, 21761 events. 13318/21761 cut-off events. For 48134/51082 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 180062 event pairs, 4311 based on Foata normal form. 0/11408 useless extension candidates. Maximal degree in co-relation 123233. Up to 15575 conditions per place. [2025-03-15 02:50:25,332 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 76 selfloop transitions, 3 changer transitions 16/385 dead transitions. [2025-03-15 02:50:25,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 385 transitions, 3261 flow [2025-03-15 02:50:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:50:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:50:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 837 transitions. [2025-03-15 02:50:25,334 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8205882352941176 [2025-03-15 02:50:25,335 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 24 predicate places. [2025-03-15 02:50:25,335 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 385 transitions, 3261 flow [2025-03-15 02:50:25,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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 02:50:25,335 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:25,335 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:50:25,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:50:25,335 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:25,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:25,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1901282480, now seen corresponding path program 1 times [2025-03-15 02:50:25,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:25,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496663986] [2025-03-15 02:50:25,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:25,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:25,428 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 02:50:25,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:25,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496663986] [2025-03-15 02:50:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496663986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:25,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:50:25,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:50:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658842608] [2025-03-15 02:50:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:25,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:50:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:25,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:50:25,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:50:25,430 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 255 [2025-03-15 02:50:25,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 385 transitions, 3261 flow. Second operand has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 0 states have call successors, (0), 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 02:50:25,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:25,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 255 [2025-03-15 02:50:25,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:28,842 INFO L124 PetriNetUnfolderBase]: 13569/22321 cut-off events. [2025-03-15 02:50:28,842 INFO L125 PetriNetUnfolderBase]: For 62359/66013 co-relation queries the response was YES. [2025-03-15 02:50:28,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153880 conditions, 22321 events. 13569/22321 cut-off events. For 62359/66013 co-relation queries the response was YES. Maximal size of possible extension queue 1737. Compared 182714 event pairs, 4660 based on Foata normal form. 233/12138 useless extension candidates. Maximal degree in co-relation 136171. Up to 15891 conditions per place. [2025-03-15 02:50:29,135 INFO L140 encePairwiseOnDemand]: 236/255 looper letters, 202 selfloop transitions, 18 changer transitions 32/426 dead transitions. [2025-03-15 02:50:29,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 426 transitions, 4444 flow [2025-03-15 02:50:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:50:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:50:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1679 transitions. [2025-03-15 02:50:29,138 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7315904139433551 [2025-03-15 02:50:29,138 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 32 predicate places. [2025-03-15 02:50:29,139 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 426 transitions, 4444 flow [2025-03-15 02:50:29,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 0 states have call successors, (0), 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 02:50:29,139 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:29,139 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:50:29,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:50:29,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:29,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:29,140 INFO L85 PathProgramCache]: Analyzing trace with hash 880793487, now seen corresponding path program 1 times [2025-03-15 02:50:29,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:29,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645646071] [2025-03-15 02:50:29,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:29,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:50:29,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645646071] [2025-03-15 02:50:29,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645646071] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:50:29,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773089372] [2025-03-15 02:50:29,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:29,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:29,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:50:29,240 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 02:50:29,241 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 02:50:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:29,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 02:50:29,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:50:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:29,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:50:29,805 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:29,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773089372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:50:29,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:50:29,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 17 [2025-03-15 02:50:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703035536] [2025-03-15 02:50:29,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:50:29,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-15 02:50:29,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:29,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-15 02:50:29,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-15 02:50:29,809 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 255 [2025-03-15 02:50:29,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 426 transitions, 4444 flow. Second operand has 17 states, 17 states have (on average 164.88235294117646) internal successors, (2803), 17 states have internal predecessors, (2803), 0 states have call successors, (0), 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 02:50:29,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:29,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 255 [2025-03-15 02:50:29,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:37,964 INFO L124 PetriNetUnfolderBase]: 28416/46758 cut-off events. [2025-03-15 02:50:37,964 INFO L125 PetriNetUnfolderBase]: For 186509/197696 co-relation queries the response was YES. [2025-03-15 02:50:38,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357747 conditions, 46758 events. 28416/46758 cut-off events. For 186509/197696 co-relation queries the response was YES. Maximal size of possible extension queue 2111. Compared 408150 event pairs, 5388 based on Foata normal form. 877/25670 useless extension candidates. Maximal degree in co-relation 216416. Up to 32946 conditions per place. [2025-03-15 02:50:38,844 INFO L140 encePairwiseOnDemand]: 230/255 looper letters, 432 selfloop transitions, 56 changer transitions 44/668 dead transitions. [2025-03-15 02:50:38,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 668 transitions, 9370 flow [2025-03-15 02:50:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-15 02:50:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-15 02:50:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3798 transitions. [2025-03-15 02:50:38,848 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6770053475935829 [2025-03-15 02:50:38,849 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 53 predicate places. [2025-03-15 02:50:38,849 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 668 transitions, 9370 flow [2025-03-15 02:50:38,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 164.88235294117646) internal successors, (2803), 17 states have internal predecessors, (2803), 0 states have call successors, (0), 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 02:50:38,850 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:38,850 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:50:38,856 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 02:50:39,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:39,051 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:39,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:39,051 INFO L85 PathProgramCache]: Analyzing trace with hash 449052885, now seen corresponding path program 1 times [2025-03-15 02:50:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:39,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746496780] [2025-03-15 02:50:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:50:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746496780] [2025-03-15 02:50:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746496780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:50:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:50:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379017919] [2025-03-15 02:50:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:39,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:50:39,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:39,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:50:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:50:39,203 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 255 [2025-03-15 02:50:39,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 668 transitions, 9370 flow. Second operand has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 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 02:50:39,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:39,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 255 [2025-03-15 02:50:39,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:45,890 INFO L124 PetriNetUnfolderBase]: 23688/40083 cut-off events. [2025-03-15 02:50:45,890 INFO L125 PetriNetUnfolderBase]: For 188464/203928 co-relation queries the response was YES. [2025-03-15 02:50:46,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 328519 conditions, 40083 events. 23688/40083 cut-off events. For 188464/203928 co-relation queries the response was YES. Maximal size of possible extension queue 1830. Compared 352676 event pairs, 5272 based on Foata normal form. 0/22465 useless extension candidates. Maximal degree in co-relation 196860. Up to 27579 conditions per place. [2025-03-15 02:50:46,459 INFO L140 encePairwiseOnDemand]: 245/255 looper letters, 267 selfloop transitions, 5 changer transitions 44/661 dead transitions. [2025-03-15 02:50:46,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 661 transitions, 9852 flow [2025-03-15 02:50:46,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:50:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:50:46,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1057 transitions. [2025-03-15 02:50:46,461 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6908496732026144 [2025-03-15 02:50:46,461 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 57 predicate places. [2025-03-15 02:50:46,461 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 661 transitions, 9852 flow [2025-03-15 02:50:46,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 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 02:50:46,461 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:46,462 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:50:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:50:46,462 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:46,462 INFO L85 PathProgramCache]: Analyzing trace with hash 449052887, now seen corresponding path program 1 times [2025-03-15 02:50:46,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783891312] [2025-03-15 02:50:46,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:46,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:46,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:50:46,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783891312] [2025-03-15 02:50:46,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783891312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:50:46,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331951617] [2025-03-15 02:50:46,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:46,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:46,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:50:46,597 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 02:50:46,599 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 02:50:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:46,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:50:46,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:50:46,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:50:46,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:50:46,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331951617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:46,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:50:46,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-15 02:50:46,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283135015] [2025-03-15 02:50:46,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:46,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:50:46,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:46,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:50:46,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-15 02:50:46,772 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 255 [2025-03-15 02:50:46,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 661 transitions, 9852 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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 02:50:46,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:46,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 255 [2025-03-15 02:50:46,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:50:52,080 INFO L124 PetriNetUnfolderBase]: 16492/29323 cut-off events. [2025-03-15 02:50:52,081 INFO L125 PetriNetUnfolderBase]: For 182227/197413 co-relation queries the response was YES. [2025-03-15 02:50:52,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252597 conditions, 29323 events. 16492/29323 cut-off events. For 182227/197413 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 260164 event pairs, 3803 based on Foata normal form. 0/17945 useless extension candidates. Maximal degree in co-relation 148184. Up to 19433 conditions per place. [2025-03-15 02:50:52,647 INFO L140 encePairwiseOnDemand]: 250/255 looper letters, 228 selfloop transitions, 3 changer transitions 44/647 dead transitions. [2025-03-15 02:50:52,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 647 transitions, 10060 flow [2025-03-15 02:50:52,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:50:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:50:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 835 transitions. [2025-03-15 02:50:52,649 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8186274509803921 [2025-03-15 02:50:52,650 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 58 predicate places. [2025-03-15 02:50:52,650 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 647 transitions, 10060 flow [2025-03-15 02:50:52,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 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 02:50:52,651 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:50:52,651 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:50:52,662 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 02:50:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:50:52,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:50:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:50:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1035738692, now seen corresponding path program 1 times [2025-03-15 02:50:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:50:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98413995] [2025-03-15 02:50:52,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:50:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:50:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:50:52,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:50:52,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:50:52,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98413995] [2025-03-15 02:50:52,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98413995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:50:52,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:50:52,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:50:52,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871755180] [2025-03-15 02:50:52,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:50:52,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:50:52,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:50:52,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:50:52,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:50:52,954 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 255 [2025-03-15 02:50:52,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 647 transitions, 10060 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 02:50:52,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:50:52,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 255 [2025-03-15 02:50:52,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:51:03,244 INFO L124 PetriNetUnfolderBase]: 32018/55945 cut-off events. [2025-03-15 02:51:03,245 INFO L125 PetriNetUnfolderBase]: For 504921/526319 co-relation queries the response was YES. [2025-03-15 02:51:03,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478604 conditions, 55945 events. 32018/55945 cut-off events. For 504921/526319 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 519286 event pairs, 6094 based on Foata normal form. 1/35276 useless extension candidates. Maximal degree in co-relation 272293. Up to 33498 conditions per place. [2025-03-15 02:51:04,123 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 346 selfloop transitions, 8 changer transitions 51/781 dead transitions. [2025-03-15 02:51:04,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 781 transitions, 14134 flow [2025-03-15 02:51:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:51:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:51:04,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2025-03-15 02:51:04,125 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8705882352941177 [2025-03-15 02:51:04,125 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 60 predicate places. [2025-03-15 02:51:04,125 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 781 transitions, 14134 flow [2025-03-15 02:51:04,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 02:51:04,126 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:51:04,126 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:51:04,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 02:51:04,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:51:04,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:51:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1404636899, now seen corresponding path program 1 times [2025-03-15 02:51:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:51:04,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568820931] [2025-03-15 02:51:04,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:51:04,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:51:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:51:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:51:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:51:04,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568820931] [2025-03-15 02:51:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568820931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:51:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:51:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:51:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679065704] [2025-03-15 02:51:04,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:51:04,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:51:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:51:04,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:51:04,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:51:04,175 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 255 [2025-03-15 02:51:04,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 781 transitions, 14134 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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 02:51:04,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:51:04,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 255 [2025-03-15 02:51:04,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:51:14,015 INFO L124 PetriNetUnfolderBase]: 28342/51365 cut-off events. [2025-03-15 02:51:14,015 INFO L125 PetriNetUnfolderBase]: For 565285/589559 co-relation queries the response was YES. [2025-03-15 02:51:14,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458832 conditions, 51365 events. 28342/51365 cut-off events. For 565285/589559 co-relation queries the response was YES. Maximal size of possible extension queue 1680. Compared 487208 event pairs, 5805 based on Foata normal form. 1/33511 useless extension candidates. Maximal degree in co-relation 256714. Up to 34323 conditions per place. [2025-03-15 02:51:14,865 INFO L140 encePairwiseOnDemand]: 253/255 looper letters, 346 selfloop transitions, 1 changer transitions 51/774 dead transitions. [2025-03-15 02:51:14,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 774 transitions, 14714 flow [2025-03-15 02:51:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:51:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:51:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2025-03-15 02:51:14,866 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2025-03-15 02:51:14,867 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 61 predicate places. [2025-03-15 02:51:14,867 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 774 transitions, 14714 flow [2025-03-15 02:51:14,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 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 02:51:14,867 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:51:14,867 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:51:14,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:51:14,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:51:14,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:51:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1404636898, now seen corresponding path program 1 times [2025-03-15 02:51:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:51:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173533059] [2025-03-15 02:51:14,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:51:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:51:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:51:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:51:14,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:51:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173533059] [2025-03-15 02:51:14,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173533059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:51:14,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464574979] [2025-03-15 02:51:14,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:51:14,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:51:14,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:51:14,932 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 02:51:14,934 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 02:51:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:51:15,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 02:51:15,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:51:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:51:15,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:51:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:51:15,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464574979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:51:15,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:51:15,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 9, 9] total 17 [2025-03-15 02:51:15,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819268908] [2025-03-15 02:51:15,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:51:15,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-15 02:51:15,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:51:15,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-15 02:51:15,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-15 02:51:15,367 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 255 [2025-03-15 02:51:15,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 774 transitions, 14714 flow. Second operand has 17 states, 17 states have (on average 165.0) internal successors, (2805), 17 states have internal predecessors, (2805), 0 states have call successors, (0), 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 02:51:15,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:51:15,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 255 [2025-03-15 02:51:15,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:51:37,214 INFO L124 PetriNetUnfolderBase]: 58520/106065 cut-off events. [2025-03-15 02:51:37,215 INFO L125 PetriNetUnfolderBase]: For 1355317/1423713 co-relation queries the response was YES. [2025-03-15 02:51:37,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013622 conditions, 106065 events. 58520/106065 cut-off events. For 1355317/1423713 co-relation queries the response was YES. Maximal size of possible extension queue 3193. Compared 1090779 event pairs, 8865 based on Foata normal form. 2545/71302 useless extension candidates. Maximal degree in co-relation 403991. Up to 71432 conditions per place. [2025-03-15 02:51:39,484 INFO L140 encePairwiseOnDemand]: 231/255 looper letters, 932 selfloop transitions, 141 changer transitions 79/1303 dead transitions. [2025-03-15 02:51:39,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 1303 transitions, 31962 flow [2025-03-15 02:51:39,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-15 02:51:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-15 02:51:39,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3733 transitions. [2025-03-15 02:51:39,487 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6654188948306595 [2025-03-15 02:51:39,487 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 82 predicate places. [2025-03-15 02:51:39,487 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 1303 transitions, 31962 flow [2025-03-15 02:51:39,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 165.0) internal successors, (2805), 17 states have internal predecessors, (2805), 0 states have call successors, (0), 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 02:51:39,488 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:51:39,488 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:51:39,494 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 02:51:39,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:51:39,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:51:39,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:51:39,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1958256984, now seen corresponding path program 1 times [2025-03-15 02:51:39,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:51:39,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678842712] [2025-03-15 02:51:39,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:51:39,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:51:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:51:39,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:51:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:51:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678842712] [2025-03-15 02:51:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678842712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:51:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:51:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:51:39,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201204059] [2025-03-15 02:51:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:51:39,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:51:39,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:51:39,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:51:39,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:51:39,760 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 255 [2025-03-15 02:51:39,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 1303 transitions, 31962 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 02:51:39,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:51:39,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 255 [2025-03-15 02:51:39,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:51:58,560 INFO L124 PetriNetUnfolderBase]: 44066/81457 cut-off events. [2025-03-15 02:51:58,560 INFO L125 PetriNetUnfolderBase]: For 1117960/1177628 co-relation queries the response was YES. [2025-03-15 02:51:59,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816815 conditions, 81457 events. 44066/81457 cut-off events. For 1117960/1177628 co-relation queries the response was YES. Maximal size of possible extension queue 2351. Compared 823398 event pairs, 5860 based on Foata normal form. 819/55002 useless extension candidates. Maximal degree in co-relation 318033. Up to 54186 conditions per place. [2025-03-15 02:52:00,511 INFO L140 encePairwiseOnDemand]: 248/255 looper letters, 821 selfloop transitions, 15 changer transitions 75/1296 dead transitions. [2025-03-15 02:52:00,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 1296 transitions, 33507 flow [2025-03-15 02:52:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:52:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:52:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 659 transitions. [2025-03-15 02:52:00,512 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8614379084967321 [2025-03-15 02:52:00,513 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 84 predicate places. [2025-03-15 02:52:00,513 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 1296 transitions, 33507 flow [2025-03-15 02:52:00,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 0 states have call successors, (0), 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 02:52:00,513 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:52:00,513 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:52:00,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:52:00,513 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:52:00,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:52:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash 115355571, now seen corresponding path program 1 times [2025-03-15 02:52:00,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:52:00,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206185299] [2025-03-15 02:52:00,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:52:00,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:52:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:52:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-15 02:52:00,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:52:00,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206185299] [2025-03-15 02:52:00,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206185299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:52:00,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:52:00,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:52:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183735085] [2025-03-15 02:52:00,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:52:00,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:52:00,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:52:00,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:52:00,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:52:00,557 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 255 [2025-03-15 02:52:00,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 1296 transitions, 33507 flow. Second operand has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 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 02:52:00,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:52:00,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 255 [2025-03-15 02:52:00,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:52:19,689 INFO L124 PetriNetUnfolderBase]: 40487/76191 cut-off events. [2025-03-15 02:52:19,689 INFO L125 PetriNetUnfolderBase]: For 1171809/1231390 co-relation queries the response was YES. [2025-03-15 02:52:20,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800993 conditions, 76191 events. 40487/76191 cut-off events. For 1171809/1231390 co-relation queries the response was YES. Maximal size of possible extension queue 2224. Compared 777868 event pairs, 5756 based on Foata normal form. 6/52142 useless extension candidates. Maximal degree in co-relation 301203. Up to 49902 conditions per place. [2025-03-15 02:52:21,098 INFO L140 encePairwiseOnDemand]: 253/255 looper letters, 824 selfloop transitions, 1 changer transitions 75/1282 dead transitions. [2025-03-15 02:52:21,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 1282 transitions, 34825 flow [2025-03-15 02:52:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:52:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:52:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2025-03-15 02:52:21,099 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8352941176470589 [2025-03-15 02:52:21,100 INFO L298 CegarLoopForPetriNet]: 256 programPoint places, 85 predicate places. [2025-03-15 02:52:21,100 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 1282 transitions, 34825 flow [2025-03-15 02:52:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 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 02:52:21,100 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:52:21,100 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:52:21,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:52:21,101 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-15 02:52:21,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:52:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash 33703623, now seen corresponding path program 1 times [2025-03-15 02:52:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:52:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731706698] [2025-03-15 02:52:21,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:52:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:52:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:52:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:52:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:52:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731706698] [2025-03-15 02:52:21,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731706698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:52:21,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099253531] [2025-03-15 02:52:21,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:52:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:52:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:52:21,271 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 02:52:21,272 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 02:52:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:52:21,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-15 02:52:21,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:52:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:52:21,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:52:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:52:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099253531] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:52:21,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:52:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-15 02:52:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186412717] [2025-03-15 02:52:21,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:52:21,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 02:52:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:52:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 02:52:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-15 02:52:21,593 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 255 [2025-03-15 02:52:21,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 1282 transitions, 34825 flow. Second operand has 24 states, 24 states have (on average 183.375) internal successors, (4401), 24 states have internal predecessors, (4401), 0 states have call successors, (0), 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 02:52:21,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:52:21,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 255 [2025-03-15 02:52:21,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand