/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/chl-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:29:47,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:29:47,342 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:29:47,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:29:47,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:29:47,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:29:47,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:29:47,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:29:47,389 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:29:47,389 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:29:47,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:29:47,390 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:29:47,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:29:47,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:29:47,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:29:47,391 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:29:47,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:29:47,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:29:47,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:29:47,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:29:47,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:29:47,402 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:29:47,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:29:47,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:29:47,402 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:29:47,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:29:47,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:29:47,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:29:47,658 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:29:47,658 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:29:47,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-03-15 02:29:48,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7d75f1c/cd115ef602c04d1693ff33b3ecae4b0b/FLAGc4079fc51 [2025-03-15 02:29:49,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:29:49,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2025-03-15 02:29:49,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7d75f1c/cd115ef602c04d1693ff33b3ecae4b0b/FLAGc4079fc51 [2025-03-15 02:29:49,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb7d75f1c/cd115ef602c04d1693ff33b3ecae4b0b [2025-03-15 02:29:49,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:29:49,384 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:29:49,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:29:49,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:29:49,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:29:49,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33874eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49, skipping insertion in model container [2025-03-15 02:29:49,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,404 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:29:49,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:29:49,570 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:29:49,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:29:49,623 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:29:49,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49 WrapperNode [2025-03-15 02:29:49,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:29:49,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:29:49,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:29:49,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:29:49,630 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:29:49" (1/1) ... [2025-03-15 02:29:49,644 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:29:49" (1/1) ... [2025-03-15 02:29:49,676 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 491 [2025-03-15 02:29:49,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:29:49,682 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:29:49,682 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:29:49,682 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:29:49,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,717 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,725 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:29:49,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:29:49,726 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:29:49,726 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:29:49,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (1/1) ... [2025-03-15 02:29:49,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:29:49,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:49,756 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:29:49,761 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:29:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:29:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:29:49,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:29:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:29:49,778 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:29:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:29:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:29:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:29:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:29:49,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:29:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:29:49,779 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:29:49,884 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:29:49,886 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:29:50,447 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:29:50,447 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:29:50,461 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:29:50,461 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 02:29:50,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:29:50 BoogieIcfgContainer [2025-03-15 02:29:50,465 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:29:50,467 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:29:50,467 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:29:50,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:29:50,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:29:49" (1/3) ... [2025-03-15 02:29:50,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d0cadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:29:50, skipping insertion in model container [2025-03-15 02:29:50,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:29:49" (2/3) ... [2025-03-15 02:29:50,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8d0cadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:29:50, skipping insertion in model container [2025-03-15 02:29:50,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:29:50" (3/3) ... [2025-03-15 02:29:50,475 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-03-15 02:29:50,485 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:29:50,486 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 622 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-03-15 02:29:50,487 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:29:50,608 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:29:50,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:29:50,652 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;@8e1a2f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:29:50,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2025-03-15 02:29:50,691 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:29:50,691 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2025-03-15 02:29:50,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:29:50,693 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:50,694 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] [2025-03-15 02:29:50,694 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:50,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:50,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1882076077, now seen corresponding path program 1 times [2025-03-15 02:29:50,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:50,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426739459] [2025-03-15 02:29:50,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:51,005 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:29:51,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426739459] [2025-03-15 02:29:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426739459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:51,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:51,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:29:51,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781024525] [2025-03-15 02:29:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:51,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:29:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:51,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:29:51,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:29:51,039 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 680 [2025-03-15 02:29:51,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 680 transitions, 1374 flow. Second operand has 4 states, 4 states have (on average 623.5) internal successors, (2494), 4 states have internal predecessors, (2494), 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:29:51,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:51,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 680 [2025-03-15 02:29:51,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:51,300 INFO L124 PetriNetUnfolderBase]: 38/670 cut-off events. [2025-03-15 02:29:51,300 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-15 02:29:51,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 730 conditions, 670 events. 38/670 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2391 event pairs, 0 based on Foata normal form. 31/602 useless extension candidates. Maximal degree in co-relation 477. Up to 35 conditions per place. [2025-03-15 02:29:51,320 INFO L140 encePairwiseOnDemand]: 640/680 looper letters, 39 selfloop transitions, 10 changer transitions 15/664 dead transitions. [2025-03-15 02:29:51,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 664 transitions, 1440 flow [2025-03-15 02:29:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:29:51,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:29:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3190 transitions. [2025-03-15 02:29:51,340 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9382352941176471 [2025-03-15 02:29:51,342 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, -7 predicate places. [2025-03-15 02:29:51,342 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 664 transitions, 1440 flow [2025-03-15 02:29:51,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 623.5) internal successors, (2494), 4 states have internal predecessors, (2494), 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:29:51,344 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:51,344 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, 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:29:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:29:51,344 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash 220627829, now seen corresponding path program 1 times [2025-03-15 02:29:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40738677] [2025-03-15 02:29:51,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:51,547 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:29:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:51,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40738677] [2025-03-15 02:29:51,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40738677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:51,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197590645] [2025-03-15 02:29:51,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:51,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:51,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:51,550 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:29:51,552 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:29:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:51,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:29:51,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:51,723 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:29:51,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:29:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197590645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:29:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:29:51,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97028286] [2025-03-15 02:29:51,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:29:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:51,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:29:51,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:29:51,731 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 680 [2025-03-15 02:29:51,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 664 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 624.1666666666666) internal successors, (3745), 6 states have internal predecessors, (3745), 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:29:51,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:51,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 680 [2025-03-15 02:29:51,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:51,944 INFO L124 PetriNetUnfolderBase]: 38/668 cut-off events. [2025-03-15 02:29:51,944 INFO L125 PetriNetUnfolderBase]: For 28/31 co-relation queries the response was YES. [2025-03-15 02:29:51,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 775 conditions, 668 events. 38/668 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2384 event pairs, 0 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 512. Up to 33 conditions per place. [2025-03-15 02:29:51,958 INFO L140 encePairwiseOnDemand]: 668/680 looper letters, 31 selfloop transitions, 16 changer transitions 15/662 dead transitions. [2025-03-15 02:29:51,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 662 transitions, 1528 flow [2025-03-15 02:29:51,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:29:51,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:29:51,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4404 transitions. [2025-03-15 02:29:51,967 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9252100840336135 [2025-03-15 02:29:51,967 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, -3 predicate places. [2025-03-15 02:29:51,967 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 662 transitions, 1528 flow [2025-03-15 02:29:51,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 624.1666666666666) internal successors, (3745), 6 states have internal predecessors, (3745), 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:29:51,969 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:51,970 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, 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:29:51,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 02:29:52,170 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:29:52,171 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1750470883, now seen corresponding path program 1 times [2025-03-15 02:29:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453786399] [2025-03-15 02:29:52,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:52,308 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:29:52,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453786399] [2025-03-15 02:29:52,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453786399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:52,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54737579] [2025-03-15 02:29:52,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:52,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:52,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:52,312 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:29:52,313 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:29:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:52,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:29:52,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:52,449 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:29:52,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:52,499 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:29:52,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54737579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:52,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:52,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:29:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146995667] [2025-03-15 02:29:52,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:52,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:29:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:52,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:29:52,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:29:52,508 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 680 [2025-03-15 02:29:52,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 662 transitions, 1528 flow. Second operand has 12 states, 12 states have (on average 624.8333333333334) internal successors, (7498), 12 states have internal predecessors, (7498), 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:29:52,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:52,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 680 [2025-03-15 02:29:52,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:52,820 INFO L124 PetriNetUnfolderBase]: 44/738 cut-off events. [2025-03-15 02:29:52,821 INFO L125 PetriNetUnfolderBase]: For 104/109 co-relation queries the response was YES. [2025-03-15 02:29:52,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 738 events. 44/738 cut-off events. For 104/109 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2776 event pairs, 0 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 783. Up to 85 conditions per place. [2025-03-15 02:29:52,835 INFO L140 encePairwiseOnDemand]: 666/680 looper letters, 63 selfloop transitions, 36 changer transitions 15/714 dead transitions. [2025-03-15 02:29:52,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 714 transitions, 2040 flow [2025-03-15 02:29:52,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:29:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:29:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 8814 transitions. [2025-03-15 02:29:52,849 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9258403361344538 [2025-03-15 02:29:52,851 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 10 predicate places. [2025-03-15 02:29:52,851 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 714 transitions, 2040 flow [2025-03-15 02:29:52,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 624.8333333333334) internal successors, (7498), 12 states have internal predecessors, (7498), 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:29:52,854 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:52,855 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] [2025-03-15 02:29:52,861 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:29:53,055 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:29:53,056 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:53,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash 37234039, now seen corresponding path program 2 times [2025-03-15 02:29:53,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:53,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173417978] [2025-03-15 02:29:53,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:29:53,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:53,075 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:29:53,075 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:29:53,150 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:29:53,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173417978] [2025-03-15 02:29:53,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173417978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:53,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745295993] [2025-03-15 02:29:53,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:29:53,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:53,153 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:29:53,154 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:29:53,239 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:29:53,239 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:29:53,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:29:53,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:53,321 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:29:53,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:53,431 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:29:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745295993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:53,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-15 02:29:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025165349] [2025-03-15 02:29:53,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:53,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 02:29:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:53,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 02:29:53,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-15 02:29:53,439 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 612 out of 680 [2025-03-15 02:29:53,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 714 transitions, 2040 flow. Second operand has 10 states, 10 states have (on average 615.6) internal successors, (6156), 10 states have internal predecessors, (6156), 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:29:53,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:53,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 612 of 680 [2025-03-15 02:29:53,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:53,668 INFO L124 PetriNetUnfolderBase]: 44/736 cut-off events. [2025-03-15 02:29:53,668 INFO L125 PetriNetUnfolderBase]: For 198/205 co-relation queries the response was YES. [2025-03-15 02:29:53,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 736 events. 44/736 cut-off events. For 198/205 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2741 event pairs, 0 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 880. Up to 83 conditions per place. [2025-03-15 02:29:53,677 INFO L140 encePairwiseOnDemand]: 658/680 looper letters, 51 selfloop transitions, 56 changer transitions 15/712 dead transitions. [2025-03-15 02:29:53,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 712 transitions, 2240 flow [2025-03-15 02:29:53,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:29:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:29:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4942 transitions. [2025-03-15 02:29:53,683 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9084558823529412 [2025-03-15 02:29:53,684 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 15 predicate places. [2025-03-15 02:29:53,684 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 712 transitions, 2240 flow [2025-03-15 02:29:53,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 615.6) internal successors, (6156), 10 states have internal predecessors, (6156), 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:29:53,687 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:53,687 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:53,693 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:29:53,891 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:29:53,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:53,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash -784483962, now seen corresponding path program 1 times [2025-03-15 02:29:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:53,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156278614] [2025-03-15 02:29:53,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:53,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:53,981 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:29:53,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:53,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156278614] [2025-03-15 02:29:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156278614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:53,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:53,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:29:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897843814] [2025-03-15 02:29:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:53,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:29:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:53,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:29:53,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:29:53,984 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 680 [2025-03-15 02:29:53,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 712 transitions, 2240 flow. Second operand has 4 states, 4 states have (on average 603.5) internal successors, (2414), 4 states have internal predecessors, (2414), 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:29:53,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:53,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 680 [2025-03-15 02:29:53,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:54,309 INFO L124 PetriNetUnfolderBase]: 184/1945 cut-off events. [2025-03-15 02:29:54,309 INFO L125 PetriNetUnfolderBase]: For 1169/1178 co-relation queries the response was YES. [2025-03-15 02:29:54,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 1945 events. 184/1945 cut-off events. For 1169/1178 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13225 event pairs, 26 based on Foata normal form. 0/1634 useless extension candidates. Maximal degree in co-relation 2259. Up to 146 conditions per place. [2025-03-15 02:29:54,329 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 63 selfloop transitions, 10 changer transitions 15/734 dead transitions. [2025-03-15 02:29:54,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 644 places, 734 transitions, 2454 flow [2025-03-15 02:29:54,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:29:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:29:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2488 transitions. [2025-03-15 02:29:54,332 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9147058823529411 [2025-03-15 02:29:54,333 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 16 predicate places. [2025-03-15 02:29:54,333 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 734 transitions, 2454 flow [2025-03-15 02:29:54,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 603.5) internal successors, (2414), 4 states have internal predecessors, (2414), 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:29:54,334 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:54,334 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:54,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:29:54,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:54,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:54,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1450802664, now seen corresponding path program 1 times [2025-03-15 02:29:54,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:54,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721475212] [2025-03-15 02:29:54,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:54,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:54,440 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:29:54,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:54,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721475212] [2025-03-15 02:29:54,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721475212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:54,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:29:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632911393] [2025-03-15 02:29:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:54,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:29:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:54,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:29:54,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:29:54,443 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 680 [2025-03-15 02:29:54,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 734 transitions, 2454 flow. Second operand has 5 states, 5 states have (on average 626.2) internal successors, (3131), 5 states have internal predecessors, (3131), 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:29:54,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:54,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 680 [2025-03-15 02:29:54,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:54,752 INFO L124 PetriNetUnfolderBase]: 182/1941 cut-off events. [2025-03-15 02:29:54,753 INFO L125 PetriNetUnfolderBase]: For 1680/1691 co-relation queries the response was YES. [2025-03-15 02:29:54,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3061 conditions, 1941 events. 182/1941 cut-off events. For 1680/1691 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 12952 event pairs, 26 based on Foata normal form. 0/1632 useless extension candidates. Maximal degree in co-relation 2322. Up to 144 conditions per place. [2025-03-15 02:29:54,774 INFO L140 encePairwiseOnDemand]: 666/680 looper letters, 65 selfloop transitions, 12 changer transitions 15/730 dead transitions. [2025-03-15 02:29:54,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 730 transitions, 2570 flow [2025-03-15 02:29:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:29:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:29:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3152 transitions. [2025-03-15 02:29:54,780 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9270588235294117 [2025-03-15 02:29:54,782 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 20 predicate places. [2025-03-15 02:29:54,782 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 730 transitions, 2570 flow [2025-03-15 02:29:54,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 626.2) internal successors, (3131), 5 states have internal predecessors, (3131), 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:29:54,784 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:54,784 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, 1, 1, 1, 1, 1, 1, 1, 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:29:54,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:29:54,784 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:54,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:54,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1593412275, now seen corresponding path program 1 times [2025-03-15 02:29:54,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:54,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546473952] [2025-03-15 02:29:54,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:29:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546473952] [2025-03-15 02:29:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546473952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75331247] [2025-03-15 02:29:54,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:54,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:54,946 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:29:54,948 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:29:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:55,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:29:55,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:29:55,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:29:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75331247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:55,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 02:29:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958136179] [2025-03-15 02:29:55,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:55,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 02:29:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:55,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 02:29:55,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-15 02:29:55,193 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 612 out of 680 [2025-03-15 02:29:55,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 730 transitions, 2570 flow. Second operand has 15 states, 15 states have (on average 615.8666666666667) internal successors, (9238), 15 states have internal predecessors, (9238), 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:29:55,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:55,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 612 of 680 [2025-03-15 02:29:55,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:55,660 INFO L124 PetriNetUnfolderBase]: 178/1933 cut-off events. [2025-03-15 02:29:55,660 INFO L125 PetriNetUnfolderBase]: For 2288/2301 co-relation queries the response was YES. [2025-03-15 02:29:55,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 1933 events. 178/1933 cut-off events. For 2288/2301 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 12785 event pairs, 26 based on Foata normal form. 0/1628 useless extension candidates. Maximal degree in co-relation 2385. Up to 136 conditions per place. [2025-03-15 02:29:55,710 INFO L140 encePairwiseOnDemand]: 660/680 looper letters, 65 selfloop transitions, 32 changer transitions 15/722 dead transitions. [2025-03-15 02:29:55,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 722 transitions, 2670 flow [2025-03-15 02:29:55,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:29:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:29:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6804 transitions. [2025-03-15 02:29:55,721 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9096256684491979 [2025-03-15 02:29:55,722 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 30 predicate places. [2025-03-15 02:29:55,722 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 722 transitions, 2670 flow [2025-03-15 02:29:55,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 615.8666666666667) internal successors, (9238), 15 states have internal predecessors, (9238), 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:29:55,726 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:55,727 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:55,734 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:29:55,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:55,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:55,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:55,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1331194793, now seen corresponding path program 2 times [2025-03-15 02:29:55,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:55,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701659794] [2025-03-15 02:29:55,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:29:55,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:55,949 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:29:55,949 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:29:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-15 02:29:56,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:56,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701659794] [2025-03-15 02:29:56,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701659794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:56,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:56,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:29:56,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309423145] [2025-03-15 02:29:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:56,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:29:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:56,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:29:56,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:29:56,047 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:29:56,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 722 transitions, 2670 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:29:56,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:56,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:29:56,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:56,535 INFO L124 PetriNetUnfolderBase]: 253/2188 cut-off events. [2025-03-15 02:29:56,535 INFO L125 PetriNetUnfolderBase]: For 2852/2867 co-relation queries the response was YES. [2025-03-15 02:29:56,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 2188 events. 253/2188 cut-off events. For 2852/2867 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 15931 event pairs, 41 based on Foata normal form. 0/1841 useless extension candidates. Maximal degree in co-relation 3128. Up to 158 conditions per place. [2025-03-15 02:29:56,551 INFO L140 encePairwiseOnDemand]: 669/680 looper letters, 74 selfloop transitions, 11 changer transitions 15/735 dead transitions. [2025-03-15 02:29:56,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 735 transitions, 2963 flow [2025-03-15 02:29:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:29:56,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:29:56,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4251 transitions. [2025-03-15 02:29:56,556 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8930672268907563 [2025-03-15 02:29:56,558 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 35 predicate places. [2025-03-15 02:29:56,558 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 735 transitions, 2963 flow [2025-03-15 02:29:56,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:29:56,559 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:56,559 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:56,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:29:56,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:56,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1781975095, now seen corresponding path program 1 times [2025-03-15 02:29:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:56,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981705792] [2025-03-15 02:29:56,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:56,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-15 02:29:56,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:56,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981705792] [2025-03-15 02:29:56,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981705792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:56,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:56,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:29:56,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794234613] [2025-03-15 02:29:56,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:56,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:29:56,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:56,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:29:56,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:29:56,660 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 680 [2025-03-15 02:29:56,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 735 transitions, 2963 flow. Second operand has 4 states, 4 states have (on average 603.75) internal successors, (2415), 4 states have internal predecessors, (2415), 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:29:56,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:56,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 680 [2025-03-15 02:29:56,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:57,171 INFO L124 PetriNetUnfolderBase]: 395/2735 cut-off events. [2025-03-15 02:29:57,171 INFO L125 PetriNetUnfolderBase]: For 18593/29709 co-relation queries the response was YES. [2025-03-15 02:29:57,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6233 conditions, 2735 events. 395/2735 cut-off events. For 18593/29709 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 22473 event pairs, 67 based on Foata normal form. 0/2287 useless extension candidates. Maximal degree in co-relation 3810. Up to 312 conditions per place. [2025-03-15 02:29:57,202 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 70 selfloop transitions, 10 changer transitions 15/757 dead transitions. [2025-03-15 02:29:57,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 757 transitions, 3207 flow [2025-03-15 02:29:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:29:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:29:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2488 transitions. [2025-03-15 02:29:57,205 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9147058823529411 [2025-03-15 02:29:57,205 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 36 predicate places. [2025-03-15 02:29:57,206 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 757 transitions, 3207 flow [2025-03-15 02:29:57,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 603.75) internal successors, (2415), 4 states have internal predecessors, (2415), 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:29:57,206 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:57,206 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:57,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:29:57,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -593344951, now seen corresponding path program 1 times [2025-03-15 02:29:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985219935] [2025-03-15 02:29:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:57,427 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:29:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985219935] [2025-03-15 02:29:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985219935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210068037] [2025-03-15 02:29:57,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:57,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:57,429 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:29:57,431 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:29:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:57,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-15 02:29:57,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:57,682 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:29:57,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:29:57,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210068037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:57,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-15 02:29:57,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616728442] [2025-03-15 02:29:57,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:57,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-15 02:29:57,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:57,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-15 02:29:57,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-03-15 02:29:57,806 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 612 out of 680 [2025-03-15 02:29:57,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 757 transitions, 3207 flow. Second operand has 22 states, 22 states have (on average 615.9545454545455) internal successors, (13551), 22 states have internal predecessors, (13551), 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:29:57,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:57,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 612 of 680 [2025-03-15 02:29:57,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:58,599 INFO L124 PetriNetUnfolderBase]: 393/2735 cut-off events. [2025-03-15 02:29:58,600 INFO L125 PetriNetUnfolderBase]: For 34979/46097 co-relation queries the response was YES. [2025-03-15 02:29:58,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6527 conditions, 2735 events. 393/2735 cut-off events. For 34979/46097 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 22286 event pairs, 67 based on Foata normal form. 0/2289 useless extension candidates. Maximal degree in co-relation 3882. Up to 312 conditions per place. [2025-03-15 02:29:58,634 INFO L140 encePairwiseOnDemand]: 660/680 looper letters, 66 selfloop transitions, 38 changer transitions 15/757 dead transitions. [2025-03-15 02:29:58,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 757 transitions, 3413 flow [2025-03-15 02:29:58,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-15 02:29:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-15 02:29:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 10504 transitions. [2025-03-15 02:29:58,644 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9086505190311419 [2025-03-15 02:29:58,645 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 52 predicate places. [2025-03-15 02:29:58,645 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 757 transitions, 3413 flow [2025-03-15 02:29:58,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 615.9545454545455) internal successors, (13551), 22 states have internal predecessors, (13551), 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:29:58,648 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:58,648 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:58,655 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:29:58,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-15 02:29:58,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1677648083, now seen corresponding path program 2 times [2025-03-15 02:29:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:58,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321923864] [2025-03-15 02:29:58,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:29:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:58,873 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:29:58,873 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:29:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:29:58,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321923864] [2025-03-15 02:29:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321923864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:58,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:58,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:29:58,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347735706] [2025-03-15 02:29:58,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:58,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:29:58,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:58,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:29:58,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:29:58,936 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:29:58,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 757 transitions, 3413 flow. Second operand has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:29:58,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:58,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:29:58,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:59,591 INFO L124 PetriNetUnfolderBase]: 488/3330 cut-off events. [2025-03-15 02:29:59,592 INFO L125 PetriNetUnfolderBase]: For 46044/60493 co-relation queries the response was YES. [2025-03-15 02:29:59,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8499 conditions, 3330 events. 488/3330 cut-off events. For 46044/60493 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 30090 event pairs, 84 based on Foata normal form. 4/2794 useless extension candidates. Maximal degree in co-relation 5428. Up to 402 conditions per place. [2025-03-15 02:29:59,626 INFO L140 encePairwiseOnDemand]: 669/680 looper letters, 81 selfloop transitions, 14 changer transitions 15/770 dead transitions. [2025-03-15 02:29:59,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 770 transitions, 3762 flow [2025-03-15 02:29:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:29:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:29:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4251 transitions. [2025-03-15 02:29:59,633 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8930672268907563 [2025-03-15 02:29:59,633 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 57 predicate places. [2025-03-15 02:29:59,633 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 770 transitions, 3762 flow [2025-03-15 02:29:59,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:29:59,634 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:59,634 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:59,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:29:59,636 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:29:59,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:59,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1478756150, now seen corresponding path program 1 times [2025-03-15 02:29:59,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651590027] [2025-03-15 02:29:59,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:29:59,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651590027] [2025-03-15 02:29:59,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651590027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:59,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:59,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:29:59,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126291502] [2025-03-15 02:29:59,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:59,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:29:59,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:59,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:29:59,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:29:59,806 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:29:59,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 770 transitions, 3762 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:29:59,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:29:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:00,496 INFO L124 PetriNetUnfolderBase]: 486/3321 cut-off events. [2025-03-15 02:30:00,496 INFO L125 PetriNetUnfolderBase]: For 38570/75820 co-relation queries the response was YES. [2025-03-15 02:30:00,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9104 conditions, 3321 events. 486/3321 cut-off events. For 38570/75820 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 30214 event pairs, 82 based on Foata normal form. 36/2825 useless extension candidates. Maximal degree in co-relation 5878. Up to 401 conditions per place. [2025-03-15 02:30:00,528 INFO L140 encePairwiseOnDemand]: 670/680 looper letters, 82 selfloop transitions, 14 changer transitions 15/771 dead transitions. [2025-03-15 02:30:00,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 771 transitions, 3983 flow [2025-03-15 02:30:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4244 transitions. [2025-03-15 02:30:00,532 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8915966386554622 [2025-03-15 02:30:00,532 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 62 predicate places. [2025-03-15 02:30:00,532 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 771 transitions, 3983 flow [2025-03-15 02:30:00,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:30:00,533 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:00,533 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:00,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 02:30:00,533 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:00,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1403197849, now seen corresponding path program 1 times [2025-03-15 02:30:00,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:00,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766484337] [2025-03-15 02:30:00,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:00,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:00,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:00,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766484337] [2025-03-15 02:30:00,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766484337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:00,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504643672] [2025-03-15 02:30:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:30:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:00,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:30:00,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:30:00,616 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 680 [2025-03-15 02:30:00,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 771 transitions, 3983 flow. Second operand has 4 states, 4 states have (on average 604.5) internal successors, (2418), 4 states have internal predecessors, (2418), 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:30:00,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:00,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 680 [2025-03-15 02:30:00,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:01,230 INFO L124 PetriNetUnfolderBase]: 476/3311 cut-off events. [2025-03-15 02:30:01,231 INFO L125 PetriNetUnfolderBase]: For 49840/125668 co-relation queries the response was YES. [2025-03-15 02:30:01,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9617 conditions, 3311 events. 476/3311 cut-off events. For 49840/125668 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 30071 event pairs, 74 based on Foata normal form. 68/2857 useless extension candidates. Maximal degree in co-relation 6243. Up to 401 conditions per place. [2025-03-15 02:30:01,264 INFO L140 encePairwiseOnDemand]: 670/680 looper letters, 86 selfloop transitions, 9 changer transitions 15/776 dead transitions. [2025-03-15 02:30:01,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 776 transitions, 4362 flow [2025-03-15 02:30:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:30:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:30:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2480 transitions. [2025-03-15 02:30:01,269 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9117647058823529 [2025-03-15 02:30:01,269 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 65 predicate places. [2025-03-15 02:30:01,270 INFO L471 AbstractCegarLoop]: Abstraction has has 693 places, 776 transitions, 4362 flow [2025-03-15 02:30:01,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 604.5) internal successors, (2418), 4 states have internal predecessors, (2418), 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:30:01,270 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:01,270 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:01,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:30:01,270 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:01,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:01,271 INFO L85 PathProgramCache]: Analyzing trace with hash -685598901, now seen corresponding path program 1 times [2025-03-15 02:30:01,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:01,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200041076] [2025-03-15 02:30:01,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:01,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:01,400 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:01,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:01,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200041076] [2025-03-15 02:30:01,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200041076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:01,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:01,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393409538] [2025-03-15 02:30:01,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:01,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:01,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:01,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:01,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:01,403 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:30:01,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 776 transitions, 4362 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:30:01,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:01,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:30:01,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:01,973 INFO L124 PetriNetUnfolderBase]: 448/3117 cut-off events. [2025-03-15 02:30:01,973 INFO L125 PetriNetUnfolderBase]: For 16715/17097 co-relation queries the response was YES. [2025-03-15 02:30:01,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9418 conditions, 3117 events. 448/3117 cut-off events. For 16715/17097 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 28631 event pairs, 93 based on Foata normal form. 26/2686 useless extension candidates. Maximal degree in co-relation 7041. Up to 378 conditions per place. [2025-03-15 02:30:02,005 INFO L140 encePairwiseOnDemand]: 670/680 looper letters, 96 selfloop transitions, 11 changer transitions 15/786 dead transitions. [2025-03-15 02:30:02,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 786 transitions, 4702 flow [2025-03-15 02:30:02,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4249 transitions. [2025-03-15 02:30:02,007 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8926470588235295 [2025-03-15 02:30:02,008 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 70 predicate places. [2025-03-15 02:30:02,008 INFO L471 AbstractCegarLoop]: Abstraction has has 698 places, 786 transitions, 4702 flow [2025-03-15 02:30:02,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:30:02,008 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:02,009 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:02,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 02:30:02,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash 179158094, now seen corresponding path program 1 times [2025-03-15 02:30:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:02,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120783297] [2025-03-15 02:30:02,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:02,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:02,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:02,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120783297] [2025-03-15 02:30:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120783297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:02,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:02,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:02,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113649867] [2025-03-15 02:30:02,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:02,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:30:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:02,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:30:02,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:30:02,126 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 680 [2025-03-15 02:30:02,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 786 transitions, 4702 flow. Second operand has 5 states, 5 states have (on average 596.8) internal successors, (2984), 5 states have internal predecessors, (2984), 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:30:02,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:02,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 680 [2025-03-15 02:30:02,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:02,746 INFO L124 PetriNetUnfolderBase]: 454/3090 cut-off events. [2025-03-15 02:30:02,747 INFO L125 PetriNetUnfolderBase]: For 18615/18785 co-relation queries the response was YES. [2025-03-15 02:30:02,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10139 conditions, 3090 events. 454/3090 cut-off events. For 18615/18785 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 27989 event pairs, 90 based on Foata normal form. 0/2644 useless extension candidates. Maximal degree in co-relation 7686. Up to 394 conditions per place. [2025-03-15 02:30:02,792 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 103 selfloop transitions, 16 changer transitions 15/794 dead transitions. [2025-03-15 02:30:02,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 794 transitions, 5005 flow [2025-03-15 02:30:02,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:30:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:30:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3651 transitions. [2025-03-15 02:30:02,795 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8948529411764706 [2025-03-15 02:30:02,795 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 72 predicate places. [2025-03-15 02:30:02,796 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 794 transitions, 5005 flow [2025-03-15 02:30:02,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 596.8) internal successors, (2984), 5 states have internal predecessors, (2984), 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:30:02,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:02,796 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:02,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:30:02,797 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:02,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1557262168, now seen corresponding path program 1 times [2025-03-15 02:30:02,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:02,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702465496] [2025-03-15 02:30:02,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:02,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:02,965 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:02,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:02,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702465496] [2025-03-15 02:30:02,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702465496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:02,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:02,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:02,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230803454] [2025-03-15 02:30:02,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:02,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:02,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:02,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:02,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:02,969 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:30:02,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 794 transitions, 5005 flow. Second operand has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:30:02,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:02,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:30:02,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:03,727 INFO L124 PetriNetUnfolderBase]: 452/3080 cut-off events. [2025-03-15 02:30:03,727 INFO L125 PetriNetUnfolderBase]: For 20393/20585 co-relation queries the response was YES. [2025-03-15 02:30:03,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10837 conditions, 3080 events. 452/3080 cut-off events. For 20393/20585 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 27886 event pairs, 88 based on Foata normal form. 0/2642 useless extension candidates. Maximal degree in co-relation 8259. Up to 399 conditions per place. [2025-03-15 02:30:03,788 INFO L140 encePairwiseOnDemand]: 670/680 looper letters, 98 selfloop transitions, 14 changer transitions 15/795 dead transitions. [2025-03-15 02:30:03,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 795 transitions, 5270 flow [2025-03-15 02:30:03,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:03,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4244 transitions. [2025-03-15 02:30:03,791 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8915966386554622 [2025-03-15 02:30:03,791 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 77 predicate places. [2025-03-15 02:30:03,791 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 795 transitions, 5270 flow [2025-03-15 02:30:03,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:30:03,792 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:03,792 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:03,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:30:03,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:03,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1030484953, now seen corresponding path program 1 times [2025-03-15 02:30:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:03,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018685277] [2025-03-15 02:30:03,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:03,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:03,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018685277] [2025-03-15 02:30:03,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018685277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:03,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:03,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:03,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405375364] [2025-03-15 02:30:03,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:03,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:30:03,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:03,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:30:03,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:30:03,867 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 680 [2025-03-15 02:30:03,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 795 transitions, 5270 flow. Second operand has 4 states, 4 states have (on average 604.75) internal successors, (2419), 4 states have internal predecessors, (2419), 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:30:03,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:03,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 680 [2025-03-15 02:30:03,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:04,449 INFO L124 PetriNetUnfolderBase]: 439/3067 cut-off events. [2025-03-15 02:30:04,449 INFO L125 PetriNetUnfolderBase]: For 22118/22312 co-relation queries the response was YES. [2025-03-15 02:30:04,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11393 conditions, 3067 events. 439/3067 cut-off events. For 22118/22312 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 27966 event pairs, 80 based on Foata normal form. 0/2642 useless extension candidates. Maximal degree in co-relation 8678. Up to 399 conditions per place. [2025-03-15 02:30:04,501 INFO L140 encePairwiseOnDemand]: 670/680 looper letters, 99 selfloop transitions, 9 changer transitions 15/800 dead transitions. [2025-03-15 02:30:04,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 800 transitions, 5731 flow [2025-03-15 02:30:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:30:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:30:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2480 transitions. [2025-03-15 02:30:04,503 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9117647058823529 [2025-03-15 02:30:04,503 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 80 predicate places. [2025-03-15 02:30:04,503 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 800 transitions, 5731 flow [2025-03-15 02:30:04,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 604.75) internal successors, (2419), 4 states have internal predecessors, (2419), 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:30:04,504 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:04,504 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:04,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:30:04,504 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:04,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:04,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1828737462, now seen corresponding path program 1 times [2025-03-15 02:30:04,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:04,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066781729] [2025-03-15 02:30:04,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:04,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:04,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066781729] [2025-03-15 02:30:04,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066781729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:04,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:04,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:04,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63223839] [2025-03-15 02:30:04,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:04,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:04,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:04,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:04,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:04,665 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:04,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 800 transitions, 5731 flow. Second operand has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 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:30:04,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:04,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:04,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:05,304 INFO L124 PetriNetUnfolderBase]: 447/2987 cut-off events. [2025-03-15 02:30:05,304 INFO L125 PetriNetUnfolderBase]: For 24724/24995 co-relation queries the response was YES. [2025-03-15 02:30:05,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11862 conditions, 2987 events. 447/2987 cut-off events. For 24724/24995 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 26939 event pairs, 73 based on Foata normal form. 0/2587 useless extension candidates. Maximal degree in co-relation 9065. Up to 396 conditions per place. [2025-03-15 02:30:05,365 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 115 selfloop transitions, 25 changer transitions 15/811 dead transitions. [2025-03-15 02:30:05,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 811 transitions, 6318 flow [2025-03-15 02:30:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5957 transitions. [2025-03-15 02:30:05,368 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8760294117647058 [2025-03-15 02:30:05,369 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 89 predicate places. [2025-03-15 02:30:05,369 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 811 transitions, 6318 flow [2025-03-15 02:30:05,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 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:30:05,370 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:05,370 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:05,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 02:30:05,370 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:05,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:05,371 INFO L85 PathProgramCache]: Analyzing trace with hash 856288265, now seen corresponding path program 1 times [2025-03-15 02:30:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395382601] [2025-03-15 02:30:05,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:05,520 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:05,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395382601] [2025-03-15 02:30:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395382601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:05,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:05,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:05,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486342895] [2025-03-15 02:30:05,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:05,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:05,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:05,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:05,524 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:05,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 811 transitions, 6318 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:05,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:05,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:05,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:06,244 INFO L124 PetriNetUnfolderBase]: 459/2985 cut-off events. [2025-03-15 02:30:06,244 INFO L125 PetriNetUnfolderBase]: For 27216/27649 co-relation queries the response was YES. [2025-03-15 02:30:06,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12534 conditions, 2985 events. 459/2985 cut-off events. For 27216/27649 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 26801 event pairs, 74 based on Foata normal form. 0/2599 useless extension candidates. Maximal degree in co-relation 9655. Up to 392 conditions per place. [2025-03-15 02:30:06,311 INFO L140 encePairwiseOnDemand]: 663/680 looper letters, 138 selfloop transitions, 30 changer transitions 15/833 dead transitions. [2025-03-15 02:30:06,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 833 transitions, 7318 flow [2025-03-15 02:30:06,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5957 transitions. [2025-03-15 02:30:06,314 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8760294117647058 [2025-03-15 02:30:06,314 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 98 predicate places. [2025-03-15 02:30:06,315 INFO L471 AbstractCegarLoop]: Abstraction has has 726 places, 833 transitions, 7318 flow [2025-03-15 02:30:06,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:06,315 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:06,315 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 02:30:06,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:06,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:06,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1009216331, now seen corresponding path program 1 times [2025-03-15 02:30:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678993638] [2025-03-15 02:30:06,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678993638] [2025-03-15 02:30:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678993638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:06,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481212906] [2025-03-15 02:30:06,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:06,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:06,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:06,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:06,414 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:30:06,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 833 transitions, 7318 flow. Second operand has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:30:06,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:06,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:30:06,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:07,100 INFO L124 PetriNetUnfolderBase]: 534/3314 cut-off events. [2025-03-15 02:30:07,100 INFO L125 PetriNetUnfolderBase]: For 31811/31946 co-relation queries the response was YES. [2025-03-15 02:30:07,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14668 conditions, 3314 events. 534/3314 cut-off events. For 31811/31946 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 31015 event pairs, 95 based on Foata normal form. 0/2881 useless extension candidates. Maximal degree in co-relation 11524. Up to 423 conditions per place. [2025-03-15 02:30:07,145 INFO L140 encePairwiseOnDemand]: 670/680 looper letters, 146 selfloop transitions, 14 changer transitions 15/843 dead transitions. [2025-03-15 02:30:07,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 843 transitions, 7812 flow [2025-03-15 02:30:07,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:07,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:07,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 4249 transitions. [2025-03-15 02:30:07,148 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8926470588235295 [2025-03-15 02:30:07,148 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 103 predicate places. [2025-03-15 02:30:07,148 INFO L471 AbstractCegarLoop]: Abstraction has has 731 places, 843 transitions, 7812 flow [2025-03-15 02:30:07,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:30:07,149 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:07,149 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 02:30:07,149 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:07,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:07,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1178822976, now seen corresponding path program 1 times [2025-03-15 02:30:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404870090] [2025-03-15 02:30:07,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:07,217 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:07,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:07,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404870090] [2025-03-15 02:30:07,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404870090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:07,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:07,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625367613] [2025-03-15 02:30:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:30:07,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:07,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:30:07,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:30:07,219 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 602 out of 680 [2025-03-15 02:30:07,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 843 transitions, 7812 flow. Second operand has 4 states, 4 states have (on average 605.0) internal successors, (2420), 4 states have internal predecessors, (2420), 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:30:07,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:07,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 602 of 680 [2025-03-15 02:30:07,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:07,874 INFO L124 PetriNetUnfolderBase]: 548/3315 cut-off events. [2025-03-15 02:30:07,875 INFO L125 PetriNetUnfolderBase]: For 38755/38892 co-relation queries the response was YES. [2025-03-15 02:30:07,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15667 conditions, 3315 events. 548/3315 cut-off events. For 38755/38892 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 31213 event pairs, 94 based on Foata normal form. 13/2895 useless extension candidates. Maximal degree in co-relation 11961. Up to 433 conditions per place. [2025-03-15 02:30:07,953 INFO L140 encePairwiseOnDemand]: 670/680 looper letters, 129 selfloop transitions, 10 changer transitions 17/851 dead transitions. [2025-03-15 02:30:07,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 851 transitions, 8379 flow [2025-03-15 02:30:07,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:30:07,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:30:07,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2473 transitions. [2025-03-15 02:30:07,955 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9091911764705882 [2025-03-15 02:30:07,955 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 103 predicate places. [2025-03-15 02:30:07,955 INFO L471 AbstractCegarLoop]: Abstraction has has 731 places, 851 transitions, 8379 flow [2025-03-15 02:30:07,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 605.0) internal successors, (2420), 4 states have internal predecessors, (2420), 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:30:07,956 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:07,956 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 02:30:07,956 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:07,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:07,957 INFO L85 PathProgramCache]: Analyzing trace with hash 442293853, now seen corresponding path program 1 times [2025-03-15 02:30:07,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143626842] [2025-03-15 02:30:07,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143626842] [2025-03-15 02:30:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143626842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:08,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:08,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454468504] [2025-03-15 02:30:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:08,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:08,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:08,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:08,168 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 680 [2025-03-15 02:30:08,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 851 transitions, 8379 flow. Second operand has 6 states, 6 states have (on average 551.0) internal successors, (3306), 6 states have internal predecessors, (3306), 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:30:08,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:08,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 680 [2025-03-15 02:30:08,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:09,013 INFO L124 PetriNetUnfolderBase]: 707/3219 cut-off events. [2025-03-15 02:30:09,013 INFO L125 PetriNetUnfolderBase]: For 493367/518140 co-relation queries the response was YES. [2025-03-15 02:30:09,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20343 conditions, 3219 events. 707/3219 cut-off events. For 493367/518140 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 29448 event pairs, 115 based on Foata normal form. 90/2873 useless extension candidates. Maximal degree in co-relation 14229. Up to 726 conditions per place. [2025-03-15 02:30:09,096 INFO L140 encePairwiseOnDemand]: 658/680 looper letters, 203 selfloop transitions, 26 changer transitions 17/887 dead transitions. [2025-03-15 02:30:09,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 736 places, 887 transitions, 9513 flow [2025-03-15 02:30:09,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:09,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3963 transitions. [2025-03-15 02:30:09,099 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8325630252100841 [2025-03-15 02:30:09,099 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 108 predicate places. [2025-03-15 02:30:09,099 INFO L471 AbstractCegarLoop]: Abstraction has has 736 places, 887 transitions, 9513 flow [2025-03-15 02:30:09,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 551.0) internal successors, (3306), 6 states have internal predecessors, (3306), 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:30:09,100 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:09,100 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:09,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 02:30:09,100 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:09,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:09,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1248481440, now seen corresponding path program 1 times [2025-03-15 02:30:09,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:09,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516934924] [2025-03-15 02:30:09,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:09,217 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516934924] [2025-03-15 02:30:09,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516934924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:09,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:09,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:09,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360305667] [2025-03-15 02:30:09,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:09,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:09,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:09,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:09,219 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:30:09,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 736 places, 887 transitions, 9513 flow. Second operand has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:30:09,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:09,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:30:09,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:09,963 INFO L124 PetriNetUnfolderBase]: 704/3211 cut-off events. [2025-03-15 02:30:09,964 INFO L125 PetriNetUnfolderBase]: For 511909/536406 co-relation queries the response was YES. [2025-03-15 02:30:10,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21127 conditions, 3211 events. 704/3211 cut-off events. For 511909/536406 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29284 event pairs, 115 based on Foata normal form. 0/2780 useless extension candidates. Maximal degree in co-relation 14813. Up to 720 conditions per place. [2025-03-15 02:30:10,034 INFO L140 encePairwiseOnDemand]: 672/680 looper letters, 140 selfloop transitions, 12 changer transitions 17/886 dead transitions. [2025-03-15 02:30:10,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 740 places, 886 transitions, 9803 flow [2025-03-15 02:30:10,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:30:10,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:30:10,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3639 transitions. [2025-03-15 02:30:10,036 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8919117647058824 [2025-03-15 02:30:10,036 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 112 predicate places. [2025-03-15 02:30:10,037 INFO L471 AbstractCegarLoop]: Abstraction has has 740 places, 886 transitions, 9803 flow [2025-03-15 02:30:10,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.1666666666666) internal successors, (3601), 6 states have internal predecessors, (3601), 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:30:10,037 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:10,037 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 02:30:10,037 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:10,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1758251778, now seen corresponding path program 1 times [2025-03-15 02:30:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:10,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491137977] [2025-03-15 02:30:10,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:10,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:10,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491137977] [2025-03-15 02:30:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491137977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:10,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:10,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:10,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052761161] [2025-03-15 02:30:10,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:10,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:30:10,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:10,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:30:10,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:30:10,086 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 680 [2025-03-15 02:30:10,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 740 places, 886 transitions, 9803 flow. Second operand has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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:30:10,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:10,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 680 [2025-03-15 02:30:10,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:10,738 INFO L124 PetriNetUnfolderBase]: 711/3226 cut-off events. [2025-03-15 02:30:10,738 INFO L125 PetriNetUnfolderBase]: For 638342/670164 co-relation queries the response was YES. [2025-03-15 02:30:10,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21708 conditions, 3226 events. 711/3226 cut-off events. For 638342/670164 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 29538 event pairs, 121 based on Foata normal form. 50/2845 useless extension candidates. Maximal degree in co-relation 15201. Up to 727 conditions per place. [2025-03-15 02:30:10,822 INFO L140 encePairwiseOnDemand]: 676/680 looper letters, 87 selfloop transitions, 3 changer transitions 17/889 dead transitions. [2025-03-15 02:30:10,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 742 places, 889 transitions, 10044 flow [2025-03-15 02:30:10,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:30:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:30:10,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1944 transitions. [2025-03-15 02:30:10,824 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9529411764705882 [2025-03-15 02:30:10,824 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 114 predicate places. [2025-03-15 02:30:10,824 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 889 transitions, 10044 flow [2025-03-15 02:30:10,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.3333333333334) internal successors, (1933), 3 states have internal predecessors, (1933), 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:30:10,824 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:10,824 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:10,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 02:30:10,824 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:10,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:10,825 INFO L85 PathProgramCache]: Analyzing trace with hash -650111794, now seen corresponding path program 1 times [2025-03-15 02:30:10,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:10,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423788306] [2025-03-15 02:30:10,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:10,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:10,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:10,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423788306] [2025-03-15 02:30:10,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423788306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:10,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:10,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:10,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175812156] [2025-03-15 02:30:10,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:10,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:10,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:10,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:10,975 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 680 [2025-03-15 02:30:10,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 889 transitions, 10044 flow. Second operand has 6 states, 6 states have (on average 551.1666666666666) internal successors, (3307), 6 states have internal predecessors, (3307), 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:30:10,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:10,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 680 [2025-03-15 02:30:10,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:11,842 INFO L124 PetriNetUnfolderBase]: 705/3208 cut-off events. [2025-03-15 02:30:11,843 INFO L125 PetriNetUnfolderBase]: For 694950/791360 co-relation queries the response was YES. [2025-03-15 02:30:11,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22721 conditions, 3208 events. 705/3208 cut-off events. For 694950/791360 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 29375 event pairs, 121 based on Foata normal form. 90/2879 useless extension candidates. Maximal degree in co-relation 16021. Up to 881 conditions per place. [2025-03-15 02:30:11,941 INFO L140 encePairwiseOnDemand]: 657/680 looper letters, 225 selfloop transitions, 31 changer transitions 17/912 dead transitions. [2025-03-15 02:30:11,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 747 places, 912 transitions, 11255 flow [2025-03-15 02:30:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:11,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3948 transitions. [2025-03-15 02:30:11,943 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8294117647058824 [2025-03-15 02:30:11,943 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 119 predicate places. [2025-03-15 02:30:11,943 INFO L471 AbstractCegarLoop]: Abstraction has has 747 places, 912 transitions, 11255 flow [2025-03-15 02:30:11,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 551.1666666666666) internal successors, (3307), 6 states have internal predecessors, (3307), 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:30:11,944 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:11,944 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:11,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 02:30:11,944 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1542246966, now seen corresponding path program 1 times [2025-03-15 02:30:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:11,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473164883] [2025-03-15 02:30:11,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:12,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473164883] [2025-03-15 02:30:12,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473164883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:12,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:12,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:12,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251980636] [2025-03-15 02:30:12,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:12,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:12,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:12,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:12,077 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:12,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 747 places, 912 transitions, 11255 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:12,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:12,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:12,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:12,970 INFO L124 PetriNetUnfolderBase]: 713/3126 cut-off events. [2025-03-15 02:30:12,970 INFO L125 PetriNetUnfolderBase]: For 652419/755907 co-relation queries the response was YES. [2025-03-15 02:30:13,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23263 conditions, 3126 events. 713/3126 cut-off events. For 652419/755907 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 28203 event pairs, 112 based on Foata normal form. 76/2808 useless extension candidates. Maximal degree in co-relation 16299. Up to 839 conditions per place. [2025-03-15 02:30:13,063 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 176 selfloop transitions, 40 changer transitions 17/923 dead transitions. [2025-03-15 02:30:13,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 756 places, 923 transitions, 12158 flow [2025-03-15 02:30:13,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:13,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:13,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5958 transitions. [2025-03-15 02:30:13,066 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8761764705882353 [2025-03-15 02:30:13,066 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 128 predicate places. [2025-03-15 02:30:13,066 INFO L471 AbstractCegarLoop]: Abstraction has has 756 places, 923 transitions, 12158 flow [2025-03-15 02:30:13,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:13,067 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:13,067 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:13,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 02:30:13,067 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:13,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:13,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1756913735, now seen corresponding path program 1 times [2025-03-15 02:30:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:13,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446067935] [2025-03-15 02:30:13,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:13,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:13,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:13,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446067935] [2025-03-15 02:30:13,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446067935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:13,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:13,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:30:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968128969] [2025-03-15 02:30:13,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:13,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:30:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:13,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:30:13,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:30:13,121 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 680 [2025-03-15 02:30:13,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 756 places, 923 transitions, 12158 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:30:13,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:13,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 680 [2025-03-15 02:30:13,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:14,313 INFO L124 PetriNetUnfolderBase]: 1155/4838 cut-off events. [2025-03-15 02:30:14,313 INFO L125 PetriNetUnfolderBase]: For 946420/1077733 co-relation queries the response was YES. [2025-03-15 02:30:14,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38189 conditions, 4838 events. 1155/4838 cut-off events. For 946420/1077733 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 46562 event pairs, 177 based on Foata normal form. 28/4184 useless extension candidates. Maximal degree in co-relation 26259. Up to 1324 conditions per place. [2025-03-15 02:30:14,465 INFO L140 encePairwiseOnDemand]: 672/680 looper letters, 205 selfloop transitions, 4 changer transitions 20/1009 dead transitions. [2025-03-15 02:30:14,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 758 places, 1009 transitions, 16508 flow [2025-03-15 02:30:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:30:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:30:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1929 transitions. [2025-03-15 02:30:14,467 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9455882352941176 [2025-03-15 02:30:14,467 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 130 predicate places. [2025-03-15 02:30:14,467 INFO L471 AbstractCegarLoop]: Abstraction has has 758 places, 1009 transitions, 16508 flow [2025-03-15 02:30:14,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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:30:14,468 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:14,468 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:14,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 02:30:14,468 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:14,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:14,469 INFO L85 PathProgramCache]: Analyzing trace with hash 565017723, now seen corresponding path program 1 times [2025-03-15 02:30:14,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:14,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793429136] [2025-03-15 02:30:14,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:14,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:14,589 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:14,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:14,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793429136] [2025-03-15 02:30:14,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793429136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:14,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:14,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:14,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571278621] [2025-03-15 02:30:14,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:14,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:14,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:14,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:14,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:14,592 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:14,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 1009 transitions, 16508 flow. Second operand has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:30:14,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:14,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:14,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:16,038 INFO L124 PetriNetUnfolderBase]: 1161/4825 cut-off events. [2025-03-15 02:30:16,038 INFO L125 PetriNetUnfolderBase]: For 941316/1095335 co-relation queries the response was YES. [2025-03-15 02:30:16,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39671 conditions, 4825 events. 1161/4825 cut-off events. For 941316/1095335 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 46616 event pairs, 177 based on Foata normal form. 278/4465 useless extension candidates. Maximal degree in co-relation 27508. Up to 1316 conditions per place. [2025-03-15 02:30:16,206 INFO L140 encePairwiseOnDemand]: 663/680 looper letters, 260 selfloop transitions, 44 changer transitions 31/1043 dead transitions. [2025-03-15 02:30:16,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 767 places, 1043 transitions, 18852 flow [2025-03-15 02:30:16,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5957 transitions. [2025-03-15 02:30:16,209 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8760294117647058 [2025-03-15 02:30:16,209 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 139 predicate places. [2025-03-15 02:30:16,209 INFO L471 AbstractCegarLoop]: Abstraction has has 767 places, 1043 transitions, 18852 flow [2025-03-15 02:30:16,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:30:16,210 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:16,210 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:16,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 02:30:16,210 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:16,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:16,211 INFO L85 PathProgramCache]: Analyzing trace with hash -295815025, now seen corresponding path program 1 times [2025-03-15 02:30:16,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:16,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658465689] [2025-03-15 02:30:16,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:16,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:16,356 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:16,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:16,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658465689] [2025-03-15 02:30:16,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658465689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:16,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:16,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:16,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610411266] [2025-03-15 02:30:16,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:16,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:16,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:16,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:16,359 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 680 [2025-03-15 02:30:16,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 767 places, 1043 transitions, 18852 flow. Second operand has 6 states, 6 states have (on average 551.1666666666666) internal successors, (3307), 6 states have internal predecessors, (3307), 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:30:16,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:16,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 680 [2025-03-15 02:30:16,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:18,271 INFO L124 PetriNetUnfolderBase]: 1437/5306 cut-off events. [2025-03-15 02:30:18,272 INFO L125 PetriNetUnfolderBase]: For 2000639/2307868 co-relation queries the response was YES. [2025-03-15 02:30:18,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49663 conditions, 5306 events. 1437/5306 cut-off events. For 2000639/2307868 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 52157 event pairs, 221 based on Foata normal form. 505/5035 useless extension candidates. Maximal degree in co-relation 36942. Up to 1573 conditions per place. [2025-03-15 02:30:18,383 INFO L140 encePairwiseOnDemand]: 658/680 looper letters, 297 selfloop transitions, 26 changer transitions 68/1095 dead transitions. [2025-03-15 02:30:18,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 772 places, 1095 transitions, 21338 flow [2025-03-15 02:30:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3965 transitions. [2025-03-15 02:30:18,385 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.832983193277311 [2025-03-15 02:30:18,385 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 144 predicate places. [2025-03-15 02:30:18,385 INFO L471 AbstractCegarLoop]: Abstraction has has 772 places, 1095 transitions, 21338 flow [2025-03-15 02:30:18,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 551.1666666666666) internal successors, (3307), 6 states have internal predecessors, (3307), 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:30:18,386 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:18,386 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:18,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 02:30:18,386 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:18,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:18,387 INFO L85 PathProgramCache]: Analyzing trace with hash 351713282, now seen corresponding path program 1 times [2025-03-15 02:30:18,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:18,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091618403] [2025-03-15 02:30:18,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:18,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091618403] [2025-03-15 02:30:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091618403] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435154366] [2025-03-15 02:30:18,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:30:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:18,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:30:18,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:30:18,429 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 680 [2025-03-15 02:30:18,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 772 places, 1095 transitions, 21338 flow. Second operand has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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:30:18,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:18,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 680 [2025-03-15 02:30:18,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:19,929 INFO L124 PetriNetUnfolderBase]: 1451/5332 cut-off events. [2025-03-15 02:30:19,929 INFO L125 PetriNetUnfolderBase]: For 2632260/2964925 co-relation queries the response was YES. [2025-03-15 02:30:20,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51039 conditions, 5332 events. 1451/5332 cut-off events. For 2632260/2964925 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 52845 event pairs, 232 based on Foata normal form. 60/4616 useless extension candidates. Maximal degree in co-relation 38008. Up to 1587 conditions per place. [2025-03-15 02:30:20,084 INFO L140 encePairwiseOnDemand]: 676/680 looper letters, 180 selfloop transitions, 3 changer transitions 68/1099 dead transitions. [2025-03-15 02:30:20,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 1099 transitions, 21942 flow [2025-03-15 02:30:20,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:30:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:30:20,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1944 transitions. [2025-03-15 02:30:20,086 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9529411764705882 [2025-03-15 02:30:20,086 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 146 predicate places. [2025-03-15 02:30:20,086 INFO L471 AbstractCegarLoop]: Abstraction has has 774 places, 1099 transitions, 21942 flow [2025-03-15 02:30:20,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 644.6666666666666) internal successors, (1934), 3 states have internal predecessors, (1934), 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:30:20,086 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:20,087 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:20,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 02:30:20,087 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:20,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash -158057056, now seen corresponding path program 1 times [2025-03-15 02:30:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:20,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612980786] [2025-03-15 02:30:20,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:20,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:20,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612980786] [2025-03-15 02:30:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612980786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:20,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657650977] [2025-03-15 02:30:20,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:20,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:20,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:20,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:20,174 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 680 [2025-03-15 02:30:20,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 1099 transitions, 21942 flow. Second operand has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:30:20,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:20,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 680 [2025-03-15 02:30:20,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:21,902 INFO L124 PetriNetUnfolderBase]: 1445/5314 cut-off events. [2025-03-15 02:30:21,902 INFO L125 PetriNetUnfolderBase]: For 2788913/3180669 co-relation queries the response was YES. [2025-03-15 02:30:21,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52574 conditions, 5314 events. 1445/5314 cut-off events. For 2788913/3180669 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 52693 event pairs, 234 based on Foata normal form. 200/4750 useless extension candidates. Maximal degree in co-relation 39225. Up to 1584 conditions per place. [2025-03-15 02:30:21,994 INFO L140 encePairwiseOnDemand]: 672/680 looper letters, 252 selfloop transitions, 12 changer transitions 68/1098 dead transitions. [2025-03-15 02:30:21,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 778 places, 1098 transitions, 22558 flow [2025-03-15 02:30:21,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:30:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:30:21,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3639 transitions. [2025-03-15 02:30:21,996 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8919117647058824 [2025-03-15 02:30:21,996 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 150 predicate places. [2025-03-15 02:30:21,996 INFO L471 AbstractCegarLoop]: Abstraction has has 778 places, 1098 transitions, 22558 flow [2025-03-15 02:30:21,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 600.3333333333334) internal successors, (3602), 6 states have internal predecessors, (3602), 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:30:21,997 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:21,997 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:21,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 02:30:21,997 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:21,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2056650290, now seen corresponding path program 1 times [2025-03-15 02:30:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190020108] [2025-03-15 02:30:21,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:21,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:22,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:22,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190020108] [2025-03-15 02:30:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190020108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:22,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:22,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593337724] [2025-03-15 02:30:22,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:22,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:22,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:22,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:22,109 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 546 out of 680 [2025-03-15 02:30:22,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 778 places, 1098 transitions, 22558 flow. Second operand has 6 states, 6 states have (on average 551.3333333333334) internal successors, (3308), 6 states have internal predecessors, (3308), 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:30:22,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:22,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 546 of 680 [2025-03-15 02:30:22,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:24,363 INFO L124 PetriNetUnfolderBase]: 1432/5284 cut-off events. [2025-03-15 02:30:24,363 INFO L125 PetriNetUnfolderBase]: For 2905201/3525616 co-relation queries the response was YES. [2025-03-15 02:30:24,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54368 conditions, 5284 events. 1432/5284 cut-off events. For 2905201/3525616 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 52070 event pairs, 234 based on Foata normal form. 577/5141 useless extension candidates. Maximal degree in co-relation 40709. Up to 1594 conditions per place. [2025-03-15 02:30:24,536 INFO L140 encePairwiseOnDemand]: 657/680 looper letters, 285 selfloop transitions, 31 changer transitions 110/1132 dead transitions. [2025-03-15 02:30:24,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 783 places, 1132 transitions, 24994 flow [2025-03-15 02:30:24,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:30:24,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:30:24,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3948 transitions. [2025-03-15 02:30:24,538 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8294117647058824 [2025-03-15 02:30:24,538 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 155 predicate places. [2025-03-15 02:30:24,538 INFO L471 AbstractCegarLoop]: Abstraction has has 783 places, 1132 transitions, 24994 flow [2025-03-15 02:30:24,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 551.3333333333334) internal successors, (3308), 6 states have internal predecessors, (3308), 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:30:24,539 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:24,539 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:24,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 02:30:24,539 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:24,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:24,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1618470959, now seen corresponding path program 1 times [2025-03-15 02:30:24,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:24,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410706777] [2025-03-15 02:30:24,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:24,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:24,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:24,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410706777] [2025-03-15 02:30:24,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410706777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:24,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:24,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:24,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524243823] [2025-03-15 02:30:24,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:24,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:24,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:24,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:24,660 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:24,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 783 places, 1132 transitions, 24994 flow. Second operand has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 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:30:24,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:24,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:24,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:26,459 INFO L124 PetriNetUnfolderBase]: 1443/5334 cut-off events. [2025-03-15 02:30:26,459 INFO L125 PetriNetUnfolderBase]: For 3190176/3682653 co-relation queries the response was YES. [2025-03-15 02:30:26,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56160 conditions, 5334 events. 1443/5334 cut-off events. For 3190176/3682653 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 53336 event pairs, 230 based on Foata normal form. 166/4786 useless extension candidates. Maximal degree in co-relation 42277. Up to 1634 conditions per place. [2025-03-15 02:30:26,657 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 234 selfloop transitions, 24 changer transitions 110/1132 dead transitions. [2025-03-15 02:30:26,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 1132 transitions, 25580 flow [2025-03-15 02:30:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5953 transitions. [2025-03-15 02:30:26,659 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8754411764705883 [2025-03-15 02:30:26,660 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 163 predicate places. [2025-03-15 02:30:26,660 INFO L471 AbstractCegarLoop]: Abstraction has has 791 places, 1132 transitions, 25580 flow [2025-03-15 02:30:26,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.125) internal successors, (4721), 8 states have internal predecessors, (4721), 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:30:26,661 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:26,661 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 02:30:26,661 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:26,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1306842233, now seen corresponding path program 1 times [2025-03-15 02:30:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:26,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172869595] [2025-03-15 02:30:26,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:26,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:26,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172869595] [2025-03-15 02:30:26,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172869595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:26,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:26,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:30:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785269646] [2025-03-15 02:30:26,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:26,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:30:26,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:26,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:30:26,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:30:26,713 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 680 [2025-03-15 02:30:26,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 791 places, 1132 transitions, 25580 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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:30:26,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:26,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 680 [2025-03-15 02:30:26,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:29,761 INFO L124 PetriNetUnfolderBase]: 2027/7276 cut-off events. [2025-03-15 02:30:29,762 INFO L125 PetriNetUnfolderBase]: For 10503146/13032077 co-relation queries the response was YES. [2025-03-15 02:30:29,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78758 conditions, 7276 events. 2027/7276 cut-off events. For 10503146/13032077 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 79190 event pairs, 305 based on Foata normal form. 106/6334 useless extension candidates. Maximal degree in co-relation 64475. Up to 2232 conditions per place. [2025-03-15 02:30:29,963 INFO L140 encePairwiseOnDemand]: 672/680 looper letters, 243 selfloop transitions, 4 changer transitions 134/1224 dead transitions. [2025-03-15 02:30:29,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 793 places, 1224 transitions, 31612 flow [2025-03-15 02:30:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:30:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:30:29,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1928 transitions. [2025-03-15 02:30:29,964 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9450980392156862 [2025-03-15 02:30:29,964 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 165 predicate places. [2025-03-15 02:30:29,964 INFO L471 AbstractCegarLoop]: Abstraction has has 793 places, 1224 transitions, 31612 flow [2025-03-15 02:30:29,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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:30:29,965 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:29,965 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:29,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 02:30:29,965 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:29,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1367009651, now seen corresponding path program 1 times [2025-03-15 02:30:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:29,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787657602] [2025-03-15 02:30:29,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:30,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:30,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787657602] [2025-03-15 02:30:30,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787657602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:30,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:30,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:30,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255452993] [2025-03-15 02:30:30,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:30,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:30,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:30,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:30,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:30,086 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:30,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 793 places, 1224 transitions, 31612 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:30,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:30,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:30,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:33,615 INFO L124 PetriNetUnfolderBase]: 2065/7278 cut-off events. [2025-03-15 02:30:33,615 INFO L125 PetriNetUnfolderBase]: For 11167913/13869661 co-relation queries the response was YES. [2025-03-15 02:30:33,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81169 conditions, 7278 events. 2065/7278 cut-off events. For 11167913/13869661 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 79699 event pairs, 316 based on Foata normal form. 819/7063 useless extension candidates. Maximal degree in co-relation 66671. Up to 2228 conditions per place. [2025-03-15 02:30:33,803 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 302 selfloop transitions, 25 changer transitions 143/1238 dead transitions. [2025-03-15 02:30:33,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 801 places, 1238 transitions, 33200 flow [2025-03-15 02:30:33,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5952 transitions. [2025-03-15 02:30:33,805 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8752941176470588 [2025-03-15 02:30:33,805 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 173 predicate places. [2025-03-15 02:30:33,805 INFO L471 AbstractCegarLoop]: Abstraction has has 801 places, 1238 transitions, 33200 flow [2025-03-15 02:30:33,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:33,806 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:33,806 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:33,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 02:30:33,806 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:33,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash -970573565, now seen corresponding path program 1 times [2025-03-15 02:30:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:33,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588893850] [2025-03-15 02:30:33,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:33,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588893850] [2025-03-15 02:30:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588893850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:33,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465439051] [2025-03-15 02:30:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:33,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:33,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:33,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:33,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:33,928 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:33,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 801 places, 1238 transitions, 33200 flow. Second operand has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:33,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:33,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:33,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:37,757 INFO L124 PetriNetUnfolderBase]: 2087/7380 cut-off events. [2025-03-15 02:30:37,757 INFO L125 PetriNetUnfolderBase]: For 11915104/14612379 co-relation queries the response was YES. [2025-03-15 02:30:37,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84001 conditions, 7380 events. 2087/7380 cut-off events. For 11915104/14612379 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 81314 event pairs, 297 based on Foata normal form. 684/7039 useless extension candidates. Maximal degree in co-relation 69191. Up to 2316 conditions per place. [2025-03-15 02:30:37,999 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 252 selfloop transitions, 38 changer transitions 170/1236 dead transitions. [2025-03-15 02:30:38,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 1236 transitions, 33824 flow [2025-03-15 02:30:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5954 transitions. [2025-03-15 02:30:38,002 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8755882352941177 [2025-03-15 02:30:38,003 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 181 predicate places. [2025-03-15 02:30:38,003 INFO L471 AbstractCegarLoop]: Abstraction has has 809 places, 1236 transitions, 33824 flow [2025-03-15 02:30:38,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.25) internal successors, (4722), 8 states have internal predecessors, (4722), 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:30:38,003 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:38,003 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:38,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 02:30:38,004 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:38,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash -23007373, now seen corresponding path program 1 times [2025-03-15 02:30:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:38,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117524102] [2025-03-15 02:30:38,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:38,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:38,352 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:38,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117524102] [2025-03-15 02:30:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117524102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:30:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660758753] [2025-03-15 02:30:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:38,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:30:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:38,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:30:38,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:30:38,356 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 680 [2025-03-15 02:30:38,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 1236 transitions, 33824 flow. Second operand has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:30:38,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:38,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 680 [2025-03-15 02:30:38,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:42,525 INFO L124 PetriNetUnfolderBase]: 2123/7368 cut-off events. [2025-03-15 02:30:42,526 INFO L125 PetriNetUnfolderBase]: For 13208138/15790832 co-relation queries the response was YES. [2025-03-15 02:30:42,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86449 conditions, 7368 events. 2123/7368 cut-off events. For 13208138/15790832 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 81628 event pairs, 306 based on Foata normal form. 652/7030 useless extension candidates. Maximal degree in co-relation 71327. Up to 2264 conditions per place. [2025-03-15 02:30:42,759 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 191 selfloop transitions, 31 changer transitions 270/1258 dead transitions. [2025-03-15 02:30:42,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 817 places, 1258 transitions, 36136 flow [2025-03-15 02:30:42,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:30:42,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:30:42,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 5952 transitions. [2025-03-15 02:30:42,761 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8752941176470588 [2025-03-15 02:30:42,762 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 189 predicate places. [2025-03-15 02:30:42,762 INFO L471 AbstractCegarLoop]: Abstraction has has 817 places, 1258 transitions, 36136 flow [2025-03-15 02:30:42,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 590.375) internal successors, (4723), 8 states have internal predecessors, (4723), 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:30:42,762 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:42,762 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:42,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 02:30:42,763 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:42,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:42,764 INFO L85 PathProgramCache]: Analyzing trace with hash 988206463, now seen corresponding path program 1 times [2025-03-15 02:30:42,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:42,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497856548] [2025-03-15 02:30:42,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:42,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:42,828 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:42,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:42,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497856548] [2025-03-15 02:30:42,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497856548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:42,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:42,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:42,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188198170] [2025-03-15 02:30:42,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:42,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:30:42,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:42,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:30:42,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:30:42,830 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:30:42,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 817 places, 1258 transitions, 36136 flow. Second operand has 4 states, 4 states have (on average 622.25) internal successors, (2489), 4 states have internal predecessors, (2489), 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:30:42,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:42,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:30:42,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:46,278 INFO L124 PetriNetUnfolderBase]: 2127/7268 cut-off events. [2025-03-15 02:30:46,278 INFO L125 PetriNetUnfolderBase]: For 10025724/12839608 co-relation queries the response was YES. [2025-03-15 02:30:46,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87355 conditions, 7268 events. 2127/7268 cut-off events. For 10025724/12839608 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 80266 event pairs, 315 based on Foata normal form. 1070/7363 useless extension candidates. Maximal degree in co-relation 71551. Up to 2188 conditions per place. [2025-03-15 02:30:46,547 INFO L140 encePairwiseOnDemand]: 672/680 looper letters, 167 selfloop transitions, 6 changer transitions 270/1263 dead transitions. [2025-03-15 02:30:46,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 821 places, 1263 transitions, 37094 flow [2025-03-15 02:30:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:30:46,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:30:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3162 transitions. [2025-03-15 02:30:46,549 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.93 [2025-03-15 02:30:46,549 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 193 predicate places. [2025-03-15 02:30:46,549 INFO L471 AbstractCegarLoop]: Abstraction has has 821 places, 1263 transitions, 37094 flow [2025-03-15 02:30:46,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 622.25) internal successors, (2489), 4 states have internal predecessors, (2489), 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:30:46,550 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:46,550 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:46,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 02:30:46,550 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -74838657, now seen corresponding path program 1 times [2025-03-15 02:30:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506741100] [2025-03-15 02:30:46,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:46,618 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:46,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:46,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506741100] [2025-03-15 02:30:46,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506741100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:46,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:46,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:46,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419173069] [2025-03-15 02:30:46,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:46,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:30:46,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:46,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:30:46,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:30:46,620 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:30:46,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 821 places, 1263 transitions, 37094 flow. Second operand has 4 states, 4 states have (on average 622.5) internal successors, (2490), 4 states have internal predecessors, (2490), 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:30:46,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:46,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:30:46,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:50,116 INFO L124 PetriNetUnfolderBase]: 2143/7282 cut-off events. [2025-03-15 02:30:50,117 INFO L125 PetriNetUnfolderBase]: For 11809102/14728512 co-relation queries the response was YES. [2025-03-15 02:30:50,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89366 conditions, 7282 events. 2143/7282 cut-off events. For 11809102/14728512 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 80379 event pairs, 323 based on Foata normal form. 103/6416 useless extension candidates. Maximal degree in co-relation 73248. Up to 2204 conditions per place. [2025-03-15 02:30:50,457 INFO L140 encePairwiseOnDemand]: 672/680 looper letters, 171 selfloop transitions, 6 changer transitions 270/1270 dead transitions. [2025-03-15 02:30:50,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 1270 transitions, 38226 flow [2025-03-15 02:30:50,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:30:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:30:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3161 transitions. [2025-03-15 02:30:50,459 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9297058823529412 [2025-03-15 02:30:50,459 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 197 predicate places. [2025-03-15 02:30:50,459 INFO L471 AbstractCegarLoop]: Abstraction has has 825 places, 1270 transitions, 38226 flow [2025-03-15 02:30:50,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 622.5) internal successors, (2490), 4 states have internal predecessors, (2490), 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:30:50,460 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:50,460 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:50,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-15 02:30:50,460 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:50,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:50,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1376922627, now seen corresponding path program 1 times [2025-03-15 02:30:50,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:50,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865552811] [2025-03-15 02:30:50,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:50,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:50,563 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:50,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865552811] [2025-03-15 02:30:50,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865552811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:30:50,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908080644] [2025-03-15 02:30:50,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:50,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:30:50,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:30:50,566 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:30:50,567 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:30:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:50,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 02:30:50,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:30:50,781 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:50,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:30:50,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908080644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:50,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:30:50,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-15 02:30:50,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549250138] [2025-03-15 02:30:50,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:50,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:30:50,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:50,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:30:50,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:30:50,783 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:30:50,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 1270 transitions, 38226 flow. Second operand has 5 states, 5 states have (on average 623.4) internal successors, (3117), 5 states have internal predecessors, (3117), 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:30:50,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:50,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:30:50,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:54,872 INFO L124 PetriNetUnfolderBase]: 2477/8070 cut-off events. [2025-03-15 02:30:54,872 INFO L125 PetriNetUnfolderBase]: For 12814416/16112607 co-relation queries the response was YES. [2025-03-15 02:30:55,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105821 conditions, 8070 events. 2477/8070 cut-off events. For 12814416/16112607 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 94810 event pairs, 326 based on Foata normal form. 1285/8199 useless extension candidates. Maximal degree in co-relation 89374. Up to 2596 conditions per place. [2025-03-15 02:30:55,072 INFO L140 encePairwiseOnDemand]: 671/680 looper letters, 175 selfloop transitions, 8 changer transitions 382/1388 dead transitions. [2025-03-15 02:30:55,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 827 places, 1388 transitions, 49291 flow [2025-03-15 02:30:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:30:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:30:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3782 transitions. [2025-03-15 02:30:55,074 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9269607843137255 [2025-03-15 02:30:55,074 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 199 predicate places. [2025-03-15 02:30:55,074 INFO L471 AbstractCegarLoop]: Abstraction has has 827 places, 1388 transitions, 49291 flow [2025-03-15 02:30:55,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 623.4) internal successors, (3117), 5 states have internal predecessors, (3117), 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:30:55,075 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:55,075 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:55,081 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:30:55,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-15 02:30:55,275 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:30:55,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash -265069709, now seen corresponding path program 1 times [2025-03-15 02:30:55,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:55,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473564155] [2025-03-15 02:30:55,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:55,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:55,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473564155] [2025-03-15 02:30:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473564155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:30:55,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049758290] [2025-03-15 02:30:55,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:55,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:30:55,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:30:55,360 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:30:55,361 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:30:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:55,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 02:30:55,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:30:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:30:55,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:30:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049758290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:55,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:30:55,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-15 02:30:55,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720563540] [2025-03-15 02:30:55,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:55,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:30:55,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:55,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:30:55,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:30:55,515 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:30:55,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 827 places, 1388 transitions, 49291 flow. Second operand has 4 states, 4 states have (on average 624.5) internal successors, (2498), 4 states have internal predecessors, (2498), 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:30:55,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:55,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:30:55,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:59,819 INFO L124 PetriNetUnfolderBase]: 2476/8067 cut-off events. [2025-03-15 02:30:59,819 INFO L125 PetriNetUnfolderBase]: For 14247201/17563538 co-relation queries the response was YES. [2025-03-15 02:30:59,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107396 conditions, 8067 events. 2476/8067 cut-off events. For 14247201/17563538 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 94528 event pairs, 315 based on Foata normal form. 1163/8076 useless extension candidates. Maximal degree in co-relation 90639. Up to 2595 conditions per place. [2025-03-15 02:31:00,011 INFO L140 encePairwiseOnDemand]: 674/680 looper letters, 177 selfloop transitions, 7 changer transitions 382/1389 dead transitions. [2025-03-15 02:31:00,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 829 places, 1389 transitions, 50493 flow [2025-03-15 02:31:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:31:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:31:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2515 transitions. [2025-03-15 02:31:00,014 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9246323529411765 [2025-03-15 02:31:00,014 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 201 predicate places. [2025-03-15 02:31:00,014 INFO L471 AbstractCegarLoop]: Abstraction has has 829 places, 1389 transitions, 50493 flow [2025-03-15 02:31:00,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 624.5) internal successors, (2498), 4 states have internal predecessors, (2498), 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:31:00,015 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:00,015 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:00,021 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:31:00,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:00,215 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:31:00,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 513020149, now seen corresponding path program 1 times [2025-03-15 02:31:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070620364] [2025-03-15 02:31:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070620364] [2025-03-15 02:31:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070620364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:31:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038868613] [2025-03-15 02:31:00,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:00,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:00,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:31:00,344 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:31:00,346 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:31:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:00,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 02:31:00,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:31:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:00,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:31:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038868613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:00,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:31:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-15 02:31:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074685522] [2025-03-15 02:31:00,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:31:00,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:00,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:31:00,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:31:00,564 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:31:00,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 829 places, 1389 transitions, 50493 flow. Second operand has 5 states, 5 states have (on average 623.6) internal successors, (3118), 5 states have internal predecessors, (3118), 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:31:00,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:00,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:31:00,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:05,012 INFO L124 PetriNetUnfolderBase]: 2463/8088 cut-off events. [2025-03-15 02:31:05,012 INFO L125 PetriNetUnfolderBase]: For 15572436/18745568 co-relation queries the response was YES. [2025-03-15 02:31:05,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108859 conditions, 8088 events. 2463/8088 cut-off events. For 15572436/18745568 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 94898 event pairs, 316 based on Foata normal form. 620/7565 useless extension candidates. Maximal degree in co-relation 91628. Up to 2589 conditions per place. [2025-03-15 02:31:05,188 INFO L140 encePairwiseOnDemand]: 671/680 looper letters, 183 selfloop transitions, 8 changer transitions 388/1398 dead transitions. [2025-03-15 02:31:05,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 831 places, 1398 transitions, 52587 flow [2025-03-15 02:31:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:31:05,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:31:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3780 transitions. [2025-03-15 02:31:05,190 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9264705882352942 [2025-03-15 02:31:05,191 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 203 predicate places. [2025-03-15 02:31:05,191 INFO L471 AbstractCegarLoop]: Abstraction has has 831 places, 1398 transitions, 52587 flow [2025-03-15 02:31:05,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 623.6) internal successors, (3118), 5 states have internal predecessors, (3118), 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:31:05,191 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:05,191 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:05,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 02:31:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-15 02:31:05,392 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:31:05,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:05,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1276242509, now seen corresponding path program 1 times [2025-03-15 02:31:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556908348] [2025-03-15 02:31:05,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556908348] [2025-03-15 02:31:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556908348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:31:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524959470] [2025-03-15 02:31:05,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:05,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:05,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:31:05,480 INFO L229 MonitoredProcess]: Starting monitored process 10 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:31:05,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 02:31:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:05,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-15 02:31:05,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:31:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:05,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:31:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524959470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:05,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:31:05,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-15 02:31:05,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894409866] [2025-03-15 02:31:05,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:05,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:31:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:05,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:31:05,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:31:05,648 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:31:05,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 831 places, 1398 transitions, 52587 flow. Second operand has 4 states, 4 states have (on average 624.75) internal successors, (2499), 4 states have internal predecessors, (2499), 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:31:05,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:05,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:31:05,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:10,149 INFO L124 PetriNetUnfolderBase]: 2460/8079 cut-off events. [2025-03-15 02:31:10,150 INFO L125 PetriNetUnfolderBase]: For 17413887/20505129 co-relation queries the response was YES. [2025-03-15 02:31:10,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110416 conditions, 8079 events. 2460/8079 cut-off events. For 17413887/20505129 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 94701 event pairs, 327 based on Foata normal form. 388/7329 useless extension candidates. Maximal degree in co-relation 92870. Up to 2586 conditions per place. [2025-03-15 02:31:10,373 INFO L140 encePairwiseOnDemand]: 674/680 looper letters, 189 selfloop transitions, 7 changer transitions 388/1403 dead transitions. [2025-03-15 02:31:10,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 833 places, 1403 transitions, 54189 flow [2025-03-15 02:31:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:31:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:31:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2514 transitions. [2025-03-15 02:31:10,375 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.924264705882353 [2025-03-15 02:31:10,375 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 205 predicate places. [2025-03-15 02:31:10,376 INFO L471 AbstractCegarLoop]: Abstraction has has 833 places, 1403 transitions, 54189 flow [2025-03-15 02:31:10,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 624.75) internal successors, (2499), 4 states have internal predecessors, (2499), 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:31:10,376 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:10,376 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:10,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-15 02:31:10,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:10,577 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:31:10,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash 193710163, now seen corresponding path program 1 times [2025-03-15 02:31:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722729113] [2025-03-15 02:31:10,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:10,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-15 02:31:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722729113] [2025-03-15 02:31:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722729113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:31:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:31:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475391371] [2025-03-15 02:31:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:10,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:31:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:10,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:31:10,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:31:10,620 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 680 [2025-03-15 02:31:10,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 833 places, 1403 transitions, 54189 flow. Second operand has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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:31:10,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:10,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 680 [2025-03-15 02:31:10,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:15,038 INFO L124 PetriNetUnfolderBase]: 2476/8120 cut-off events. [2025-03-15 02:31:15,038 INFO L125 PetriNetUnfolderBase]: For 20187146/23689954 co-relation queries the response was YES. [2025-03-15 02:31:15,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112754 conditions, 8120 events. 2476/8120 cut-off events. For 20187146/23689954 co-relation queries the response was YES. Maximal size of possible extension queue 809. Compared 95069 event pairs, 288 based on Foata normal form. 477/7458 useless extension candidates. Maximal degree in co-relation 94117. Up to 2602 conditions per place. [2025-03-15 02:31:15,254 INFO L140 encePairwiseOnDemand]: 676/680 looper letters, 157 selfloop transitions, 3 changer transitions 388/1407 dead transitions. [2025-03-15 02:31:15,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 835 places, 1407 transitions, 55379 flow [2025-03-15 02:31:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:31:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:31:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1944 transitions. [2025-03-15 02:31:15,255 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9529411764705882 [2025-03-15 02:31:15,255 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 207 predicate places. [2025-03-15 02:31:15,255 INFO L471 AbstractCegarLoop]: Abstraction has has 835 places, 1407 transitions, 55379 flow [2025-03-15 02:31:15,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 645.3333333333334) internal successors, (1936), 3 states have internal predecessors, (1936), 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:31:15,256 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:15,256 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:15,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-15 02:31:15,256 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:31:15,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:15,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1442313169, now seen corresponding path program 1 times [2025-03-15 02:31:15,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:15,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790317697] [2025-03-15 02:31:15,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:15,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:15,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790317697] [2025-03-15 02:31:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790317697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:31:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228194855] [2025-03-15 02:31:15,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:15,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:15,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:31:15,473 INFO L229 MonitoredProcess]: Starting monitored process 11 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:31:15,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-15 02:31:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:15,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 02:31:15,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:31:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:15,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:31:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:15,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228194855] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:31:15,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:31:15,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-15 02:31:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264384989] [2025-03-15 02:31:15,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:31:15,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 02:31:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:15,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 02:31:15,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 02:31:15,780 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:31:15,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 1407 transitions, 55379 flow. Second operand has 10 states, 10 states have (on average 624.1) internal successors, (6241), 10 states have internal predecessors, (6241), 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:31:15,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:15,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:31:15,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:23,790 INFO L124 PetriNetUnfolderBase]: 4106/13646 cut-off events. [2025-03-15 02:31:23,790 INFO L125 PetriNetUnfolderBase]: For 25378367/30253811 co-relation queries the response was YES. [2025-03-15 02:31:24,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191163 conditions, 13646 events. 4106/13646 cut-off events. For 25378367/30253811 co-relation queries the response was YES. Maximal size of possible extension queue 808. Compared 168384 event pairs, 488 based on Foata normal form. 1835/13190 useless extension candidates. Maximal degree in co-relation 159190. Up to 4548 conditions per place. [2025-03-15 02:31:24,194 INFO L140 encePairwiseOnDemand]: 671/680 looper letters, 331 selfloop transitions, 11 changer transitions 616/1779 dead transitions. [2025-03-15 02:31:24,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 843 places, 1779 transitions, 88400 flow [2025-03-15 02:31:24,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:31:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:31:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5688 transitions. [2025-03-15 02:31:24,197 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9294117647058824 [2025-03-15 02:31:24,197 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 215 predicate places. [2025-03-15 02:31:24,197 INFO L471 AbstractCegarLoop]: Abstraction has has 843 places, 1779 transitions, 88400 flow [2025-03-15 02:31:24,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 624.1) internal successors, (6241), 10 states have internal predecessors, (6241), 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:31:24,198 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:24,198 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:24,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-15 02:31:24,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-03-15 02:31:24,399 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:31:24,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1135220677, now seen corresponding path program 1 times [2025-03-15 02:31:24,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:24,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762645901] [2025-03-15 02:31:24,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:24,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2025-03-15 02:31:24,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762645901] [2025-03-15 02:31:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762645901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:31:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:31:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131386692] [2025-03-15 02:31:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:24,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:31:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:24,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:31:24,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:31:24,456 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 643 out of 680 [2025-03-15 02:31:24,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 843 places, 1779 transitions, 88400 flow. Second operand has 3 states, 3 states have (on average 645.6666666666666) internal successors, (1937), 3 states have internal predecessors, (1937), 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:31:24,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:24,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 643 of 680 [2025-03-15 02:31:24,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:33,675 INFO L124 PetriNetUnfolderBase]: 4186/13790 cut-off events. [2025-03-15 02:31:33,676 INFO L125 PetriNetUnfolderBase]: For 31222751/36826799 co-relation queries the response was YES. [2025-03-15 02:31:34,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197710 conditions, 13790 events. 4186/13790 cut-off events. For 31222751/36826799 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 170500 event pairs, 443 based on Foata normal form. 593/12055 useless extension candidates. Maximal degree in co-relation 165172. Up to 4628 conditions per place. [2025-03-15 02:31:34,147 INFO L140 encePairwiseOnDemand]: 676/680 looper letters, 270 selfloop transitions, 3 changer transitions 616/1791 dead transitions. [2025-03-15 02:31:34,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 845 places, 1791 transitions, 91040 flow [2025-03-15 02:31:34,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:31:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:31:34,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1944 transitions. [2025-03-15 02:31:34,149 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9529411764705882 [2025-03-15 02:31:34,150 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 217 predicate places. [2025-03-15 02:31:34,150 INFO L471 AbstractCegarLoop]: Abstraction has has 845 places, 1791 transitions, 91040 flow [2025-03-15 02:31:34,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 645.6666666666666) internal successors, (1937), 3 states have internal predecessors, (1937), 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:31:34,150 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:34,150 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:34,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-15 02:31:34,150 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:31:34,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash -4174589, now seen corresponding path program 1 times [2025-03-15 02:31:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119807280] [2025-03-15 02:31:34,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:34,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119807280] [2025-03-15 02:31:34,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119807280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:31:34,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782786134] [2025-03-15 02:31:34,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:34,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:31:34,418 INFO L229 MonitoredProcess]: Starting monitored process 12 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:31:34,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-15 02:31:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:34,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 02:31:34,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:31:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:34,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:31:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782786134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:31:34,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:31:34,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-15 02:31:34,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864156199] [2025-03-15 02:31:34,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:31:34,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 02:31:34,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:34,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 02:31:34,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 02:31:34,746 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:31:34,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 845 places, 1791 transitions, 91040 flow. Second operand has 10 states, 10 states have (on average 624.2) internal successors, (6242), 10 states have internal predecessors, (6242), 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:31:34,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:34,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:31:34,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:56,618 INFO L124 PetriNetUnfolderBase]: 6517/21309 cut-off events. [2025-03-15 02:31:56,619 INFO L125 PetriNetUnfolderBase]: For 90599888/113153668 co-relation queries the response was YES. [2025-03-15 02:31:57,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307144 conditions, 21309 events. 6517/21309 cut-off events. For 90599888/113153668 co-relation queries the response was YES. Maximal size of possible extension queue 2165. Compared 301110 event pairs, 548 based on Foata normal form. 2595/20251 useless extension candidates. Maximal degree in co-relation 273449. Up to 7125 conditions per place. [2025-03-15 02:31:57,340 INFO L140 encePairwiseOnDemand]: 671/680 looper letters, 396 selfloop transitions, 11 changer transitions 996/2267 dead transitions. [2025-03-15 02:31:57,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 853 places, 2267 transitions, 136363 flow [2025-03-15 02:31:57,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:31:57,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:31:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5685 transitions. [2025-03-15 02:31:57,342 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.928921568627451 [2025-03-15 02:31:57,343 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 225 predicate places. [2025-03-15 02:31:57,343 INFO L471 AbstractCegarLoop]: Abstraction has has 853 places, 2267 transitions, 136363 flow [2025-03-15 02:31:57,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 624.2) internal successors, (6242), 10 states have internal predecessors, (6242), 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:31:57,344 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:57,344 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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:31:57,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-15 02:31:57,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-15 02:31:57,544 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:31:57,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1863101135, now seen corresponding path program 1 times [2025-03-15 02:31:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275288018] [2025-03-15 02:31:57,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:57,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:57,695 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:57,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:57,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275288018] [2025-03-15 02:31:57,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275288018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:31:57,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365131126] [2025-03-15 02:31:57,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:57,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:57,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:31:57,697 INFO L229 MonitoredProcess]: Starting monitored process 13 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:31:57,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-15 02:31:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:57,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:31:57,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:31:57,983 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:57,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:31:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:31:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365131126] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:31:58,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:31:58,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 02:31:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826839929] [2025-03-15 02:31:58,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:31:58,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 02:31:58,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:58,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 02:31:58,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-15 02:31:58,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:31:58,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 853 places, 2267 transitions, 136363 flow. Second operand has 16 states, 16 states have (on average 623.5625) internal successors, (9977), 16 states have internal predecessors, (9977), 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:31:58,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:58,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:31:58,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:34,220 INFO L124 PetriNetUnfolderBase]: 10350/34833 cut-off events. [2025-03-15 02:32:34,221 INFO L125 PetriNetUnfolderBase]: For 89536797/118907503 co-relation queries the response was YES. [2025-03-15 02:32:35,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499797 conditions, 34833 events. 10350/34833 cut-off events. For 89536797/118907503 co-relation queries the response was YES. Maximal size of possible extension queue 2168. Compared 518697 event pairs, 724 based on Foata normal form. 12902/40973 useless extension candidates. Maximal degree in co-relation 444159. Up to 11976 conditions per place. [2025-03-15 02:32:35,804 INFO L140 encePairwiseOnDemand]: 671/680 looper letters, 646 selfloop transitions, 27 changer transitions 1566/3103 dead transitions. [2025-03-15 02:32:35,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 872 places, 3103 transitions, 217601 flow [2025-03-15 02:32:35,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 02:32:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 02:32:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 12589 transitions. [2025-03-15 02:32:35,808 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9256617647058824 [2025-03-15 02:32:35,809 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 244 predicate places. [2025-03-15 02:32:35,809 INFO L471 AbstractCegarLoop]: Abstraction has has 872 places, 3103 transitions, 217601 flow [2025-03-15 02:32:35,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 623.5625) internal successors, (9977), 16 states have internal predecessors, (9977), 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:32:35,810 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:35,810 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 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:32:35,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-15 02:32:36,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-03-15 02:32:36,011 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:32:36,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:36,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1344661091, now seen corresponding path program 1 times [2025-03-15 02:32:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:36,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541055349] [2025-03-15 02:32:36,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:36,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:36,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:36,321 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:32:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541055349] [2025-03-15 02:32:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541055349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:32:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719849274] [2025-03-15 02:32:36,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:36,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:32:36,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:32:36,324 INFO L229 MonitoredProcess]: Starting monitored process 14 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:32:36,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-15 02:32:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:36,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:32:36,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:32:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:32:36,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:32:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 161 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-15 02:32:36,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719849274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:32:36,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:32:36,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-15 02:32:36,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125944156] [2025-03-15 02:32:36,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:32:36,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-15 02:32:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:36,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-15 02:32:36,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2025-03-15 02:32:36,716 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:32:36,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 872 places, 3103 transitions, 217601 flow. Second operand has 16 states, 16 states have (on average 623.625) internal successors, (9978), 16 states have internal predecessors, (9978), 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:32:36,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:36,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:32:36,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:07,601 INFO L124 PetriNetUnfolderBase]: 15864/52812 cut-off events. [2025-03-15 02:34:07,601 INFO L125 PetriNetUnfolderBase]: For 235245438/339651705 co-relation queries the response was YES. [2025-03-15 02:34:09,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766027 conditions, 52812 events. 15864/52812 cut-off events. For 235245438/339651705 co-relation queries the response was YES. Maximal size of possible extension queue 5656. Compared 873420 event pairs, 925 based on Foata normal form. 14825/57547 useless extension candidates. Maximal degree in co-relation 707982. Up to 17964 conditions per place. [2025-03-15 02:34:10,188 INFO L140 encePairwiseOnDemand]: 671/680 looper letters, 814 selfloop transitions, 27 changer transitions 2478/4251 dead transitions. [2025-03-15 02:34:10,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 891 places, 4251 transitions, 334047 flow [2025-03-15 02:34:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 02:34:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 02:34:10,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 12583 transitions. [2025-03-15 02:34:10,194 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9252205882352941 [2025-03-15 02:34:10,194 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 263 predicate places. [2025-03-15 02:34:10,194 INFO L471 AbstractCegarLoop]: Abstraction has has 891 places, 4251 transitions, 334047 flow [2025-03-15 02:34:10,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 623.625) internal successors, (9978), 16 states have internal predecessors, (9978), 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:34:10,195 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:10,196 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:10,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-15 02:34:10,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-03-15 02:34:10,403 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:34:10,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:10,406 INFO L85 PathProgramCache]: Analyzing trace with hash -84326575, now seen corresponding path program 2 times [2025-03-15 02:34:10,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:10,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964048988] [2025-03-15 02:34:10,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:34:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:10,434 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:34:10,434 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:34:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-15 02:34:10,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:10,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964048988] [2025-03-15 02:34:10,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964048988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:10,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:10,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:34:10,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525763637] [2025-03-15 02:34:10,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:10,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:34:10,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:10,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:34:10,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:34:10,600 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:34:10,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 4251 transitions, 334047 flow. Second operand has 7 states, 7 states have (on average 624.5714285714286) internal successors, (4372), 7 states have internal predecessors, (4372), 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:34:10,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:10,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:34:10,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:36,637 INFO L124 PetriNetUnfolderBase]: 28774/86134 cut-off events. [2025-03-15 02:37:36,638 INFO L125 PetriNetUnfolderBase]: For 361369536/680628444 co-relation queries the response was YES. [2025-03-15 02:37:39,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486927 conditions, 86134 events. 28774/86134 cut-off events. For 361369536/680628444 co-relation queries the response was YES. Maximal size of possible extension queue 10110. Compared 1508631 event pairs, 1500 based on Foata normal form. 30631/101109 useless extension candidates. Maximal degree in co-relation 1398575. Up to 33237 conditions per place. [2025-03-15 02:37:40,542 INFO L140 encePairwiseOnDemand]: 664/680 looper letters, 1412 selfloop transitions, 15 changer transitions 6430/8899 dead transitions. [2025-03-15 02:37:40,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 899 places, 8899 transitions, 824896 flow [2025-03-15 02:37:40,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:37:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:37:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 5658 transitions. [2025-03-15 02:37:40,545 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9245098039215687 [2025-03-15 02:37:40,545 INFO L298 CegarLoopForPetriNet]: 628 programPoint places, 271 predicate places. [2025-03-15 02:37:40,545 INFO L471 AbstractCegarLoop]: Abstraction has has 899 places, 8899 transitions, 824896 flow [2025-03-15 02:37:40,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 624.5714285714286) internal successors, (4372), 7 states have internal predecessors, (4372), 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:37:40,546 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:40,546 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:40,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-15 02:37:40,546 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-15 02:37:40,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:40,548 INFO L85 PathProgramCache]: Analyzing trace with hash 203159747, now seen corresponding path program 2 times [2025-03-15 02:37:40,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:40,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633870617] [2025-03-15 02:37:40,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:37:40,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:40,569 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:37:40,569 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:37:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-15 02:37:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633870617] [2025-03-15 02:37:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633870617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:40,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:37:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954385542] [2025-03-15 02:37:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:40,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:37:40,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:40,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:37:40,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:37:40,671 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 620 out of 680 [2025-03-15 02:37:40,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 899 places, 8899 transitions, 824896 flow. Second operand has 7 states, 7 states have (on average 624.7142857142857) internal successors, (4373), 7 states have internal predecessors, (4373), 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:37:40,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:40,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 620 of 680 [2025-03-15 02:37:40,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 02:43:30,487 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 02:43:31,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2025-03-15 02:43:33,502 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 80 remaining) [2025-03-15 02:43:33,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-15 02:43:33,503 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 80 remaining) [2025-03-15 02:43:33,507 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 80 remaining) [2025-03-15 02:43:33,508 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 80 remaining) [2025-03-15 02:43:33,509 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 80 remaining) [2025-03-15 02:43:33,510 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 80 remaining) [2025-03-15 02:43:33,510 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-03-15 02:43:33,516 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:43:33,516 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:43:33,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:43:33 BasicIcfg [2025-03-15 02:43:33,527 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:43:33,532 INFO L158 Benchmark]: Toolchain (without parser) took 824143.58ms. Allocated memory was 71.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 43.9MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2025-03-15 02:43:33,532 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:43:33,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.65ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 30.1MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 02:43:33,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.84ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 26.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:43:33,533 INFO L158 Benchmark]: Boogie Preprocessor took 43.12ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 24.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 02:43:33,533 INFO L158 Benchmark]: RCFGBuilder took 740.03ms. Allocated memory is still 71.3MB. Free memory was 24.2MB in the beginning and 36.5MB in the end (delta: -12.3MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. [2025-03-15 02:43:33,533 INFO L158 Benchmark]: TraceAbstraction took 823060.04ms. Allocated memory was 71.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 35.3MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. [2025-03-15 02:43:33,534 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.65ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 30.1MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.84ms. Allocated memory is still 71.3MB. Free memory was 30.1MB in the beginning and 26.8MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 43.12ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 24.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 740.03ms. Allocated memory is still 71.3MB. Free memory was 24.2MB in the beginning and 36.5MB in the end (delta: -12.3MB). Peak memory consumption was 15.1MB. Max. memory is 8.0GB. * TraceAbstraction took 823060.04ms. Allocated memory was 71.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 35.3MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 5.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 1058 locations, 80 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 822.9s, OverallIterations: 51, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 809.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3858 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3858 mSDsluCounter, 3280 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1971 mSDsCounter, 367 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6459 IncrementalHoareTripleChecker+Invalid, 6826 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 367 mSolverCounterUnsat, 1309 mSDtfsCounter, 6459 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6174 GetRequests, 5737 SyntacticMatches, 5 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1064 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=824896occurred in iteration=50, InterpolantAutomatonStates: 370, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 17631 NumberOfCodeBlocks, 16861 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 19719 ConstructedInterpolants, 0 QuantifiedInterpolants, 37991 SizeOfPredicates, 44 NumberOfNonLiveVariables, 5777 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 72 InterpolantComputations, 43 PerfectInterpolantSequences, 12321/13852 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown