/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/fibonacci.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:32:43,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:32:43,449 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:32:43,511 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:32:43,512 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:32:43,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:32:43,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:32:43,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:32:43,513 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:32:43,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:32:43,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:32:43,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:32:43,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:32:43,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:32:43,515 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:32:43,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:32:43,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:32:43,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:32:43,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:32:43,775 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:32:43,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/fibonacci.wvr.c [2025-03-15 02:32:44,929 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc0c403f/07c9c841a3ea4641a9b481d348cb3bad/FLAGb071828cc [2025-03-15 02:32:45,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:32:45,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/fibonacci.wvr.c [2025-03-15 02:32:45,128 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc0c403f/07c9c841a3ea4641a9b481d348cb3bad/FLAGb071828cc [2025-03-15 02:32:45,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cc0c403f/07c9c841a3ea4641a9b481d348cb3bad [2025-03-15 02:32:45,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:32:45,145 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:32:45,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:32:45,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:32:45,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:32:45,151 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed07870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45, skipping insertion in model container [2025-03-15 02:32:45,152 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:32:45,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:32:45,309 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:32:45,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:32:45,341 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:32:45,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45 WrapperNode [2025-03-15 02:32:45,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:32:45,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:32:45,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:32:45,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:32:45,348 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:32:45" (1/1) ... [2025-03-15 02:32:45,358 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:32:45" (1/1) ... [2025-03-15 02:32:45,379 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 216 [2025-03-15 02:32:45,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:32:45,380 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:32:45,380 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:32:45,380 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:32:45,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,386 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,392 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,393 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:32:45,404 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:32:45,404 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:32:45,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:32:45,405 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (1/1) ... [2025-03-15 02:32:45,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:32:45,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:32:45,430 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:32:45,436 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:32:45,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:32:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:32:45,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:32:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:32:45,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:32:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:32:45,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:32:45,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:32:45,455 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:32:45,533 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:32:45,535 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:32:45,891 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:32:45,891 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:32:45,908 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:32:45,909 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:32:45,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:32:45 BoogieIcfgContainer [2025-03-15 02:32:45,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:32:45,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:32:45,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:32:45,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:32:45,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:32:45" (1/3) ... [2025-03-15 02:32:45,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d21fa58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:32:45, skipping insertion in model container [2025-03-15 02:32:45,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:32:45" (2/3) ... [2025-03-15 02:32:45,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d21fa58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:32:45, skipping insertion in model container [2025-03-15 02:32:45,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:32:45" (3/3) ... [2025-03-15 02:32:45,919 INFO L128 eAbstractionObserver]: Analyzing ICFG fibonacci.wvr.c [2025-03-15 02:32:45,929 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:32:45,930 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG fibonacci.wvr.c that has 3 procedures, 296 locations, 1 initial locations, 2 loop locations, and 28 error locations. [2025-03-15 02:32:45,931 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:32:46,060 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:32:46,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:32:46,117 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;@76ce31fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:32:46,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2025-03-15 02:32:46,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:32:46,160 INFO L124 PetriNetUnfolderBase]: 1/88 cut-off events. [2025-03-15 02:32:46,162 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 02:32:46,162 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:46,163 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] [2025-03-15 02:32:46,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:46,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1293311905, now seen corresponding path program 1 times [2025-03-15 02:32:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:46,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262160382] [2025-03-15 02:32:46,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:46,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:46,447 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:32:46,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:46,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262160382] [2025-03-15 02:32:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262160382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:46,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:46,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:32:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124815705] [2025-03-15 02:32:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:46,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:32:46,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:46,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:32:46,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:32:46,478 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:32:46,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 315 transitions, 644 flow. Second operand has 4 states, 4 states have (on average 277.5) internal successors, (1110), 4 states have internal predecessors, (1110), 0 states have call successors, (0), 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:46,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:46,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:32:46,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:46,670 INFO L124 PetriNetUnfolderBase]: 49/492 cut-off events. [2025-03-15 02:32:46,672 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-15 02:32:46,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 492 events. 49/492 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1878 event pairs, 13 based on Foata normal form. 58/471 useless extension candidates. Maximal degree in co-relation 590. Up to 50 conditions per place. [2025-03-15 02:32:46,687 INFO L140 encePairwiseOnDemand]: 296/315 looper letters, 34 selfloop transitions, 5 changer transitions 10/308 dead transitions. [2025-03-15 02:32:46,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 308 transitions, 714 flow [2025-03-15 02:32:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:32:46,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:32:46,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1168 transitions. [2025-03-15 02:32:46,704 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.926984126984127 [2025-03-15 02:32:46,707 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, -7 predicate places. [2025-03-15 02:32:46,707 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 308 transitions, 714 flow [2025-03-15 02:32:46,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 277.5) internal successors, (1110), 4 states have internal predecessors, (1110), 0 states have call successors, (0), 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:46,708 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:46,708 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] [2025-03-15 02:32:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:32:46,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:46,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:46,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1437962627, now seen corresponding path program 1 times [2025-03-15 02:32:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:46,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499866605] [2025-03-15 02:32:46,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:46,852 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:32:46,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:46,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499866605] [2025-03-15 02:32:46,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499866605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:46,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:46,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:46,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042064428] [2025-03-15 02:32:46,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:46,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:46,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:46,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:46,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:46,858 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:32:46,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 308 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 270.3333333333333) internal successors, (1622), 6 states have internal predecessors, (1622), 0 states have call successors, (0), 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:46,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:46,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:32:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:47,123 INFO L124 PetriNetUnfolderBase]: 101/821 cut-off events. [2025-03-15 02:32:47,124 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-03-15 02:32:47,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 821 events. 101/821 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3540 event pairs, 2 based on Foata normal form. 0/688 useless extension candidates. Maximal degree in co-relation 1329. Up to 118 conditions per place. [2025-03-15 02:32:47,136 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 76 selfloop transitions, 12 changer transitions 11/353 dead transitions. [2025-03-15 02:32:47,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 353 transitions, 1090 flow [2025-03-15 02:32:47,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:47,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1945 transitions. [2025-03-15 02:32:47,139 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8820861678004536 [2025-03-15 02:32:47,141 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, -1 predicate places. [2025-03-15 02:32:47,141 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 353 transitions, 1090 flow [2025-03-15 02:32:47,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.3333333333333) internal successors, (1622), 6 states have internal predecessors, (1622), 0 states have call successors, (0), 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:47,142 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:47,142 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] [2025-03-15 02:32:47,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:32:47,142 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -504842247, now seen corresponding path program 1 times [2025-03-15 02:32:47,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:47,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635973167] [2025-03-15 02:32:47,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:47,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:47,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:47,268 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:32:47,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:47,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635973167] [2025-03-15 02:32:47,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635973167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:47,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:47,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:32:47,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846018860] [2025-03-15 02:32:47,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:47,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:32:47,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:47,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:32:47,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:32:47,271 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:32:47,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 353 transitions, 1090 flow. Second operand has 4 states, 4 states have (on average 277.75) internal successors, (1111), 4 states have internal predecessors, (1111), 0 states have call successors, (0), 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:47,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:47,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:32:47,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:47,492 INFO L124 PetriNetUnfolderBase]: 178/1185 cut-off events. [2025-03-15 02:32:47,492 INFO L125 PetriNetUnfolderBase]: For 995/1211 co-relation queries the response was YES. [2025-03-15 02:32:47,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2238 conditions, 1185 events. 178/1185 cut-off events. For 995/1211 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 6889 event pairs, 19 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1465. Up to 182 conditions per place. [2025-03-15 02:32:47,508 INFO L140 encePairwiseOnDemand]: 307/315 looper letters, 45 selfloop transitions, 5 changer transitions 11/367 dead transitions. [2025-03-15 02:32:47,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 367 transitions, 1250 flow [2025-03-15 02:32:47,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:32:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:32:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1147 transitions. [2025-03-15 02:32:47,511 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9103174603174603 [2025-03-15 02:32:47,512 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 1 predicate places. [2025-03-15 02:32:47,512 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 367 transitions, 1250 flow [2025-03-15 02:32:47,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 277.75) internal successors, (1111), 4 states have internal predecessors, (1111), 0 states have call successors, (0), 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:47,513 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:47,513 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] [2025-03-15 02:32:47,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:32:47,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:47,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:47,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1529760406, now seen corresponding path program 1 times [2025-03-15 02:32:47,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:47,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726408905] [2025-03-15 02:32:47,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:47,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:47,632 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:32:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726408905] [2025-03-15 02:32:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726408905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:47,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:47,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746643236] [2025-03-15 02:32:47,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:47,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:47,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:47,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:47,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:47,637 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:32:47,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 367 transitions, 1250 flow. Second operand has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:47,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:47,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:32:47,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:47,992 INFO L124 PetriNetUnfolderBase]: 275/1651 cut-off events. [2025-03-15 02:32:47,993 INFO L125 PetriNetUnfolderBase]: For 8424/28336 co-relation queries the response was YES. [2025-03-15 02:32:48,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3608 conditions, 1651 events. 275/1651 cut-off events. For 8424/28336 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 12947 event pairs, 15 based on Foata normal form. 9/1366 useless extension candidates. Maximal degree in co-relation 2525. Up to 269 conditions per place. [2025-03-15 02:32:48,016 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 92 selfloop transitions, 12 changer transitions 13/418 dead transitions. [2025-03-15 02:32:48,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 418 transitions, 1760 flow [2025-03-15 02:32:48,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:48,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1944 transitions. [2025-03-15 02:32:48,020 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8816326530612245 [2025-03-15 02:32:48,021 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 7 predicate places. [2025-03-15 02:32:48,021 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 418 transitions, 1760 flow [2025-03-15 02:32:48,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:48,022 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:48,022 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] [2025-03-15 02:32:48,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:32:48,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:48,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1405748420, now seen corresponding path program 1 times [2025-03-15 02:32:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002326641] [2025-03-15 02:32:48,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:48,110 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:32:48,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002326641] [2025-03-15 02:32:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002326641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:48,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:48,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:48,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807367517] [2025-03-15 02:32:48,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:48,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:48,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:48,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:48,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:48,112 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:32:48,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 418 transitions, 1760 flow. Second operand has 6 states, 6 states have (on average 270.3333333333333) internal successors, (1622), 6 states have internal predecessors, (1622), 0 states have call successors, (0), 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:48,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:48,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:32:48,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:48,520 INFO L124 PetriNetUnfolderBase]: 274/1649 cut-off events. [2025-03-15 02:32:48,521 INFO L125 PetriNetUnfolderBase]: For 9656/63116 co-relation queries the response was YES. [2025-03-15 02:32:48,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 1649 events. 274/1649 cut-off events. For 9656/63116 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 12892 event pairs, 6 based on Foata normal form. 381/1738 useless extension candidates. Maximal degree in co-relation 2741. Up to 268 conditions per place. [2025-03-15 02:32:48,548 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 92 selfloop transitions, 12 changer transitions 13/418 dead transitions. [2025-03-15 02:32:48,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 418 transitions, 1983 flow [2025-03-15 02:32:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:48,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1938 transitions. [2025-03-15 02:32:48,552 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8789115646258503 [2025-03-15 02:32:48,552 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 13 predicate places. [2025-03-15 02:32:48,552 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 418 transitions, 1983 flow [2025-03-15 02:32:48,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.3333333333333) internal successors, (1622), 6 states have internal predecessors, (1622), 0 states have call successors, (0), 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:48,553 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:48,553 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] [2025-03-15 02:32:48,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:32:48,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:48,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 628528841, now seen corresponding path program 1 times [2025-03-15 02:32:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263770035] [2025-03-15 02:32:48,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:48,623 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:32:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263770035] [2025-03-15 02:32:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263770035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:48,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:48,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:32:48,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676935586] [2025-03-15 02:32:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:48,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:32:48,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:48,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:32:48,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:32:48,626 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:32:48,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 418 transitions, 1983 flow. Second operand has 4 states, 4 states have (on average 278.5) internal successors, (1114), 4 states have internal predecessors, (1114), 0 states have call successors, (0), 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:48,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:48,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:32:48,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:48,928 INFO L124 PetriNetUnfolderBase]: 281/1926 cut-off events. [2025-03-15 02:32:48,928 INFO L125 PetriNetUnfolderBase]: For 15134/114596 co-relation queries the response was YES. [2025-03-15 02:32:48,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4746 conditions, 1926 events. 281/1926 cut-off events. For 15134/114596 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 15286 event pairs, 18 based on Foata normal form. 202/1788 useless extension candidates. Maximal degree in co-relation 2608. Up to 304 conditions per place. [2025-03-15 02:32:48,951 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 92 selfloop transitions, 8 changer transitions 13/423 dead transitions. [2025-03-15 02:32:48,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 423 transitions, 2280 flow [2025-03-15 02:32:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:32:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:32:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1144 transitions. [2025-03-15 02:32:48,954 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9079365079365079 [2025-03-15 02:32:48,954 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 16 predicate places. [2025-03-15 02:32:48,954 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 423 transitions, 2280 flow [2025-03-15 02:32:48,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.5) internal successors, (1114), 4 states have internal predecessors, (1114), 0 states have call successors, (0), 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:48,955 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:48,955 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] [2025-03-15 02:32:48,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:32:48,955 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:48,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 140252033, now seen corresponding path program 1 times [2025-03-15 02:32:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065674438] [2025-03-15 02:32:48,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:49,004 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:32:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:49,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065674438] [2025-03-15 02:32:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065674438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:49,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:32:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495534915] [2025-03-15 02:32:49,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:49,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:32:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:49,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:32:49,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:32:49,007 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:32:49,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 423 transitions, 2280 flow. Second operand has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:49,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:49,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:32:49,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:49,425 INFO L124 PetriNetUnfolderBase]: 305/1975 cut-off events. [2025-03-15 02:32:49,425 INFO L125 PetriNetUnfolderBase]: For 18873/196123 co-relation queries the response was YES. [2025-03-15 02:32:49,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5437 conditions, 1975 events. 305/1975 cut-off events. For 18873/196123 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15838 event pairs, 6 based on Foata normal form. 206/1835 useless extension candidates. Maximal degree in co-relation 3144. Up to 328 conditions per place. [2025-03-15 02:32:49,467 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 103 selfloop transitions, 8 changer transitions 13/436 dead transitions. [2025-03-15 02:32:49,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 436 transitions, 2673 flow [2025-03-15 02:32:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:32:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:32:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1141 transitions. [2025-03-15 02:32:49,469 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9055555555555556 [2025-03-15 02:32:49,470 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 18 predicate places. [2025-03-15 02:32:49,470 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 436 transitions, 2673 flow [2025-03-15 02:32:49,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:49,472 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:49,472 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] [2025-03-15 02:32:49,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:32:49,472 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:49,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash -199466659, now seen corresponding path program 1 times [2025-03-15 02:32:49,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:49,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751682026] [2025-03-15 02:32:49,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:49,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:49,563 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:32:49,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:49,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751682026] [2025-03-15 02:32:49,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751682026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:49,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:49,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:49,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688541131] [2025-03-15 02:32:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:49,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:49,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:49,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:49,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:49,566 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:32:49,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 436 transitions, 2673 flow. Second operand has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:49,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:49,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:32:49,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:49,946 INFO L124 PetriNetUnfolderBase]: 303/1969 cut-off events. [2025-03-15 02:32:49,946 INFO L125 PetriNetUnfolderBase]: For 26995/132377 co-relation queries the response was YES. [2025-03-15 02:32:49,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5938 conditions, 1969 events. 303/1969 cut-off events. For 26995/132377 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 15582 event pairs, 14 based on Foata normal form. 66/1694 useless extension candidates. Maximal degree in co-relation 3372. Up to 322 conditions per place. [2025-03-15 02:32:49,985 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 108 selfloop transitions, 12 changer transitions 13/437 dead transitions. [2025-03-15 02:32:49,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 437 transitions, 2953 flow [2025-03-15 02:32:49,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:49,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1937 transitions. [2025-03-15 02:32:49,989 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8784580498866214 [2025-03-15 02:32:49,992 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 24 predicate places. [2025-03-15 02:32:49,992 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 437 transitions, 2953 flow [2025-03-15 02:32:49,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:49,993 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:49,993 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] [2025-03-15 02:32:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:32:49,993 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:49,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1888498237, now seen corresponding path program 1 times [2025-03-15 02:32:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746504542] [2025-03-15 02:32:49,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:50,047 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:32:50,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:50,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746504542] [2025-03-15 02:32:50,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746504542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:50,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:50,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:32:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438861346] [2025-03-15 02:32:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:50,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:32:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:50,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:32:50,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:32:50,049 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:32:50,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 437 transitions, 2953 flow. Second operand has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:50,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:50,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:32:50,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:50,378 INFO L124 PetriNetUnfolderBase]: 295/1962 cut-off events. [2025-03-15 02:32:50,378 INFO L125 PetriNetUnfolderBase]: For 37390/145056 co-relation queries the response was YES. [2025-03-15 02:32:50,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6439 conditions, 1962 events. 295/1962 cut-off events. For 37390/145056 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 15827 event pairs, 6 based on Foata normal form. 55/1687 useless extension candidates. Maximal degree in co-relation 3594. Up to 322 conditions per place. [2025-03-15 02:32:50,412 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 115 selfloop transitions, 8 changer transitions 13/449 dead transitions. [2025-03-15 02:32:50,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 449 transitions, 3485 flow [2025-03-15 02:32:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:32:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:32:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1144 transitions. [2025-03-15 02:32:50,415 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9079365079365079 [2025-03-15 02:32:50,415 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 27 predicate places. [2025-03-15 02:32:50,415 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 449 transitions, 3485 flow [2025-03-15 02:32:50,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:50,416 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:50,416 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] [2025-03-15 02:32:50,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:32:50,416 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:50,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1179331122, now seen corresponding path program 1 times [2025-03-15 02:32:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:50,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146274927] [2025-03-15 02:32:50,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:50,520 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:32:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:50,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146274927] [2025-03-15 02:32:50,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146274927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:50,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:50,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:32:50,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827972785] [2025-03-15 02:32:50,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:50,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:32:50,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:50,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:32:50,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:32:50,524 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 315 [2025-03-15 02:32:50,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 449 transitions, 3485 flow. Second operand has 8 states, 8 states have (on average 264.25) internal successors, (2114), 8 states have internal predecessors, (2114), 0 states have call successors, (0), 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:50,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:50,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 315 [2025-03-15 02:32:50,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:50,990 INFO L124 PetriNetUnfolderBase]: 290/1687 cut-off events. [2025-03-15 02:32:50,990 INFO L125 PetriNetUnfolderBase]: For 40315/331973 co-relation queries the response was YES. [2025-03-15 02:32:51,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6347 conditions, 1687 events. 290/1687 cut-off events. For 40315/331973 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 13273 event pairs, 7 based on Foata normal form. 646/2055 useless extension candidates. Maximal degree in co-relation 4093. Up to 302 conditions per place. [2025-03-15 02:32:51,031 INFO L140 encePairwiseOnDemand]: 301/315 looper letters, 136 selfloop transitions, 22 changer transitions 13/464 dead transitions. [2025-03-15 02:32:51,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 464 transitions, 4011 flow [2025-03-15 02:32:51,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:32:51,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:32:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2701 transitions. [2025-03-15 02:32:51,036 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8574603174603175 [2025-03-15 02:32:51,037 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 36 predicate places. [2025-03-15 02:32:51,037 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 464 transitions, 4011 flow [2025-03-15 02:32:51,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 264.25) internal successors, (2114), 8 states have internal predecessors, (2114), 0 states have call successors, (0), 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:51,038 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:51,038 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] [2025-03-15 02:32:51,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:32:51,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:51,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2095441675, now seen corresponding path program 1 times [2025-03-15 02:32:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:51,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246405688] [2025-03-15 02:32:51,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:51,129 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:32:51,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:51,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246405688] [2025-03-15 02:32:51,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246405688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:51,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:51,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:32:51,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566030298] [2025-03-15 02:32:51,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:51,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:32:51,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:51,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:32:51,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:32:51,132 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 315 [2025-03-15 02:32:51,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 464 transitions, 4011 flow. Second operand has 8 states, 8 states have (on average 264.375) internal successors, (2115), 8 states have internal predecessors, (2115), 0 states have call successors, (0), 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:51,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:51,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 315 [2025-03-15 02:32:51,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:51,646 INFO L124 PetriNetUnfolderBase]: 299/2004 cut-off events. [2025-03-15 02:32:51,646 INFO L125 PetriNetUnfolderBase]: For 37274/170818 co-relation queries the response was YES. [2025-03-15 02:32:51,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7329 conditions, 2004 events. 299/2004 cut-off events. For 37274/170818 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 16033 event pairs, 6 based on Foata normal form. 543/2215 useless extension candidates. Maximal degree in co-relation 4117. Up to 324 conditions per place. [2025-03-15 02:32:51,695 INFO L140 encePairwiseOnDemand]: 300/315 looper letters, 143 selfloop transitions, 26 changer transitions 13/481 dead transitions. [2025-03-15 02:32:51,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 481 transitions, 4678 flow [2025-03-15 02:32:51,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:32:51,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:32:51,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2700 transitions. [2025-03-15 02:32:51,700 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-15 02:32:51,700 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 45 predicate places. [2025-03-15 02:32:51,700 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 481 transitions, 4678 flow [2025-03-15 02:32:51,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 264.375) internal successors, (2115), 8 states have internal predecessors, (2115), 0 states have call successors, (0), 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:51,701 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:51,701 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] [2025-03-15 02:32:51,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:32:51,701 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:51,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1220706394, now seen corresponding path program 1 times [2025-03-15 02:32:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92438546] [2025-03-15 02:32:51,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:51,744 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:32:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:51,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92438546] [2025-03-15 02:32:51,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92438546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:51,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:51,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:32:51,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976661094] [2025-03-15 02:32:51,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:51,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:32:51,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:51,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:32:51,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:32:51,746 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:32:51,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 481 transitions, 4678 flow. Second operand has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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:51,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:51,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:32:51,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:52,158 INFO L124 PetriNetUnfolderBase]: 345/2058 cut-off events. [2025-03-15 02:32:52,158 INFO L125 PetriNetUnfolderBase]: For 61384/169710 co-relation queries the response was YES. [2025-03-15 02:32:52,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8653 conditions, 2058 events. 345/2058 cut-off events. For 61384/169710 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 17311 event pairs, 7 based on Foata normal form. 86/1798 useless extension candidates. Maximal degree in co-relation 4439. Up to 396 conditions per place. [2025-03-15 02:32:52,190 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 150 selfloop transitions, 8 changer transitions 17/501 dead transitions. [2025-03-15 02:32:52,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 501 transitions, 5432 flow [2025-03-15 02:32:52,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:32:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:32:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1141 transitions. [2025-03-15 02:32:52,192 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9055555555555556 [2025-03-15 02:32:52,193 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 47 predicate places. [2025-03-15 02:32:52,193 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 501 transitions, 5432 flow [2025-03-15 02:32:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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:52,193 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:52,193 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] [2025-03-15 02:32:52,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 02:32:52,193 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1492653946, now seen corresponding path program 1 times [2025-03-15 02:32:52,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:52,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012191473] [2025-03-15 02:32:52,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:52,294 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:32:52,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:52,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012191473] [2025-03-15 02:32:52,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012191473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:52,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:52,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:52,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037266490] [2025-03-15 02:32:52,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:52,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:52,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:52,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:52,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:52,297 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:32:52,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 501 transitions, 5432 flow. Second operand has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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:52,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:52,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:32:52,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:52,854 INFO L124 PetriNetUnfolderBase]: 431/2140 cut-off events. [2025-03-15 02:32:52,854 INFO L125 PetriNetUnfolderBase]: For 92927/442611 co-relation queries the response was YES. [2025-03-15 02:32:52,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10627 conditions, 2140 events. 431/2140 cut-off events. For 92927/442611 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 17929 event pairs, 6 based on Foata normal form. 548/2346 useless extension candidates. Maximal degree in co-relation 6211. Up to 485 conditions per place. [2025-03-15 02:32:52,885 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 199 selfloop transitions, 20 changer transitions 17/528 dead transitions. [2025-03-15 02:32:52,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 528 transitions, 6325 flow [2025-03-15 02:32:52,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1814 transitions. [2025-03-15 02:32:52,889 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8226757369614512 [2025-03-15 02:32:52,889 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 53 predicate places. [2025-03-15 02:32:52,889 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 528 transitions, 6325 flow [2025-03-15 02:32:52,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.0) internal successors, (1512), 6 states have internal predecessors, (1512), 0 states have call successors, (0), 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:52,890 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:52,890 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] [2025-03-15 02:32:52,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:32:52,890 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:52,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash -400417334, now seen corresponding path program 1 times [2025-03-15 02:32:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:52,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192322545] [2025-03-15 02:32:52,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:52,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:52,961 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:32:52,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:52,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192322545] [2025-03-15 02:32:52,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192322545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:52,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:52,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:52,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866358377] [2025-03-15 02:32:52,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:52,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:52,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:52,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:52,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:52,963 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:32:52,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 528 transitions, 6325 flow. Second operand has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 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:52,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:52,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:32:52,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:53,522 INFO L124 PetriNetUnfolderBase]: 431/2181 cut-off events. [2025-03-15 02:32:53,522 INFO L125 PetriNetUnfolderBase]: For 118700/1199659 co-relation queries the response was YES. [2025-03-15 02:32:53,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11328 conditions, 2181 events. 431/2181 cut-off events. For 118700/1199659 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 18299 event pairs, 18 based on Foata normal form. 548/2382 useless extension candidates. Maximal degree in co-relation 6663. Up to 551 conditions per place. [2025-03-15 02:32:53,631 INFO L140 encePairwiseOnDemand]: 303/315 looper letters, 212 selfloop transitions, 23 changer transitions 17/544 dead transitions. [2025-03-15 02:32:53,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 544 transitions, 7171 flow [2025-03-15 02:32:53,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1807 transitions. [2025-03-15 02:32:53,634 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8195011337868481 [2025-03-15 02:32:53,634 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 59 predicate places. [2025-03-15 02:32:53,634 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 544 transitions, 7171 flow [2025-03-15 02:32:53,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 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:53,635 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:53,635 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] [2025-03-15 02:32:53,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 02:32:53,635 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:53,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:53,636 INFO L85 PathProgramCache]: Analyzing trace with hash 151735400, now seen corresponding path program 1 times [2025-03-15 02:32:53,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:53,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003319956] [2025-03-15 02:32:53,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:53,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:32:53,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:53,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003319956] [2025-03-15 02:32:53,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003319956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:53,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:53,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:32:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182676343] [2025-03-15 02:32:53,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:53,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:32:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:53,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:32:53,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:32:53,713 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 315 [2025-03-15 02:32:53,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 544 transitions, 7171 flow. Second operand has 8 states, 8 states have (on average 264.375) internal successors, (2115), 8 states have internal predecessors, (2115), 0 states have call successors, (0), 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:53,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:53,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 315 [2025-03-15 02:32:53,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:54,294 INFO L124 PetriNetUnfolderBase]: 439/2186 cut-off events. [2025-03-15 02:32:54,294 INFO L125 PetriNetUnfolderBase]: For 285036/1101508 co-relation queries the response was YES. [2025-03-15 02:32:54,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12150 conditions, 2186 events. 439/2186 cut-off events. For 285036/1101508 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 18484 event pairs, 9 based on Foata normal form. 169/2018 useless extension candidates. Maximal degree in co-relation 6991. Up to 559 conditions per place. [2025-03-15 02:32:54,402 INFO L140 encePairwiseOnDemand]: 301/315 looper letters, 202 selfloop transitions, 22 changer transitions 17/567 dead transitions. [2025-03-15 02:32:54,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 567 transitions, 8181 flow [2025-03-15 02:32:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:32:54,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:32:54,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2700 transitions. [2025-03-15 02:32:54,405 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-15 02:32:54,406 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 68 predicate places. [2025-03-15 02:32:54,406 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 567 transitions, 8181 flow [2025-03-15 02:32:54,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 264.375) internal successors, (2115), 8 states have internal predecessors, (2115), 0 states have call successors, (0), 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:54,406 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:54,406 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] [2025-03-15 02:32:54,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:32:54,407 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:54,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:54,407 INFO L85 PathProgramCache]: Analyzing trace with hash 408831012, now seen corresponding path program 1 times [2025-03-15 02:32:54,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:54,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214227846] [2025-03-15 02:32:54,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:54,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:54,494 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:32:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214227846] [2025-03-15 02:32:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214227846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:32:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700079865] [2025-03-15 02:32:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:54,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:32:54,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:54,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:32:54,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:32:54,497 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 315 [2025-03-15 02:32:54,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 567 transitions, 8181 flow. Second operand has 8 states, 8 states have (on average 264.5) internal successors, (2116), 8 states have internal predecessors, (2116), 0 states have call successors, (0), 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:54,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:54,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 315 [2025-03-15 02:32:54,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:55,173 INFO L124 PetriNetUnfolderBase]: 426/1886 cut-off events. [2025-03-15 02:32:55,173 INFO L125 PetriNetUnfolderBase]: For 327689/1086124 co-relation queries the response was YES. [2025-03-15 02:32:55,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11973 conditions, 1886 events. 426/1886 cut-off events. For 327689/1086124 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 15698 event pairs, 9 based on Foata normal form. 133/1745 useless extension candidates. Maximal degree in co-relation 7118. Up to 555 conditions per place. [2025-03-15 02:32:55,232 INFO L140 encePairwiseOnDemand]: 300/315 looper letters, 222 selfloop transitions, 26 changer transitions 17/597 dead transitions. [2025-03-15 02:32:55,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 597 transitions, 9599 flow [2025-03-15 02:32:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:32:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:32:55,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2699 transitions. [2025-03-15 02:32:55,236 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8568253968253968 [2025-03-15 02:32:55,237 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 77 predicate places. [2025-03-15 02:32:55,237 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 597 transitions, 9599 flow [2025-03-15 02:32:55,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 264.5) internal successors, (2116), 8 states have internal predecessors, (2116), 0 states have call successors, (0), 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:55,238 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:55,238 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] [2025-03-15 02:32:55,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:32:55,238 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:55,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1172140479, now seen corresponding path program 1 times [2025-03-15 02:32:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:55,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483014827] [2025-03-15 02:32:55,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:55,309 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:32:55,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:55,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483014827] [2025-03-15 02:32:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483014827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:55,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176767499] [2025-03-15 02:32:55,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:55,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:55,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:55,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:55,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:55,311 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:32:55,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 597 transitions, 9599 flow. Second operand has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 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:55,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:55,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:32:55,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:56,113 INFO L124 PetriNetUnfolderBase]: 598/2053 cut-off events. [2025-03-15 02:32:56,113 INFO L125 PetriNetUnfolderBase]: For 2294562/3831066 co-relation queries the response was YES. [2025-03-15 02:32:56,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16076 conditions, 2053 events. 598/2053 cut-off events. For 2294562/3831066 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19673 event pairs, 7 based on Foata normal form. 146/1897 useless extension candidates. Maximal degree in co-relation 11031. Up to 727 conditions per place. [2025-03-15 02:32:56,160 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 267 selfloop transitions, 20 changer transitions 33/639 dead transitions. [2025-03-15 02:32:56,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 639 transitions, 11335 flow [2025-03-15 02:32:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:56,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1814 transitions. [2025-03-15 02:32:56,161 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8226757369614512 [2025-03-15 02:32:56,162 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 83 predicate places. [2025-03-15 02:32:56,162 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 639 transitions, 11335 flow [2025-03-15 02:32:56,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.16666666666666) internal successors, (1513), 6 states have internal predecessors, (1513), 0 states have call successors, (0), 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:56,162 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:56,162 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] [2025-03-15 02:32:56,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:32:56,163 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:56,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:56,163 INFO L85 PathProgramCache]: Analyzing trace with hash 603831332, now seen corresponding path program 1 times [2025-03-15 02:32:56,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:56,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806715464] [2025-03-15 02:32:56,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:56,228 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:32:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:56,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806715464] [2025-03-15 02:32:56,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806715464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:56,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:56,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221745506] [2025-03-15 02:32:56,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:56,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:56,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:56,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:56,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:56,230 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:32:56,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 639 transitions, 11335 flow. Second operand has 6 states, 6 states have (on average 252.33333333333334) internal successors, (1514), 6 states have internal predecessors, (1514), 0 states have call successors, (0), 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:56,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:56,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:32:56,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:57,013 INFO L124 PetriNetUnfolderBase]: 594/2042 cut-off events. [2025-03-15 02:32:57,013 INFO L125 PetriNetUnfolderBase]: For 2420573/4008011 co-relation queries the response was YES. [2025-03-15 02:32:57,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17007 conditions, 2042 events. 594/2042 cut-off events. For 2420573/4008011 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19431 event pairs, 7 based on Foata normal form. 211/1965 useless extension candidates. Maximal degree in co-relation 11772. Up to 777 conditions per place. [2025-03-15 02:32:57,047 INFO L140 encePairwiseOnDemand]: 303/315 looper letters, 284 selfloop transitions, 23 changer transitions 41/667 dead transitions. [2025-03-15 02:32:57,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 667 transitions, 12937 flow [2025-03-15 02:32:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:32:57,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:32:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1807 transitions. [2025-03-15 02:32:57,048 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8195011337868481 [2025-03-15 02:32:57,049 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 89 predicate places. [2025-03-15 02:32:57,049 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 667 transitions, 12937 flow [2025-03-15 02:32:57,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 252.33333333333334) internal successors, (1514), 6 states have internal predecessors, (1514), 0 states have call successors, (0), 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:57,049 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:57,049 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] [2025-03-15 02:32:57,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 02:32:57,049 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:57,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:57,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1350622472, now seen corresponding path program 1 times [2025-03-15 02:32:57,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:57,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821494058] [2025-03-15 02:32:57,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:57,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:57,081 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:32:57,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:57,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821494058] [2025-03-15 02:32:57,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821494058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:57,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:57,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:32:57,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834097673] [2025-03-15 02:32:57,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:57,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:32:57,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:57,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:32:57,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:32:57,083 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:32:57,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 667 transitions, 12937 flow. Second operand has 4 states, 4 states have (on average 277.5) internal successors, (1110), 4 states have internal predecessors, (1110), 0 states have call successors, (0), 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:57,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:57,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:32:57,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:58,039 INFO L124 PetriNetUnfolderBase]: 684/2236 cut-off events. [2025-03-15 02:32:58,039 INFO L125 PetriNetUnfolderBase]: For 2273329/5697961 co-relation queries the response was YES. [2025-03-15 02:32:58,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19813 conditions, 2236 events. 684/2236 cut-off events. For 2273329/5697961 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21398 event pairs, 8 based on Foata normal form. 422/2354 useless extension candidates. Maximal degree in co-relation 12318. Up to 863 conditions per place. [2025-03-15 02:32:58,125 INFO L140 encePairwiseOnDemand]: 307/315 looper letters, 226 selfloop transitions, 5 changer transitions 41/685 dead transitions. [2025-03-15 02:32:58,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 685 transitions, 13815 flow [2025-03-15 02:32:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:32:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:32:58,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1147 transitions. [2025-03-15 02:32:58,127 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9103174603174603 [2025-03-15 02:32:58,127 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 91 predicate places. [2025-03-15 02:32:58,127 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 685 transitions, 13815 flow [2025-03-15 02:32:58,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 277.5) internal successors, (1110), 4 states have internal predecessors, (1110), 0 states have call successors, (0), 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:58,128 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:58,128 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:32:58,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 02:32:58,128 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:32:58,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:58,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1080377142, now seen corresponding path program 1 times [2025-03-15 02:32:58,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:58,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360382319] [2025-03-15 02:32:58,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:58,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:58,210 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:32:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360382319] [2025-03-15 02:32:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360382319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:58,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:58,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:32:58,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982763039] [2025-03-15 02:32:58,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:58,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:32:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:58,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:32:58,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:32:58,212 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:32:58,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 685 transitions, 13815 flow. Second operand has 8 states, 8 states have (on average 250.875) internal successors, (2007), 8 states have internal predecessors, (2007), 0 states have call successors, (0), 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:58,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:58,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:32:58,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:00,031 INFO L124 PetriNetUnfolderBase]: 840/2744 cut-off events. [2025-03-15 02:33:00,032 INFO L125 PetriNetUnfolderBase]: For 1296900/8328956 co-relation queries the response was YES. [2025-03-15 02:33:00,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25120 conditions, 2744 events. 840/2744 cut-off events. For 1296900/8328956 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 26706 event pairs, 10 based on Foata normal form. 2099/4479 useless extension candidates. Maximal degree in co-relation 14546. Up to 1111 conditions per place. [2025-03-15 02:33:00,095 INFO L140 encePairwiseOnDemand]: 296/315 looper letters, 338 selfloop transitions, 36 changer transitions 41/754 dead transitions. [2025-03-15 02:33:00,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 754 transitions, 16138 flow [2025-03-15 02:33:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:33:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:33:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2826 transitions. [2025-03-15 02:33:00,100 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8155844155844156 [2025-03-15 02:33:00,101 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 101 predicate places. [2025-03-15 02:33:00,101 INFO L471 AbstractCegarLoop]: Abstraction has has 403 places, 754 transitions, 16138 flow [2025-03-15 02:33:00,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 250.875) internal successors, (2007), 8 states have internal predecessors, (2007), 0 states have call successors, (0), 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:33:00,101 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:00,101 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:33:00,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 02:33:00,102 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:00,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:00,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1221453835, now seen corresponding path program 1 times [2025-03-15 02:33:00,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:00,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967596657] [2025-03-15 02:33:00,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:00,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:00,146 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:33:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967596657] [2025-03-15 02:33:00,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967596657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:00,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:00,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:33:00,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539421878] [2025-03-15 02:33:00,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:00,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:33:00,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:00,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:33:00,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:33:00,148 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:33:00,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 754 transitions, 16138 flow. Second operand has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:33:00,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:00,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:33:00,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:01,310 INFO L124 PetriNetUnfolderBase]: 861/3068 cut-off events. [2025-03-15 02:33:01,310 INFO L125 PetriNetUnfolderBase]: For 697130/2452063 co-relation queries the response was YES. [2025-03-15 02:33:01,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27665 conditions, 3068 events. 861/3068 cut-off events. For 697130/2452063 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 30170 event pairs, 11 based on Foata normal form. 684/3341 useless extension candidates. Maximal degree in co-relation 16709. Up to 1134 conditions per place. [2025-03-15 02:33:01,402 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 354 selfloop transitions, 22 changer transitions 41/824 dead transitions. [2025-03-15 02:33:01,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 824 transitions, 17526 flow [2025-03-15 02:33:01,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:33:01,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:33:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1945 transitions. [2025-03-15 02:33:01,404 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8820861678004536 [2025-03-15 02:33:01,404 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 107 predicate places. [2025-03-15 02:33:01,404 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 824 transitions, 17526 flow [2025-03-15 02:33:01,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:33:01,405 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:01,405 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] [2025-03-15 02:33:01,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 02:33:01,405 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:01,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:01,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1701906286, now seen corresponding path program 1 times [2025-03-15 02:33:01,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:01,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985729920] [2025-03-15 02:33:01,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:01,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:01,444 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:33:01,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:01,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985729920] [2025-03-15 02:33:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985729920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:01,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:33:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890860781] [2025-03-15 02:33:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:33:01,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:01,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:33:01,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:33:01,446 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:33:01,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 824 transitions, 17526 flow. Second operand has 4 states, 4 states have (on average 277.75) internal successors, (1111), 4 states have internal predecessors, (1111), 0 states have call successors, (0), 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:33:01,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:01,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:33:01,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:02,656 INFO L124 PetriNetUnfolderBase]: 1041/3455 cut-off events. [2025-03-15 02:33:02,656 INFO L125 PetriNetUnfolderBase]: For 1081263/1892868 co-relation queries the response was YES. [2025-03-15 02:33:02,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33308 conditions, 3455 events. 1041/3455 cut-off events. For 1081263/1892868 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 35399 event pairs, 9 based on Foata normal form. 241/3214 useless extension candidates. Maximal degree in co-relation 17495. Up to 1394 conditions per place. [2025-03-15 02:33:02,755 INFO L140 encePairwiseOnDemand]: 307/315 looper letters, 269 selfloop transitions, 5 changer transitions 49/850 dead transitions. [2025-03-15 02:33:02,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 850 transitions, 18930 flow [2025-03-15 02:33:02,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:33:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:33:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1147 transitions. [2025-03-15 02:33:02,756 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9103174603174603 [2025-03-15 02:33:02,756 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 109 predicate places. [2025-03-15 02:33:02,756 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 850 transitions, 18930 flow [2025-03-15 02:33:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 277.75) internal successors, (1111), 4 states have internal predecessors, (1111), 0 states have call successors, (0), 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:33:02,757 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:02,757 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] [2025-03-15 02:33:02,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 02:33:02,757 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:02,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:02,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1219486385, now seen corresponding path program 1 times [2025-03-15 02:33:02,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734519045] [2025-03-15 02:33:02,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:02,817 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:33:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:02,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734519045] [2025-03-15 02:33:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734519045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:33:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572598807] [2025-03-15 02:33:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:33:02,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:02,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:33:02,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:33:02,819 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:33:02,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 850 transitions, 18930 flow. Second operand has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:33:02,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:02,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:33:02,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:04,804 INFO L124 PetriNetUnfolderBase]: 1353/4471 cut-off events. [2025-03-15 02:33:04,804 INFO L125 PetriNetUnfolderBase]: For 2603670/4662545 co-relation queries the response was YES. [2025-03-15 02:33:04,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44199 conditions, 4471 events. 1353/4471 cut-off events. For 2603670/4662545 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 50196 event pairs, 8 based on Foata normal form. 735/4543 useless extension candidates. Maximal degree in co-relation 19181. Up to 1910 conditions per place. [2025-03-15 02:33:05,012 INFO L140 encePairwiseOnDemand]: 296/315 looper letters, 396 selfloop transitions, 36 changer transitions 65/950 dead transitions. [2025-03-15 02:33:05,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 950 transitions, 23122 flow [2025-03-15 02:33:05,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:33:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:33:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2826 transitions. [2025-03-15 02:33:05,015 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8155844155844156 [2025-03-15 02:33:05,015 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 119 predicate places. [2025-03-15 02:33:05,015 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 950 transitions, 23122 flow [2025-03-15 02:33:05,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:33:05,016 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:05,016 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] [2025-03-15 02:33:05,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 02:33:05,016 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:05,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -425343619, now seen corresponding path program 1 times [2025-03-15 02:33:05,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:05,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520070710] [2025-03-15 02:33:05,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:05,082 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:33:05,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:05,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520070710] [2025-03-15 02:33:05,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520070710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:05,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:05,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:33:05,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875144417] [2025-03-15 02:33:05,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:05,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:33:05,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:05,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:33:05,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:33:05,084 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:33:05,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 950 transitions, 23122 flow. Second operand has 8 states, 8 states have (on average 250.875) internal successors, (2007), 8 states have internal predecessors, (2007), 0 states have call successors, (0), 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:33:05,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:05,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:33:05,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:07,653 INFO L124 PetriNetUnfolderBase]: 1490/4923 cut-off events. [2025-03-15 02:33:07,653 INFO L125 PetriNetUnfolderBase]: For 1422038/5289194 co-relation queries the response was YES. [2025-03-15 02:33:07,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50478 conditions, 4923 events. 1490/4923 cut-off events. For 1422038/5289194 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 55615 event pairs, 5 based on Foata normal form. 3620/7834 useless extension candidates. Maximal degree in co-relation 24614. Up to 2039 conditions per place. [2025-03-15 02:33:07,858 INFO L140 encePairwiseOnDemand]: 300/315 looper letters, 532 selfloop transitions, 51 changer transitions 65/1037 dead transitions. [2025-03-15 02:33:07,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 1037 transitions, 26277 flow [2025-03-15 02:33:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:33:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:33:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2571 transitions. [2025-03-15 02:33:07,860 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8161904761904762 [2025-03-15 02:33:07,861 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 128 predicate places. [2025-03-15 02:33:07,861 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 1037 transitions, 26277 flow [2025-03-15 02:33:07,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 250.875) internal successors, (2007), 8 states have internal predecessors, (2007), 0 states have call successors, (0), 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:33:07,861 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:07,861 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:33:07,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 02:33:07,862 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:07,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:07,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1157600591, now seen corresponding path program 1 times [2025-03-15 02:33:07,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:07,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577158229] [2025-03-15 02:33:07,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:07,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:07,903 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:33:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577158229] [2025-03-15 02:33:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577158229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:07,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:07,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:33:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200219654] [2025-03-15 02:33:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:07,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:33:07,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:07,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:33:07,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:33:07,905 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:33:07,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 1037 transitions, 26277 flow. Second operand has 6 states, 6 states have (on average 270.6666666666667) internal successors, (1624), 6 states have internal predecessors, (1624), 0 states have call successors, (0), 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:33:07,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:07,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:33:07,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:10,389 INFO L124 PetriNetUnfolderBase]: 1514/5003 cut-off events. [2025-03-15 02:33:10,389 INFO L125 PetriNetUnfolderBase]: For 1106030/1970738 co-relation queries the response was YES. [2025-03-15 02:33:10,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53234 conditions, 5003 events. 1514/5003 cut-off events. For 1106030/1970738 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 56669 event pairs, 7 based on Foata normal form. 514/4803 useless extension candidates. Maximal degree in co-relation 25523. Up to 2085 conditions per place. [2025-03-15 02:33:10,760 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 441 selfloop transitions, 22 changer transitions 67/1111 dead transitions. [2025-03-15 02:33:10,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 1111 transitions, 28135 flow [2025-03-15 02:33:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:33:10,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:33:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1944 transitions. [2025-03-15 02:33:10,762 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8816326530612245 [2025-03-15 02:33:10,762 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 134 predicate places. [2025-03-15 02:33:10,762 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 1111 transitions, 28135 flow [2025-03-15 02:33:10,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.6666666666667) internal successors, (1624), 6 states have internal predecessors, (1624), 0 states have call successors, (0), 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:33:10,763 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:10,763 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] [2025-03-15 02:33:10,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 02:33:10,763 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:10,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 683585989, now seen corresponding path program 1 times [2025-03-15 02:33:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:10,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578033587] [2025-03-15 02:33:10,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:10,810 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:33:10,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:10,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578033587] [2025-03-15 02:33:10,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578033587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:10,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:10,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:33:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516282921] [2025-03-15 02:33:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:10,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:33:10,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:10,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:33:10,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:33:10,812 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:33:10,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 1111 transitions, 28135 flow. Second operand has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:33:10,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:10,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:33:10,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:13,167 INFO L124 PetriNetUnfolderBase]: 1498/4468 cut-off events. [2025-03-15 02:33:13,167 INFO L125 PetriNetUnfolderBase]: For 940356/3621003 co-relation queries the response was YES. [2025-03-15 02:33:13,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52926 conditions, 4468 events. 1498/4468 cut-off events. For 940356/3621003 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 50884 event pairs, 16 based on Foata normal form. 1914/5754 useless extension candidates. Maximal degree in co-relation 33365. Up to 1883 conditions per place. [2025-03-15 02:33:13,522 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 496 selfloop transitions, 25 changer transitions 67/1111 dead transitions. [2025-03-15 02:33:13,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 1111 transitions, 29338 flow [2025-03-15 02:33:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:33:13,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:33:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1938 transitions. [2025-03-15 02:33:13,524 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8789115646258503 [2025-03-15 02:33:13,524 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 140 predicate places. [2025-03-15 02:33:13,524 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 1111 transitions, 29338 flow [2025-03-15 02:33:13,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.5) internal successors, (1623), 6 states have internal predecessors, (1623), 0 states have call successors, (0), 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:33:13,525 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:13,525 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] [2025-03-15 02:33:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 02:33:13,525 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1761313917, now seen corresponding path program 1 times [2025-03-15 02:33:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098127660] [2025-03-15 02:33:13,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:13,586 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:33:13,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098127660] [2025-03-15 02:33:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098127660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:13,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:13,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:33:13,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100104651] [2025-03-15 02:33:13,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:13,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:33:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:13,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:33:13,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:33:13,587 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:33:13,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 1111 transitions, 29338 flow. Second operand has 4 states, 4 states have (on average 278.5) internal successors, (1114), 4 states have internal predecessors, (1114), 0 states have call successors, (0), 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:33:13,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:13,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:33:13,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:16,060 INFO L124 PetriNetUnfolderBase]: 1509/4995 cut-off events. [2025-03-15 02:33:16,061 INFO L125 PetriNetUnfolderBase]: For 1100575/3603524 co-relation queries the response was YES. [2025-03-15 02:33:16,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56830 conditions, 4995 events. 1509/4995 cut-off events. For 1100575/3603524 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 56769 event pairs, 6 based on Foata normal form. 1149/5436 useless extension candidates. Maximal degree in co-relation 27381. Up to 2084 conditions per place. [2025-03-15 02:33:16,224 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 494 selfloop transitions, 23 changer transitions 67/1128 dead transitions. [2025-03-15 02:33:16,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 1128 transitions, 31547 flow [2025-03-15 02:33:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:33:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:33:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1144 transitions. [2025-03-15 02:33:16,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9079365079365079 [2025-03-15 02:33:16,226 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 143 predicate places. [2025-03-15 02:33:16,226 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 1128 transitions, 31547 flow [2025-03-15 02:33:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.5) internal successors, (1114), 4 states have internal predecessors, (1114), 0 states have call successors, (0), 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:33:16,226 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:16,226 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] [2025-03-15 02:33:16,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 02:33:16,227 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -555932650, now seen corresponding path program 1 times [2025-03-15 02:33:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627623106] [2025-03-15 02:33:16,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:16,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:33:16,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627623106] [2025-03-15 02:33:16,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627623106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:16,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:16,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:33:16,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004534810] [2025-03-15 02:33:16,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:16,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:33:16,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:16,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:33:16,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:33:16,291 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 315 [2025-03-15 02:33:16,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 1128 transitions, 31547 flow. Second operand has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:33:16,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:16,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 315 [2025-03-15 02:33:16,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:19,858 INFO L124 PetriNetUnfolderBase]: 1783/5898 cut-off events. [2025-03-15 02:33:19,858 INFO L125 PetriNetUnfolderBase]: For 1939914/3980140 co-relation queries the response was YES. [2025-03-15 02:33:20,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69038 conditions, 5898 events. 1783/5898 cut-off events. For 1939914/3980140 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 68576 event pairs, 24 based on Foata normal form. 1010/6062 useless extension candidates. Maximal degree in co-relation 29459. Up to 2540 conditions per place. [2025-03-15 02:33:20,241 INFO L140 encePairwiseOnDemand]: 300/315 looper letters, 598 selfloop transitions, 51 changer transitions 81/1242 dead transitions. [2025-03-15 02:33:20,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1242 transitions, 36675 flow [2025-03-15 02:33:20,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:33:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:33:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2571 transitions. [2025-03-15 02:33:20,243 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8161904761904762 [2025-03-15 02:33:20,243 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 152 predicate places. [2025-03-15 02:33:20,243 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 1242 transitions, 36675 flow [2025-03-15 02:33:20,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 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:33:20,243 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:20,243 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] [2025-03-15 02:33:20,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 02:33:20,244 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:20,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:20,244 INFO L85 PathProgramCache]: Analyzing trace with hash -352552857, now seen corresponding path program 1 times [2025-03-15 02:33:20,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:20,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75139499] [2025-03-15 02:33:20,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:20,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:20,378 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:33:20,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:20,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75139499] [2025-03-15 02:33:20,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75139499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 02:33:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779657653] [2025-03-15 02:33:20,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:20,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 02:33:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:20,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 02:33:20,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-15 02:33:20,380 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 315 [2025-03-15 02:33:20,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 1242 transitions, 36675 flow. Second operand has 14 states, 14 states have (on average 234.64285714285714) internal successors, (3285), 14 states have internal predecessors, (3285), 0 states have call successors, (0), 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:33:20,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:20,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 315 [2025-03-15 02:33:20,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:25,463 INFO L124 PetriNetUnfolderBase]: 1778/5195 cut-off events. [2025-03-15 02:33:25,464 INFO L125 PetriNetUnfolderBase]: For 1763075/14221263 co-relation queries the response was YES. [2025-03-15 02:33:25,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68774 conditions, 5195 events. 1778/5195 cut-off events. For 1763075/14221263 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 61314 event pairs, 39 based on Foata normal form. 11240/15720 useless extension candidates. Maximal degree in co-relation 46643. Up to 2299 conditions per place. [2025-03-15 02:33:25,701 INFO L140 encePairwiseOnDemand]: 290/315 looper letters, 613 selfloop transitions, 79 changer transitions 81/1273 dead transitions. [2025-03-15 02:33:25,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 470 places, 1273 transitions, 40579 flow [2025-03-15 02:33:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 02:33:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 02:33:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4274 transitions. [2025-03-15 02:33:25,705 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7537918871252205 [2025-03-15 02:33:25,705 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 168 predicate places. [2025-03-15 02:33:25,706 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 1273 transitions, 40579 flow [2025-03-15 02:33:25,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 234.64285714285714) internal successors, (3285), 14 states have internal predecessors, (3285), 0 states have call successors, (0), 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:33:25,706 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:25,706 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] [2025-03-15 02:33:25,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 02:33:25,707 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:25,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash 2007563897, now seen corresponding path program 1 times [2025-03-15 02:33:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167942114] [2025-03-15 02:33:25,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:25,745 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:33:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167942114] [2025-03-15 02:33:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167942114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:25,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:25,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:33:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785875524] [2025-03-15 02:33:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:25,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:33:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:25,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:33:25,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:33:25,747 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:33:25,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 1273 transitions, 40579 flow. Second operand has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:33:25,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:25,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:33:25,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:29,352 INFO L124 PetriNetUnfolderBase]: 1842/5311 cut-off events. [2025-03-15 02:33:29,352 INFO L125 PetriNetUnfolderBase]: For 1821610/3795119 co-relation queries the response was YES. [2025-03-15 02:33:29,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73262 conditions, 5311 events. 1842/5311 cut-off events. For 1821610/3795119 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 62850 event pairs, 31 based on Foata normal form. 1528/6116 useless extension candidates. Maximal degree in co-relation 48101. Up to 2363 conditions per place. [2025-03-15 02:33:29,805 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 602 selfloop transitions, 20 changer transitions 81/1308 dead transitions. [2025-03-15 02:33:29,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 472 places, 1308 transitions, 43678 flow [2025-03-15 02:33:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:33:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:33:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1140 transitions. [2025-03-15 02:33:29,806 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-15 02:33:29,806 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 170 predicate places. [2025-03-15 02:33:29,806 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 1308 transitions, 43678 flow [2025-03-15 02:33:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:33:29,807 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:29,807 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] [2025-03-15 02:33:29,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 02:33:29,807 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:29,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:29,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1955764164, now seen corresponding path program 1 times [2025-03-15 02:33:29,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:29,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707259470] [2025-03-15 02:33:29,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:29,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:30,013 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:33:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707259470] [2025-03-15 02:33:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707259470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 02:33:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737632668] [2025-03-15 02:33:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:30,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 02:33:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:30,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 02:33:30,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-15 02:33:30,016 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 315 [2025-03-15 02:33:30,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 1308 transitions, 43678 flow. Second operand has 14 states, 14 states have (on average 234.71428571428572) internal successors, (3286), 14 states have internal predecessors, (3286), 0 states have call successors, (0), 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:33:30,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:30,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 315 [2025-03-15 02:33:30,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:35,000 INFO L124 PetriNetUnfolderBase]: 1828/5269 cut-off events. [2025-03-15 02:33:35,001 INFO L125 PetriNetUnfolderBase]: For 1925472/14477775 co-relation queries the response was YES. [2025-03-15 02:33:35,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74973 conditions, 5269 events. 1828/5269 cut-off events. For 1925472/14477775 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 62135 event pairs, 16 based on Foata normal form. 11104/15678 useless extension candidates. Maximal degree in co-relation 49429. Up to 2349 conditions per place. [2025-03-15 02:33:35,228 INFO L140 encePairwiseOnDemand]: 288/315 looper letters, 658 selfloop transitions, 91 changer transitions 81/1330 dead transitions. [2025-03-15 02:33:35,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 1330 transitions, 47392 flow [2025-03-15 02:33:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 02:33:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 02:33:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4270 transitions. [2025-03-15 02:33:35,231 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7530864197530864 [2025-03-15 02:33:35,231 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 186 predicate places. [2025-03-15 02:33:35,231 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 1330 transitions, 47392 flow [2025-03-15 02:33:35,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 234.71428571428572) internal successors, (3286), 14 states have internal predecessors, (3286), 0 states have call successors, (0), 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:33:35,232 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:35,232 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] [2025-03-15 02:33:35,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 02:33:35,232 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:35,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:35,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1546247839, now seen corresponding path program 1 times [2025-03-15 02:33:35,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:35,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230720668] [2025-03-15 02:33:35,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:35,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:35,276 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:33:35,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:35,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230720668] [2025-03-15 02:33:35,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230720668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:35,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:35,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:33:35,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965941637] [2025-03-15 02:33:35,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:35,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:33:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:35,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:33:35,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:33:35,278 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 315 [2025-03-15 02:33:35,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 1330 transitions, 47392 flow. Second operand has 6 states, 6 states have (on average 270.6666666666667) internal successors, (1624), 6 states have internal predecessors, (1624), 0 states have call successors, (0), 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:33:35,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:35,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 315 [2025-03-15 02:33:35,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:39,234 INFO L124 PetriNetUnfolderBase]: 1845/5943 cut-off events. [2025-03-15 02:33:39,234 INFO L125 PetriNetUnfolderBase]: For 2049779/3457048 co-relation queries the response was YES. [2025-03-15 02:33:39,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80250 conditions, 5943 events. 1845/5943 cut-off events. For 2049779/3457048 co-relation queries the response was YES. Maximal size of possible extension queue 493. Compared 69650 event pairs, 22 based on Foata normal form. 378/5527 useless extension candidates. Maximal degree in co-relation 35858. Up to 2602 conditions per place. [2025-03-15 02:33:39,536 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 660 selfloop transitions, 25 changer transitions 81/1331 dead transitions. [2025-03-15 02:33:39,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 1331 transitions, 49030 flow [2025-03-15 02:33:39,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:33:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:33:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1937 transitions. [2025-03-15 02:33:39,538 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8784580498866214 [2025-03-15 02:33:39,539 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 192 predicate places. [2025-03-15 02:33:39,539 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 1331 transitions, 49030 flow [2025-03-15 02:33:39,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.6666666666667) internal successors, (1624), 6 states have internal predecessors, (1624), 0 states have call successors, (0), 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:33:39,539 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:39,540 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] [2025-03-15 02:33:39,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 02:33:39,540 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:39,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:39,540 INFO L85 PathProgramCache]: Analyzing trace with hash -788600228, now seen corresponding path program 1 times [2025-03-15 02:33:39,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:39,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465333362] [2025-03-15 02:33:39,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:39,566 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:33:39,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:39,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465333362] [2025-03-15 02:33:39,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465333362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:39,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:39,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:33:39,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471120233] [2025-03-15 02:33:39,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:39,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:33:39,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:39,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:33:39,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:33:39,568 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:33:39,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1331 transitions, 49030 flow. Second operand has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:33:39,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:39,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:33:39,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:43,462 INFO L124 PetriNetUnfolderBase]: 1837/5947 cut-off events. [2025-03-15 02:33:43,463 INFO L125 PetriNetUnfolderBase]: For 2674371/4133494 co-relation queries the response was YES. [2025-03-15 02:33:43,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82790 conditions, 5947 events. 1837/5947 cut-off events. For 2674371/4133494 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 69534 event pairs, 7 based on Foata normal form. 257/5424 useless extension candidates. Maximal degree in co-relation 36872. Up to 2602 conditions per place. [2025-03-15 02:33:43,762 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 677 selfloop transitions, 23 changer transitions 81/1367 dead transitions. [2025-03-15 02:33:43,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 1367 transitions, 53172 flow [2025-03-15 02:33:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:33:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:33:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1144 transitions. [2025-03-15 02:33:43,764 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9079365079365079 [2025-03-15 02:33:43,764 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 195 predicate places. [2025-03-15 02:33:43,764 INFO L471 AbstractCegarLoop]: Abstraction has has 497 places, 1367 transitions, 53172 flow [2025-03-15 02:33:43,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 278.75) internal successors, (1115), 4 states have internal predecessors, (1115), 0 states have call successors, (0), 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:33:43,764 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:43,765 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] [2025-03-15 02:33:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 02:33:43,765 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:43,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:43,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1716213055, now seen corresponding path program 1 times [2025-03-15 02:33:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865748751] [2025-03-15 02:33:43,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:43,831 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:33:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865748751] [2025-03-15 02:33:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865748751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:33:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886438599] [2025-03-15 02:33:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:43,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:33:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:43,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:33:43,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:33:43,833 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 315 [2025-03-15 02:33:43,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 1367 transitions, 53172 flow. Second operand has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 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:33:43,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:43,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 315 [2025-03-15 02:33:43,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:48,119 INFO L124 PetriNetUnfolderBase]: 1700/4907 cut-off events. [2025-03-15 02:33:48,119 INFO L125 PetriNetUnfolderBase]: For 2028379/4149490 co-relation queries the response was YES. [2025-03-15 02:33:48,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76317 conditions, 4907 events. 1700/4907 cut-off events. For 2028379/4149490 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 57992 event pairs, 11 based on Foata normal form. 8891/13162 useless extension candidates. Maximal degree in co-relation 53445. Up to 2235 conditions per place. [2025-03-15 02:33:48,347 INFO L140 encePairwiseOnDemand]: 295/315 looper letters, 640 selfloop transitions, 62 changer transitions 81/1290 dead transitions. [2025-03-15 02:33:48,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 509 places, 1290 transitions, 51108 flow [2025-03-15 02:33:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:33:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:33:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3269 transitions. [2025-03-15 02:33:48,349 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7982905982905983 [2025-03-15 02:33:48,350 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 207 predicate places. [2025-03-15 02:33:48,350 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 1290 transitions, 51108 flow [2025-03-15 02:33:48,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.22222222222223) internal successors, (2225), 9 states have internal predecessors, (2225), 0 states have call successors, (0), 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:33:48,350 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:48,350 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] [2025-03-15 02:33:48,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 02:33:48,350 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:48,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash 290211939, now seen corresponding path program 1 times [2025-03-15 02:33:48,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:48,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563606844] [2025-03-15 02:33:48,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:48,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:48,415 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:33:48,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:48,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563606844] [2025-03-15 02:33:48,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563606844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:48,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:48,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:33:48,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321525199] [2025-03-15 02:33:48,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:48,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:33:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:48,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:33:48,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:33:48,417 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 315 [2025-03-15 02:33:48,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 1290 transitions, 51108 flow. Second operand has 9 states, 9 states have (on average 247.33333333333334) internal successors, (2226), 9 states have internal predecessors, (2226), 0 states have call successors, (0), 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:33:48,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:48,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 315 [2025-03-15 02:33:48,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:51,712 INFO L124 PetriNetUnfolderBase]: 1641/5378 cut-off events. [2025-03-15 02:33:51,712 INFO L125 PetriNetUnfolderBase]: For 2152054/4787672 co-relation queries the response was YES. [2025-03-15 02:33:52,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78007 conditions, 5378 events. 1641/5378 cut-off events. For 2152054/4787672 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 62613 event pairs, 17 based on Foata normal form. 3003/7669 useless extension candidates. Maximal degree in co-relation 30368. Up to 2422 conditions per place. [2025-03-15 02:33:52,133 INFO L140 encePairwiseOnDemand]: 297/315 looper letters, 590 selfloop transitions, 55 changer transitions 81/1238 dead transitions. [2025-03-15 02:33:52,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 1238 transitions, 50283 flow [2025-03-15 02:33:52,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:33:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:33:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3018 transitions. [2025-03-15 02:33:52,136 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7984126984126985 [2025-03-15 02:33:52,136 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 216 predicate places. [2025-03-15 02:33:52,136 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 1238 transitions, 50283 flow [2025-03-15 02:33:52,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.33333333333334) internal successors, (2226), 9 states have internal predecessors, (2226), 0 states have call successors, (0), 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:33:52,137 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:52,137 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] [2025-03-15 02:33:52,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 02:33:52,137 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:52,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash -383275775, now seen corresponding path program 1 times [2025-03-15 02:33:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:52,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633509619] [2025-03-15 02:33:52,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:52,358 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:33:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633509619] [2025-03-15 02:33:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633509619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:52,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:52,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 02:33:52,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883309888] [2025-03-15 02:33:52,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:52,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 02:33:52,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:52,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 02:33:52,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-15 02:33:52,361 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 315 [2025-03-15 02:33:52,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 1238 transitions, 50283 flow. Second operand has 14 states, 14 states have (on average 234.71428571428572) internal successors, (3286), 14 states have internal predecessors, (3286), 0 states have call successors, (0), 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:33:52,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:52,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 315 [2025-03-15 02:33:52,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:56,244 INFO L124 PetriNetUnfolderBase]: 1652/4680 cut-off events. [2025-03-15 02:33:56,244 INFO L125 PetriNetUnfolderBase]: For 2401065/5031117 co-relation queries the response was YES. [2025-03-15 02:33:56,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78080 conditions, 4680 events. 1652/4680 cut-off events. For 2401065/5031117 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 55159 event pairs, 7 based on Foata normal form. 1868/5987 useless extension candidates. Maximal degree in co-relation 57116. Up to 2187 conditions per place. [2025-03-15 02:33:56,754 INFO L140 encePairwiseOnDemand]: 290/315 looper letters, 725 selfloop transitions, 79 changer transitions 93/1311 dead transitions. [2025-03-15 02:33:56,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 1311 transitions, 58173 flow [2025-03-15 02:33:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 02:33:56,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 02:33:56,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4273 transitions. [2025-03-15 02:33:56,758 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7536155202821869 [2025-03-15 02:33:56,758 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 232 predicate places. [2025-03-15 02:33:56,758 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 1311 transitions, 58173 flow [2025-03-15 02:33:56,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 234.71428571428572) internal successors, (3286), 14 states have internal predecessors, (3286), 0 states have call successors, (0), 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:33:56,759 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:56,760 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] [2025-03-15 02:33:56,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 02:33:56,760 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:33:56,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:56,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1976840979, now seen corresponding path program 1 times [2025-03-15 02:33:56,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:56,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630539955] [2025-03-15 02:33:56,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:56,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:56,797 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:33:56,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630539955] [2025-03-15 02:33:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630539955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:56,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:56,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:33:56,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386707589] [2025-03-15 02:33:56,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:56,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:33:56,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:56,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:33:56,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:33:56,799 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 315 [2025-03-15 02:33:56,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 1311 transitions, 58173 flow. Second operand has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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:33:56,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:56,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 315 [2025-03-15 02:33:56,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:00,440 INFO L124 PetriNetUnfolderBase]: 1780/4886 cut-off events. [2025-03-15 02:34:00,440 INFO L125 PetriNetUnfolderBase]: For 3705606/6322267 co-relation queries the response was YES. [2025-03-15 02:34:00,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85684 conditions, 4886 events. 1780/4886 cut-off events. For 3705606/6322267 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 59702 event pairs, 21 based on Foata normal form. 415/4698 useless extension candidates. Maximal degree in co-relation 64272. Up to 2347 conditions per place. [2025-03-15 02:34:00,933 INFO L140 encePairwiseOnDemand]: 310/315 looper letters, 723 selfloop transitions, 20 changer transitions 109/1371 dead transitions. [2025-03-15 02:34:00,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 1371 transitions, 63845 flow [2025-03-15 02:34:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:34:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:34:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1140 transitions. [2025-03-15 02:34:00,935 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-15 02:34:00,935 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 234 predicate places. [2025-03-15 02:34:00,935 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 1371 transitions, 63845 flow [2025-03-15 02:34:00,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 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:00,936 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:00,936 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 02:34:00,936 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:00,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1991318590, now seen corresponding path program 1 times [2025-03-15 02:34:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:00,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441388958] [2025-03-15 02:34:00,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:01,042 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:34:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:01,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441388958] [2025-03-15 02:34:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441388958] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:01,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:01,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 02:34:01,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582125905] [2025-03-15 02:34:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:01,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 02:34:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:01,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 02:34:01,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-15 02:34:01,045 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 315 [2025-03-15 02:34:01,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 1371 transitions, 63845 flow. Second operand has 13 states, 13 states have (on average 240.0) internal successors, (3120), 13 states have internal predecessors, (3120), 0 states have call successors, (0), 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:01,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:01,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 315 [2025-03-15 02:34:01,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:05,595 INFO L124 PetriNetUnfolderBase]: 1779/4883 cut-off events. [2025-03-15 02:34:05,596 INFO L125 PetriNetUnfolderBase]: For 2691399/8403060 co-relation queries the response was YES. [2025-03-15 02:34:05,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87738 conditions, 4883 events. 1779/4883 cut-off events. For 2691399/8403060 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 59291 event pairs, 36 based on Foata normal form. 11905/16187 useless extension candidates. Maximal degree in co-relation 65727. Up to 2346 conditions per place. [2025-03-15 02:34:05,909 INFO L140 encePairwiseOnDemand]: 293/315 looper letters, 707 selfloop transitions, 48 changer transitions 109/1378 dead transitions. [2025-03-15 02:34:05,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 1378 transitions, 65871 flow [2025-03-15 02:34:05,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 02:34:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 02:34:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4622 transitions. [2025-03-15 02:34:05,911 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7722639933166249 [2025-03-15 02:34:05,912 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 252 predicate places. [2025-03-15 02:34:05,912 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 1378 transitions, 65871 flow [2025-03-15 02:34:05,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 240.0) internal successors, (3120), 13 states have internal predecessors, (3120), 0 states have call successors, (0), 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:05,912 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:05,912 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] [2025-03-15 02:34:05,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 02:34:05,912 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:05,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:05,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1003353821, now seen corresponding path program 1 times [2025-03-15 02:34:05,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:05,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230256218] [2025-03-15 02:34:05,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:05,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:06,021 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:34:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230256218] [2025-03-15 02:34:06,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230256218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:06,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:06,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 02:34:06,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753534081] [2025-03-15 02:34:06,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:06,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 02:34:06,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:06,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 02:34:06,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2025-03-15 02:34:06,023 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 315 [2025-03-15 02:34:06,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 1378 transitions, 65871 flow. Second operand has 14 states, 14 states have (on average 234.78571428571428) internal successors, (3287), 14 states have internal predecessors, (3287), 0 states have call successors, (0), 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:06,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:06,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 315 [2025-03-15 02:34:06,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:10,366 INFO L124 PetriNetUnfolderBase]: 1768/5503 cut-off events. [2025-03-15 02:34:10,366 INFO L125 PetriNetUnfolderBase]: For 2595413/5920638 co-relation queries the response was YES. [2025-03-15 02:34:10,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92954 conditions, 5503 events. 1768/5503 cut-off events. For 2595413/5920638 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 65223 event pairs, 16 based on Foata normal form. 2572/7458 useless extension candidates. Maximal degree in co-relation 36953. Up to 2577 conditions per place. [2025-03-15 02:34:10,974 INFO L140 encePairwiseOnDemand]: 288/315 looper letters, 819 selfloop transitions, 91 changer transitions 109/1436 dead transitions. [2025-03-15 02:34:10,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 1436 transitions, 73455 flow [2025-03-15 02:34:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 02:34:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 02:34:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 4269 transitions. [2025-03-15 02:34:10,977 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7529100529100529 [2025-03-15 02:34:10,977 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 268 predicate places. [2025-03-15 02:34:10,977 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 1436 transitions, 73455 flow [2025-03-15 02:34:10,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 234.78571428571428) internal successors, (3287), 14 states have internal predecessors, (3287), 0 states have call successors, (0), 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,978 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:10,978 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] [2025-03-15 02:34:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-15 02:34:10,978 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:10,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -23175397, now seen corresponding path program 1 times [2025-03-15 02:34:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:10,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269003454] [2025-03-15 02:34:10,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:11,071 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:34:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269003454] [2025-03-15 02:34:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269003454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 02:34:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152060556] [2025-03-15 02:34:11,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 02:34:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:11,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 02:34:11,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-15 02:34:11,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 315 [2025-03-15 02:34:11,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 1436 transitions, 73455 flow. Second operand has 13 states, 13 states have (on average 240.07692307692307) internal successors, (3121), 13 states have internal predecessors, (3121), 0 states have call successors, (0), 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:11,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:11,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 315 [2025-03-15 02:34:11,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:15,921 INFO L124 PetriNetUnfolderBase]: 1767/5500 cut-off events. [2025-03-15 02:34:15,921 INFO L125 PetriNetUnfolderBase]: For 2638124/7361545 co-relation queries the response was YES. [2025-03-15 02:34:16,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94973 conditions, 5500 events. 1767/5500 cut-off events. For 2638124/7361545 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 65322 event pairs, 30 based on Foata normal form. 3951/8836 useless extension candidates. Maximal degree in co-relation 37754. Up to 2576 conditions per place. [2025-03-15 02:34:16,170 INFO L140 encePairwiseOnDemand]: 292/315 looper letters, 782 selfloop transitions, 49 changer transitions 109/1440 dead transitions. [2025-03-15 02:34:16,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 1440 transitions, 75706 flow [2025-03-15 02:34:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 02:34:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 02:34:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4621 transitions. [2025-03-15 02:34:16,172 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7720969089390142 [2025-03-15 02:34:16,172 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 286 predicate places. [2025-03-15 02:34:16,172 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 1440 transitions, 75706 flow [2025-03-15 02:34:16,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 240.07692307692307) internal successors, (3121), 13 states have internal predecessors, (3121), 0 states have call successors, (0), 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:16,173 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:16,173 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] [2025-03-15 02:34:16,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 02:34:16,173 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:16,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1277911160, now seen corresponding path program 1 times [2025-03-15 02:34:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998127221] [2025-03-15 02:34:16,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:16,227 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:34:16,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998127221] [2025-03-15 02:34:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998127221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:34:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165055819] [2025-03-15 02:34:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:34:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:16,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:34:16,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:34:16,229 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 315 [2025-03-15 02:34:16,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 1440 transitions, 75706 flow. Second operand has 9 states, 9 states have (on average 247.33333333333334) internal successors, (2226), 9 states have internal predecessors, (2226), 0 states have call successors, (0), 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:16,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:16,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 315 [2025-03-15 02:34:16,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:20,183 INFO L124 PetriNetUnfolderBase]: 1527/4796 cut-off events. [2025-03-15 02:34:20,183 INFO L125 PetriNetUnfolderBase]: For 2948200/5682065 co-relation queries the response was YES. [2025-03-15 02:34:20,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85346 conditions, 4796 events. 1527/4796 cut-off events. For 2948200/5682065 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 55080 event pairs, 16 based on Foata normal form. 2566/6863 useless extension candidates. Maximal degree in co-relation 33832. Up to 2176 conditions per place. [2025-03-15 02:34:20,591 INFO L140 encePairwiseOnDemand]: 295/315 looper letters, 750 selfloop transitions, 62 changer transitions 85/1323 dead transitions. [2025-03-15 02:34:20,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 1323 transitions, 69910 flow [2025-03-15 02:34:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:34:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:34:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3269 transitions. [2025-03-15 02:34:20,594 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7982905982905983 [2025-03-15 02:34:20,594 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 298 predicate places. [2025-03-15 02:34:20,595 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 1323 transitions, 69910 flow [2025-03-15 02:34:20,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.33333333333334) internal successors, (2226), 9 states have internal predecessors, (2226), 0 states have call successors, (0), 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:20,595 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:20,595 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] [2025-03-15 02:34:20,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-15 02:34:20,595 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:20,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:20,596 INFO L85 PathProgramCache]: Analyzing trace with hash -412244803, now seen corresponding path program 1 times [2025-03-15 02:34:20,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:20,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869004636] [2025-03-15 02:34:20,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:20,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:20,688 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:34:20,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:20,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869004636] [2025-03-15 02:34:20,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869004636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:20,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:20,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:34:20,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113585699] [2025-03-15 02:34:20,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:20,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:34:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:20,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:34:20,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:34:20,692 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 315 [2025-03-15 02:34:20,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 1323 transitions, 69910 flow. Second operand has 9 states, 9 states have (on average 247.44444444444446) internal successors, (2227), 9 states have internal predecessors, (2227), 0 states have call successors, (0), 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:20,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:20,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 315 [2025-03-15 02:34:20,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:23,869 INFO L124 PetriNetUnfolderBase]: 1366/3862 cut-off events. [2025-03-15 02:34:23,870 INFO L125 PetriNetUnfolderBase]: For 3538133/5706119 co-relation queries the response was YES. [2025-03-15 02:34:24,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76351 conditions, 3862 events. 1366/3862 cut-off events. For 3538133/5706119 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 44826 event pairs, 7 based on Foata normal form. 1892/5383 useless extension candidates. Maximal degree in co-relation 52394. Up to 1759 conditions per place. [2025-03-15 02:34:24,269 INFO L140 encePairwiseOnDemand]: 297/315 looper letters, 691 selfloop transitions, 55 changer transitions 73/1250 dead transitions. [2025-03-15 02:34:24,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 1250 transitions, 67150 flow [2025-03-15 02:34:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:34:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:34:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3018 transitions. [2025-03-15 02:34:24,271 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7984126984126985 [2025-03-15 02:34:24,272 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 307 predicate places. [2025-03-15 02:34:24,272 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 1250 transitions, 67150 flow [2025-03-15 02:34:24,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 247.44444444444446) internal successors, (2227), 9 states have internal predecessors, (2227), 0 states have call successors, (0), 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:24,272 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:24,272 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] [2025-03-15 02:34:24,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 02:34:24,272 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:24,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:24,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1139681933, now seen corresponding path program 1 times [2025-03-15 02:34:24,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:24,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898623439] [2025-03-15 02:34:24,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:24,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:24,302 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:34:24,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898623439] [2025-03-15 02:34:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898623439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:24,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:34:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153151449] [2025-03-15 02:34:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:24,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:34:24,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:24,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:34:24,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:34:24,304 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 315 [2025-03-15 02:34:24,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 1250 transitions, 67150 flow. Second operand has 4 states, 4 states have (on average 290.25) internal successors, (1161), 4 states have internal predecessors, (1161), 0 states have call successors, (0), 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:24,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:24,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 315 [2025-03-15 02:34:24,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:27,899 INFO L124 PetriNetUnfolderBase]: 1385/3899 cut-off events. [2025-03-15 02:34:27,899 INFO L125 PetriNetUnfolderBase]: For 6806375/10900734 co-relation queries the response was YES. [2025-03-15 02:34:28,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78611 conditions, 3899 events. 1385/3899 cut-off events. For 6806375/10900734 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 45408 event pairs, 6 based on Foata normal form. 1639/5163 useless extension candidates. Maximal degree in co-relation 53305. Up to 1778 conditions per place. [2025-03-15 02:34:28,109 INFO L140 encePairwiseOnDemand]: 308/315 looper letters, 580 selfloop transitions, 5 changer transitions 73/1262 dead transitions. [2025-03-15 02:34:28,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 1262 transitions, 68820 flow [2025-03-15 02:34:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:34:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:34:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1473 transitions. [2025-03-15 02:34:28,110 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9352380952380952 [2025-03-15 02:34:28,111 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 311 predicate places. [2025-03-15 02:34:28,111 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 1262 transitions, 68820 flow [2025-03-15 02:34:28,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 290.25) internal successors, (1161), 4 states have internal predecessors, (1161), 0 states have call successors, (0), 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:28,111 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:28,111 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] [2025-03-15 02:34:28,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-15 02:34:28,111 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:28,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1240258680, now seen corresponding path program 1 times [2025-03-15 02:34:28,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086200207] [2025-03-15 02:34:28,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:28,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:28,231 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:34:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:28,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086200207] [2025-03-15 02:34:28,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086200207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:28,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:28,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 02:34:28,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880763047] [2025-03-15 02:34:28,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:28,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 02:34:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:28,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 02:34:28,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-15 02:34:28,233 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 315 [2025-03-15 02:34:28,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 1262 transitions, 68820 flow. Second operand has 13 states, 13 states have (on average 240.07692307692307) internal successors, (3121), 13 states have internal predecessors, (3121), 0 states have call successors, (0), 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:28,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:28,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 315 [2025-03-15 02:34:28,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:32,024 INFO L124 PetriNetUnfolderBase]: 1392/4387 cut-off events. [2025-03-15 02:34:32,024 INFO L125 PetriNetUnfolderBase]: For 5720066/8527651 co-relation queries the response was YES. [2025-03-15 02:34:32,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83897 conditions, 4387 events. 1392/4387 cut-off events. For 5720066/8527651 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 48592 event pairs, 20 based on Foata normal form. 2311/6283 useless extension candidates. Maximal degree in co-relation 54643. Up to 1969 conditions per place. [2025-03-15 02:34:32,492 INFO L140 encePairwiseOnDemand]: 293/315 looper letters, 710 selfloop transitions, 48 changer transitions 73/1273 dead transitions. [2025-03-15 02:34:32,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 1273 transitions, 71192 flow [2025-03-15 02:34:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 02:34:32,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 02:34:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4621 transitions. [2025-03-15 02:34:32,495 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7720969089390142 [2025-03-15 02:34:32,495 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 329 predicate places. [2025-03-15 02:34:32,495 INFO L471 AbstractCegarLoop]: Abstraction has has 631 places, 1273 transitions, 71192 flow [2025-03-15 02:34:32,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 240.07692307692307) internal successors, (3121), 13 states have internal predecessors, (3121), 0 states have call successors, (0), 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:32,496 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:32,496 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:34:32,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-15 02:34:32,496 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1831196012, now seen corresponding path program 1 times [2025-03-15 02:34:32,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:32,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821299595] [2025-03-15 02:34:32,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:32,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:32,592 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:34:32,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:32,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821299595] [2025-03-15 02:34:32,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821299595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:32,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 02:34:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027217678] [2025-03-15 02:34:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:32,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 02:34:32,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:32,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 02:34:32,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-03-15 02:34:32,594 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 315 [2025-03-15 02:34:32,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 1273 transitions, 71192 flow. Second operand has 13 states, 13 states have (on average 240.15384615384616) internal successors, (3122), 13 states have internal predecessors, (3122), 0 states have call successors, (0), 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:32,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:32,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 315 [2025-03-15 02:34:32,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:36,952 INFO L124 PetriNetUnfolderBase]: 1390/4381 cut-off events. [2025-03-15 02:34:36,952 INFO L125 PetriNetUnfolderBase]: For 7178506/9944588 co-relation queries the response was YES. [2025-03-15 02:34:37,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85883 conditions, 4381 events. 1390/4381 cut-off events. For 7178506/9944588 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 48679 event pairs, 11 based on Foata normal form. 2296/6267 useless extension candidates. Maximal degree in co-relation 55974. Up to 1967 conditions per place. [2025-03-15 02:34:37,256 INFO L140 encePairwiseOnDemand]: 292/315 looper letters, 718 selfloop transitions, 49 changer transitions 73/1282 dead transitions. [2025-03-15 02:34:37,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 1282 transitions, 73758 flow [2025-03-15 02:34:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 02:34:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 02:34:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4620 transitions. [2025-03-15 02:34:37,258 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7719298245614035 [2025-03-15 02:34:37,258 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 347 predicate places. [2025-03-15 02:34:37,259 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 1282 transitions, 73758 flow [2025-03-15 02:34:37,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 240.15384615384616) internal successors, (3122), 13 states have internal predecessors, (3122), 0 states have call successors, (0), 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:37,259 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:37,259 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] [2025-03-15 02:34:37,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-15 02:34:37,259 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:37,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1582513799, now seen corresponding path program 1 times [2025-03-15 02:34:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:37,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626637355] [2025-03-15 02:34:37,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:37,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:37,286 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:34:37,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626637355] [2025-03-15 02:34:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626637355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:37,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:34:37,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:34:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282065860] [2025-03-15 02:34:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:37,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:34:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:37,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:34:37,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:34:37,287 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 315 [2025-03-15 02:34:37,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 1282 transitions, 73758 flow. Second operand has 4 states, 4 states have (on average 290.5) internal successors, (1162), 4 states have internal predecessors, (1162), 0 states have call successors, (0), 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:37,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:37,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 315 [2025-03-15 02:34:37,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:40,421 INFO L124 PetriNetUnfolderBase]: 1419/3953 cut-off events. [2025-03-15 02:34:40,421 INFO L125 PetriNetUnfolderBase]: For 10988065/13881485 co-relation queries the response was YES. [2025-03-15 02:34:40,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85483 conditions, 3953 events. 1419/3953 cut-off events. For 10988065/13881485 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 45739 event pairs, 8 based on Foata normal form. 594/4167 useless extension candidates. Maximal degree in co-relation 58764. Up to 1812 conditions per place. [2025-03-15 02:34:40,803 INFO L140 encePairwiseOnDemand]: 308/315 looper letters, 606 selfloop transitions, 5 changer transitions 73/1298 dead transitions. [2025-03-15 02:34:40,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 1298 transitions, 75884 flow [2025-03-15 02:34:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:34:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:34:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1473 transitions. [2025-03-15 02:34:40,804 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9352380952380952 [2025-03-15 02:34:40,805 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 351 predicate places. [2025-03-15 02:34:40,805 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 1298 transitions, 75884 flow [2025-03-15 02:34:40,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 290.5) internal successors, (1162), 4 states have internal predecessors, (1162), 0 states have call successors, (0), 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:40,805 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:40,805 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, 1, 1, 1, 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:40,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-15 02:34:40,805 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:40,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:40,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1647037547, now seen corresponding path program 1 times [2025-03-15 02:34:40,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:40,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341385930] [2025-03-15 02:34:40,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:40,969 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:34:40,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:40,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341385930] [2025-03-15 02:34:40,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341385930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:34:40,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199949980] [2025-03-15 02:34:40,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:40,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:34:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:34:40,975 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:34:40,976 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:34:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:41,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:34:41,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:34:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:41,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:34:41,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199949980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:41,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:34:41,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 18 [2025-03-15 02:34:41,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869132444] [2025-03-15 02:34:41,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:41,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:34:41,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:41,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:34:41,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-03-15 02:34:41,091 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 315 [2025-03-15 02:34:41,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 1298 transitions, 75884 flow. Second operand has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 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:41,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:41,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 315 [2025-03-15 02:34:41,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:44,624 INFO L124 PetriNetUnfolderBase]: 1445/4465 cut-off events. [2025-03-15 02:34:44,624 INFO L125 PetriNetUnfolderBase]: For 4338029/7414139 co-relation queries the response was YES. [2025-03-15 02:34:44,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91533 conditions, 4465 events. 1445/4465 cut-off events. For 4338029/7414139 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 50666 event pairs, 12 based on Foata normal form. 1457/5501 useless extension candidates. Maximal degree in co-relation 38646. Up to 2022 conditions per place. [2025-03-15 02:34:44,861 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 659 selfloop transitions, 18 changer transitions 73/1307 dead transitions. [2025-03-15 02:34:44,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 1307 transitions, 78110 flow [2025-03-15 02:34:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:34:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:34:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2222 transitions. [2025-03-15 02:34:44,863 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8817460317460317 [2025-03-15 02:34:44,863 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 356 predicate places. [2025-03-15 02:34:44,863 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 1307 transitions, 78110 flow [2025-03-15 02:34:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 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:44,863 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:44,864 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,871 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:34:45,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-03-15 02:34:45,065 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:45,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1687797774, now seen corresponding path program 1 times [2025-03-15 02:34:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:45,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102183652] [2025-03-15 02:34:45,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:45,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:45,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:45,271 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:34:45,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:45,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102183652] [2025-03-15 02:34:45,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102183652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:34:45,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791812886] [2025-03-15 02:34:45,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:45,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:34:45,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:34:45,274 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:34:45,292 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:34:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:45,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:34:45,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:34:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:45,372 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:34:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791812886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:45,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:34:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 18 [2025-03-15 02:34:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087233470] [2025-03-15 02:34:45,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:45,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:34:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:45,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:34:45,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-03-15 02:34:45,373 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 315 [2025-03-15 02:34:45,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 1307 transitions, 78110 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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:45,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:45,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 315 [2025-03-15 02:34:45,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:48,827 INFO L124 PetriNetUnfolderBase]: 1479/4496 cut-off events. [2025-03-15 02:34:48,827 INFO L125 PetriNetUnfolderBase]: For 5760940/8448698 co-relation queries the response was YES. [2025-03-15 02:34:49,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94913 conditions, 4496 events. 1479/4496 cut-off events. For 5760940/8448698 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 50721 event pairs, 14 based on Foata normal form. 960/5035 useless extension candidates. Maximal degree in co-relation 62573. Up to 2052 conditions per place. [2025-03-15 02:34:49,301 INFO L140 encePairwiseOnDemand]: 304/315 looper letters, 675 selfloop transitions, 18 changer transitions 73/1324 dead transitions. [2025-03-15 02:34:49,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 1324 transitions, 81176 flow [2025-03-15 02:34:49,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:34:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:34:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2221 transitions. [2025-03-15 02:34:49,303 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8813492063492063 [2025-03-15 02:34:49,303 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 361 predicate places. [2025-03-15 02:34:49,303 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 1324 transitions, 81176 flow [2025-03-15 02:34:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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:49,303 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:49,303 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:34:49,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 02:34:49,504 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,SelfDestructingSolverStorable47 [2025-03-15 02:34:49,504 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:49,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1042887132, now seen corresponding path program 1 times [2025-03-15 02:34:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:49,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129927772] [2025-03-15 02:34:49,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:49,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:49,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:49,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129927772] [2025-03-15 02:34:49,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129927772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:34:49,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685891837] [2025-03-15 02:34:49,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:49,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:34:49,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:34:49,703 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:34:49,705 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:34:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:49,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:34:49,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:34:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:49,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:34:49,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685891837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:49,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:34:49,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 18 [2025-03-15 02:34:49,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740299347] [2025-03-15 02:34:49,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:49,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:34:49,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:49,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:34:49,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-03-15 02:34:49,803 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 315 [2025-03-15 02:34:49,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 1324 transitions, 81176 flow. Second operand has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 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:49,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:49,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 315 [2025-03-15 02:34:49,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:53,614 INFO L124 PetriNetUnfolderBase]: 1478/4493 cut-off events. [2025-03-15 02:34:53,614 INFO L125 PetriNetUnfolderBase]: For 4357074/7750708 co-relation queries the response was YES. [2025-03-15 02:34:53,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96432 conditions, 4493 events. 1478/4493 cut-off events. For 4357074/7750708 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 50803 event pairs, 10 based on Foata normal form. 2634/6708 useless extension candidates. Maximal degree in co-relation 63592. Up to 2051 conditions per place. [2025-03-15 02:34:53,983 INFO L140 encePairwiseOnDemand]: 305/315 looper letters, 676 selfloop transitions, 16 changer transitions 73/1323 dead transitions. [2025-03-15 02:34:53,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 1323 transitions, 82650 flow [2025-03-15 02:34:53,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:34:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:34:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1946 transitions. [2025-03-15 02:34:53,985 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8825396825396825 [2025-03-15 02:34:53,985 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 366 predicate places. [2025-03-15 02:34:53,985 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 1323 transitions, 82650 flow [2025-03-15 02:34:53,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 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:53,985 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:53,985 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:34:53,992 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:34:54,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:34:54,186 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:54,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:54,187 INFO L85 PathProgramCache]: Analyzing trace with hash 693558997, now seen corresponding path program 1 times [2025-03-15 02:34:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028376864] [2025-03-15 02:34:54,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:54,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:54,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028376864] [2025-03-15 02:34:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028376864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:34:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660603281] [2025-03-15 02:34:54,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:54,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:34:54,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:34:54,367 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:34:54,368 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:34:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:54,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:34:54,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:34:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:54,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:34:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660603281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:34:54,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:34:54,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 18 [2025-03-15 02:34:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211343262] [2025-03-15 02:34:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:34:54,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:34:54,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:34:54,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:34:54,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2025-03-15 02:34:54,456 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 315 [2025-03-15 02:34:54,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 1323 transitions, 82650 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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:54,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:34:54,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 315 [2025-03-15 02:34:54,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:58,626 INFO L124 PetriNetUnfolderBase]: 1485/4983 cut-off events. [2025-03-15 02:34:58,626 INFO L125 PetriNetUnfolderBase]: For 6045611/8517830 co-relation queries the response was YES. [2025-03-15 02:34:58,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101845 conditions, 4983 events. 1485/4983 cut-off events. For 6045611/8517830 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 55714 event pairs, 25 based on Foata normal form. 541/5066 useless extension candidates. Maximal degree in co-relation 44240. Up to 2243 conditions per place. [2025-03-15 02:34:58,875 INFO L140 encePairwiseOnDemand]: 305/315 looper letters, 676 selfloop transitions, 16 changer transitions 73/1322 dead transitions. [2025-03-15 02:34:58,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 1322 transitions, 84124 flow [2025-03-15 02:34:58,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:34:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:34:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1945 transitions. [2025-03-15 02:34:58,876 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8820861678004536 [2025-03-15 02:34:58,877 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 371 predicate places. [2025-03-15 02:34:58,877 INFO L471 AbstractCegarLoop]: Abstraction has has 673 places, 1322 transitions, 84124 flow [2025-03-15 02:34:58,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 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:58,877 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:34:58,877 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 02:34:59,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-03-15 02:34:59,078 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:34:59,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:34:59,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1688765475, now seen corresponding path program 1 times [2025-03-15 02:34:59,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:34:59,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931355263] [2025-03-15 02:34:59,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:59,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:34:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:59,232 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:59,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:34:59,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931355263] [2025-03-15 02:34:59,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931355263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:34:59,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87517097] [2025-03-15 02:34:59,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:34:59,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:34:59,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:34:59,234 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:34:59,235 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:34:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:34:59,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 02:34:59,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:34:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:34:59,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:35:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:00,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87517097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:35:00,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:35:00,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 48 [2025-03-15 02:35:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716656144] [2025-03-15 02:35:00,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:35:00,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-15 02:35:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:00,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-15 02:35:00,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2221, Unknown=0, NotChecked=0, Total=2352 [2025-03-15 02:35:00,109 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 315 [2025-03-15 02:35:00,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 1322 transitions, 84124 flow. Second operand has 49 states, 49 states have (on average 229.6122448979592) internal successors, (11251), 49 states have internal predecessors, (11251), 0 states have call successors, (0), 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:35:00,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:00,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 315 [2025-03-15 02:35:00,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:15,820 INFO L124 PetriNetUnfolderBase]: 2732/7309 cut-off events. [2025-03-15 02:35:15,820 INFO L125 PetriNetUnfolderBase]: For 11083406/27854149 co-relation queries the response was YES. [2025-03-15 02:35:16,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177876 conditions, 7309 events. 2732/7309 cut-off events. For 11083406/27854149 co-relation queries the response was YES. Maximal size of possible extension queue 1013. Compared 96316 event pairs, 19 based on Foata normal form. 57782/64266 useless extension candidates. Maximal degree in co-relation 126042. Up to 3523 conditions per place. [2025-03-15 02:35:16,211 INFO L140 encePairwiseOnDemand]: 271/315 looper letters, 1379 selfloop transitions, 227 changer transitions 137/2166 dead transitions. [2025-03-15 02:35:16,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 835 places, 2166 transitions, 161260 flow [2025-03-15 02:35:16,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-03-15 02:35:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2025-03-15 02:35:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 37612 transitions. [2025-03-15 02:35:16,379 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7236556036556037 [2025-03-15 02:35:16,379 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 533 predicate places. [2025-03-15 02:35:16,379 INFO L471 AbstractCegarLoop]: Abstraction has has 835 places, 2166 transitions, 161260 flow [2025-03-15 02:35:16,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 229.6122448979592) internal successors, (11251), 49 states have internal predecessors, (11251), 0 states have call successors, (0), 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:35:16,381 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:16,381 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:16,387 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:35:16,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:16,581 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:35:16,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:16,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1910870825, now seen corresponding path program 1 times [2025-03-15 02:35:16,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:16,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299355294] [2025-03-15 02:35:16,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:16,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:16,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299355294] [2025-03-15 02:35:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299355294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:35:16,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702624541] [2025-03-15 02:35:16,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:35:16,729 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:35:16,730 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:35:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:16,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 02:35:16,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:35:17,182 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:17,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:35:17,610 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:17,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702624541] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:35:17,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:35:17,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 48 [2025-03-15 02:35:17,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573204434] [2025-03-15 02:35:17,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:35:17,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-15 02:35:17,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:17,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-15 02:35:17,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2221, Unknown=0, NotChecked=0, Total=2352 [2025-03-15 02:35:17,615 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 315 [2025-03-15 02:35:17,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 2166 transitions, 161260 flow. Second operand has 49 states, 49 states have (on average 229.6734693877551) internal successors, (11254), 49 states have internal predecessors, (11254), 0 states have call successors, (0), 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:35:17,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:17,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 315 [2025-03-15 02:35:17,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:41,601 INFO L124 PetriNetUnfolderBase]: 3897/10993 cut-off events. [2025-03-15 02:35:41,601 INFO L125 PetriNetUnfolderBase]: For 20658880/38530588 co-relation queries the response was YES. [2025-03-15 02:35:42,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263140 conditions, 10993 events. 3897/10993 cut-off events. For 20658880/38530588 co-relation queries the response was YES. Maximal size of possible extension queue 1672. Compared 159797 event pairs, 31 based on Foata normal form. 30034/40020 useless extension candidates. Maximal degree in co-relation 154056. Up to 5375 conditions per place. [2025-03-15 02:35:42,229 INFO L140 encePairwiseOnDemand]: 271/315 looper letters, 2175 selfloop transitions, 227 changer transitions 205/3206 dead transitions. [2025-03-15 02:35:42,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 997 places, 3206 transitions, 262432 flow [2025-03-15 02:35:42,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-03-15 02:35:42,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2025-03-15 02:35:42,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 37609 transitions. [2025-03-15 02:35:42,240 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7235978835978836 [2025-03-15 02:35:42,241 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 695 predicate places. [2025-03-15 02:35:42,241 INFO L471 AbstractCegarLoop]: Abstraction has has 997 places, 3206 transitions, 262432 flow [2025-03-15 02:35:42,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 229.6734693877551) internal successors, (11254), 49 states have internal predecessors, (11254), 0 states have call successors, (0), 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:35:42,242 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:42,242 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-15 02:35:42,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 02:35:42,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:42,443 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:35:42,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:42,444 INFO L85 PathProgramCache]: Analyzing trace with hash -321540691, now seen corresponding path program 1 times [2025-03-15 02:35:42,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:42,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531004161] [2025-03-15 02:35:42,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:42,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:42,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531004161] [2025-03-15 02:35:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531004161] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:35:42,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151547009] [2025-03-15 02:35:42,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:42,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:42,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:35:42,625 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:35:42,629 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:35:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:42,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 02:35:42,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:35:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:43,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:35:43,543 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151547009] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:35:43,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:35:43,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 48 [2025-03-15 02:35:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032368307] [2025-03-15 02:35:43,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:35:43,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-15 02:35:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:43,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-15 02:35:43,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2221, Unknown=0, NotChecked=0, Total=2352 [2025-03-15 02:35:43,548 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 315 [2025-03-15 02:35:43,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 997 places, 3206 transitions, 262432 flow. Second operand has 49 states, 49 states have (on average 229.79591836734693) internal successors, (11260), 49 states have internal predecessors, (11260), 0 states have call successors, (0), 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:35:43,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:43,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 315 [2025-03-15 02:35:43,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:21,000 INFO L124 PetriNetUnfolderBase]: 5697/13429 cut-off events. [2025-03-15 02:36:21,000 INFO L125 PetriNetUnfolderBase]: For 22418415/52086590 co-relation queries the response was YES. [2025-03-15 02:36:21,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371966 conditions, 13429 events. 5697/13429 cut-off events. For 22418415/52086590 co-relation queries the response was YES. Maximal size of possible extension queue 2928. Compared 222226 event pairs, 49 based on Foata normal form. 221819/233914 useless extension candidates. Maximal degree in co-relation 302925. Up to 6955 conditions per place. [2025-03-15 02:36:21,860 INFO L140 encePairwiseOnDemand]: 274/315 looper letters, 3194 selfloop transitions, 310 changer transitions 303/4453 dead transitions. [2025-03-15 02:36:21,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1153 places, 4453 transitions, 389738 flow [2025-03-15 02:36:21,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-03-15 02:36:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2025-03-15 02:36:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 36018 transitions. [2025-03-15 02:36:21,871 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7236889692585895 [2025-03-15 02:36:21,872 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 851 predicate places. [2025-03-15 02:36:21,872 INFO L471 AbstractCegarLoop]: Abstraction has has 1153 places, 4453 transitions, 389738 flow [2025-03-15 02:36:21,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 229.79591836734693) internal successors, (11260), 49 states have internal predecessors, (11260), 0 states have call successors, (0), 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:36:21,873 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:21,873 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-15 02:36:21,879 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:36:22,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:22,078 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:36:22,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash 685288999, now seen corresponding path program 1 times [2025-03-15 02:36:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:22,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963755342] [2025-03-15 02:36:22,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:22,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 34 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:22,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:22,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963755342] [2025-03-15 02:36:22,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963755342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:36:22,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733403700] [2025-03-15 02:36:22,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:22,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:22,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:22,231 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:36:22,232 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:36:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:22,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 02:36:22,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:36:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:22,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:36:23,123 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:23,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733403700] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:36:23,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:36:23,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 48 [2025-03-15 02:36:23,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878437633] [2025-03-15 02:36:23,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:36:23,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-15 02:36:23,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:23,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-15 02:36:23,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2221, Unknown=0, NotChecked=0, Total=2352 [2025-03-15 02:36:23,128 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 315 [2025-03-15 02:36:23,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1153 places, 4453 transitions, 389738 flow. Second operand has 49 states, 49 states have (on average 229.85714285714286) internal successors, (11263), 49 states have internal predecessors, (11263), 0 states have call successors, (0), 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:36:23,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:23,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 315 [2025-03-15 02:36:23,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:27,639 INFO L124 PetriNetUnfolderBase]: 7422/18301 cut-off events. [2025-03-15 02:37:27,640 INFO L125 PetriNetUnfolderBase]: For 53400115/101145800 co-relation queries the response was YES. [2025-03-15 02:37:28,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500986 conditions, 18301 events. 7422/18301 cut-off events. For 53400115/101145800 co-relation queries the response was YES. Maximal size of possible extension queue 4191. Compared 312349 event pairs, 53 based on Foata normal form. 47330/64019 useless extension candidates. Maximal degree in co-relation 421025. Up to 9481 conditions per place. [2025-03-15 02:37:28,970 INFO L140 encePairwiseOnDemand]: 274/315 looper letters, 4160 selfloop transitions, 310 changer transitions 405/5706 dead transitions. [2025-03-15 02:37:28,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1309 places, 5706 transitions, 521970 flow [2025-03-15 02:37:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2025-03-15 02:37:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2025-03-15 02:37:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 36015 transitions. [2025-03-15 02:37:28,981 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7236286919831224 [2025-03-15 02:37:28,982 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 1007 predicate places. [2025-03-15 02:37:28,982 INFO L471 AbstractCegarLoop]: Abstraction has has 1309 places, 5706 transitions, 521970 flow [2025-03-15 02:37:28,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 229.85714285714286) internal successors, (11263), 49 states have internal predecessors, (11263), 0 states have call successors, (0), 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:28,983 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:28,984 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:28,990 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:37:29,185 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,SelfDestructingSolverStorable53 [2025-03-15 02:37:29,185 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:37:29,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:29,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1043573210, now seen corresponding path program 1 times [2025-03-15 02:37:29,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:29,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851798667] [2025-03-15 02:37:29,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:29,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851798667] [2025-03-15 02:37:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851798667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:37:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987957556] [2025-03-15 02:37:29,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:37:29,390 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:37:29,392 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:37:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:29,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 02:37:29,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:37:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:29,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:37:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:29,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987957556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:37:29,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:37:29,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2025-03-15 02:37:29,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797874526] [2025-03-15 02:37:29,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:37:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-15 02:37:29,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:29,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-15 02:37:29,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2025-03-15 02:37:29,920 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 315 [2025-03-15 02:37:29,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1309 places, 5706 transitions, 521970 flow. Second operand has 40 states, 40 states have (on average 233.8) internal successors, (9352), 40 states have internal predecessors, (9352), 0 states have call successors, (0), 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:29,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:29,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 315 [2025-03-15 02:37:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:25,526 INFO L124 PetriNetUnfolderBase]: 7437/19363 cut-off events. [2025-03-15 02:38:25,526 INFO L125 PetriNetUnfolderBase]: For 35863258/91809853 co-relation queries the response was YES. [2025-03-15 02:38:26,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518313 conditions, 19363 events. 7437/19363 cut-off events. For 35863258/91809853 co-relation queries the response was YES. Maximal size of possible extension queue 4111. Compared 324577 event pairs, 78 based on Foata normal form. 110112/127804 useless extension candidates. Maximal degree in co-relation 359558. Up to 9863 conditions per place. [2025-03-15 02:38:27,099 INFO L140 encePairwiseOnDemand]: 286/315 looper letters, 4256 selfloop transitions, 224 changer transitions 405/5706 dead transitions. [2025-03-15 02:38:27,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1346 places, 5706 transitions, 531884 flow [2025-03-15 02:38:27,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-15 02:38:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-15 02:38:27,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 8914 transitions. [2025-03-15 02:38:27,102 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7446950710108605 [2025-03-15 02:38:27,103 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 1044 predicate places. [2025-03-15 02:38:27,103 INFO L471 AbstractCegarLoop]: Abstraction has has 1346 places, 5706 transitions, 531884 flow [2025-03-15 02:38:27,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 233.8) internal successors, (9352), 40 states have internal predecessors, (9352), 0 states have call successors, (0), 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:38:27,104 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:27,104 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-15 02:38:27,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-15 02:38:27,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:27,305 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:38:27,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:27,306 INFO L85 PathProgramCache]: Analyzing trace with hash 384459315, now seen corresponding path program 1 times [2025-03-15 02:38:27,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:27,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836131975] [2025-03-15 02:38:27,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:27,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:27,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836131975] [2025-03-15 02:38:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836131975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:38:27,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784562516] [2025-03-15 02:38:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:27,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:27,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:38:27,495 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:38:27,496 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:38:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:27,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 02:38:27,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:38:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:27,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:38:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 34 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:28,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784562516] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:38:28,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:38:28,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2025-03-15 02:38:28,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319386941] [2025-03-15 02:38:28,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:38:28,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-15 02:38:28,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:28,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-15 02:38:28,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2025-03-15 02:38:28,061 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 315 [2025-03-15 02:38:28,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1346 places, 5706 transitions, 531884 flow. Second operand has 40 states, 40 states have (on average 233.9) internal successors, (9356), 40 states have internal predecessors, (9356), 0 states have call successors, (0), 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:38:28,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:28,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 315 [2025-03-15 02:38:28,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:29,931 INFO L124 PetriNetUnfolderBase]: 7401/17221 cut-off events. [2025-03-15 02:39:29,932 INFO L125 PetriNetUnfolderBase]: For 35955446/148663865 co-relation queries the response was YES. [2025-03-15 02:39:30,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508341 conditions, 17221 events. 7401/17221 cut-off events. For 35955446/148663865 co-relation queries the response was YES. Maximal size of possible extension queue 4281. Compared 302834 event pairs, 29 based on Foata normal form. 131265/146941 useless extension candidates. Maximal degree in co-relation 434504. Up to 9093 conditions per place. [2025-03-15 02:39:31,294 INFO L140 encePairwiseOnDemand]: 286/315 looper letters, 4254 selfloop transitions, 209 changer transitions 405/5703 dead transitions. [2025-03-15 02:39:31,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1383 places, 5703 transitions, 541419 flow [2025-03-15 02:39:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-15 02:39:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-15 02:39:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 8917 transitions. [2025-03-15 02:39:31,298 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7449456975772766 [2025-03-15 02:39:31,298 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 1081 predicate places. [2025-03-15 02:39:31,299 INFO L471 AbstractCegarLoop]: Abstraction has has 1383 places, 5703 transitions, 541419 flow [2025-03-15 02:39:31,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 233.9) internal successors, (9356), 40 states have internal predecessors, (9356), 0 states have call successors, (0), 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:39:31,300 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:31,300 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-15 02:39:31,306 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:39:31,500 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,SelfDestructingSolverStorable55 [2025-03-15 02:39:31,501 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:39:31,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1182125963, now seen corresponding path program 1 times [2025-03-15 02:39:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177206686] [2025-03-15 02:39:31,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:31,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177206686] [2025-03-15 02:39:31,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177206686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:31,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753769179] [2025-03-15 02:39:31,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:39:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:31,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:31,555 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:39:31,555 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:39:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:39:31,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:39:31,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:39:31,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:39:31,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753769179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:39:31,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:39:31,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:39:31,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999770115] [2025-03-15 02:39:31,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:39:31,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:39:31,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:31,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:39:31,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:39:31,701 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 315 [2025-03-15 02:39:31,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1383 places, 5703 transitions, 541419 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 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:39:31,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:31,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 315 [2025-03-15 02:39:31,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:40:26,096 INFO L124 PetriNetUnfolderBase]: 7413/18274 cut-off events. [2025-03-15 02:40:26,096 INFO L125 PetriNetUnfolderBase]: For 45534183/118254797 co-relation queries the response was YES. [2025-03-15 02:40:27,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524539 conditions, 18274 events. 7413/18274 cut-off events. For 45534183/118254797 co-relation queries the response was YES. Maximal size of possible extension queue 4191. Compared 313265 event pairs, 36 based on Foata normal form. 20747/37427 useless extension candidates. Maximal degree in co-relation 440786. Up to 9472 conditions per place. [2025-03-15 02:40:27,643 INFO L140 encePairwiseOnDemand]: 309/315 looper letters, 3967 selfloop transitions, 8 changer transitions 405/5712 dead transitions. [2025-03-15 02:40:27,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1388 places, 5712 transitions, 551327 flow [2025-03-15 02:40:27,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:40:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:40:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2051 transitions. [2025-03-15 02:40:27,644 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9301587301587302 [2025-03-15 02:40:27,645 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 1086 predicate places. [2025-03-15 02:40:27,645 INFO L471 AbstractCegarLoop]: Abstraction has has 1388 places, 5712 transitions, 551327 flow [2025-03-15 02:40:27,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 0 states have call successors, (0), 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:40:27,645 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:40:27,645 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-15 02:40:27,651 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:40:27,846 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,SelfDestructingSolverStorable56 [2025-03-15 02:40:27,846 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:40:27,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:40:27,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2008801666, now seen corresponding path program 1 times [2025-03-15 02:40:27,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:40:27,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995678409] [2025-03-15 02:40:27,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:27,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:40:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:40:27,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:40:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995678409] [2025-03-15 02:40:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995678409] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:40:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662593644] [2025-03-15 02:40:27,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:27,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:40:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:40:27,892 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:40:27,892 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:40:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:27,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:40:27,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:40:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:40:28,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:40:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:40:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662593644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:40:28,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:40:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:40:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803988699] [2025-03-15 02:40:28,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:40:28,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:40:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:40:28,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:40:28,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:40:28,140 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 315 [2025-03-15 02:40:28,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1388 places, 5712 transitions, 551327 flow. Second operand has 12 states, 12 states have (on average 291.4166666666667) internal successors, (3497), 12 states have internal predecessors, (3497), 0 states have call successors, (0), 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:40:28,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:40:28,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 315 [2025-03-15 02:40:28,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:41:54,395 INFO L124 PetriNetUnfolderBase]: 9762/26134 cut-off events. [2025-03-15 02:41:54,396 INFO L125 PetriNetUnfolderBase]: For 23894521/42124722 co-relation queries the response was YES. [2025-03-15 02:41:57,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 722456 conditions, 26134 events. 9762/26134 cut-off events. For 23894521/42124722 co-relation queries the response was YES. Maximal size of possible extension queue 4141. Compared 392867 event pairs, 52 based on Foata normal form. 19186/43279 useless extension candidates. Maximal degree in co-relation 398428. Up to 12086 conditions per place. [2025-03-15 02:41:58,483 INFO L140 encePairwiseOnDemand]: 308/315 looper letters, 5366 selfloop transitions, 18 changer transitions 405/7121 dead transitions. [2025-03-15 02:41:58,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1401 places, 7121 transitions, 727959 flow [2025-03-15 02:41:58,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:41:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:41:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4106 transitions. [2025-03-15 02:41:58,486 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9310657596371882 [2025-03-15 02:41:58,486 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 1099 predicate places. [2025-03-15 02:41:58,486 INFO L471 AbstractCegarLoop]: Abstraction has has 1401 places, 7121 transitions, 727959 flow [2025-03-15 02:41:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 291.4166666666667) internal successors, (3497), 12 states have internal predecessors, (3497), 0 states have call successors, (0), 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:41:58,486 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:41:58,487 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-15 02:41:58,493 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:41:58,690 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,SelfDestructingSolverStorable57 [2025-03-15 02:41:58,690 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:41:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:41:58,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1692148224, now seen corresponding path program 1 times [2025-03-15 02:41:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:41:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943635800] [2025-03-15 02:41:58,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:58,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:41:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:58,868 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:58,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:41:58,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943635800] [2025-03-15 02:41:58,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943635800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:41:58,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649022080] [2025-03-15 02:41:58,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:41:58,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:58,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:41:58,870 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:41:58,871 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:41:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:41:58,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-15 02:41:58,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:41:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:59,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:41:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:41:59,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649022080] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:41:59,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:41:59,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2025-03-15 02:41:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192765063] [2025-03-15 02:41:59,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:41:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-15 02:41:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:41:59,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-15 02:41:59,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2025-03-15 02:41:59,471 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 315 [2025-03-15 02:41:59,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1401 places, 7121 transitions, 727959 flow. Second operand has 40 states, 40 states have (on average 233.825) internal successors, (9353), 40 states have internal predecessors, (9353), 0 states have call successors, (0), 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:41:59,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:41:59,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 315 [2025-03-15 02:41:59,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:44:14,023 INFO L124 PetriNetUnfolderBase]: 9733/25038 cut-off events. [2025-03-15 02:44:14,023 INFO L125 PetriNetUnfolderBase]: For 31425230/51614439 co-relation queries the response was YES. [2025-03-15 02:44:17,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726426 conditions, 25038 events. 9733/25038 cut-off events. For 31425230/51614439 co-relation queries the response was YES. Maximal size of possible extension queue 4205. Compared 379507 event pairs, 44 based on Foata normal form. 14461/37542 useless extension candidates. Maximal degree in co-relation 478982. Up to 11690 conditions per place. [2025-03-15 02:44:18,284 INFO L140 encePairwiseOnDemand]: 286/315 looper letters, 5663 selfloop transitions, 224 changer transitions 405/7131 dead transitions. [2025-03-15 02:44:18,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1438 places, 7131 transitions, 741913 flow [2025-03-15 02:44:18,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-15 02:44:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-15 02:44:18,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 8913 transitions. [2025-03-15 02:44:18,288 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7446115288220552 [2025-03-15 02:44:18,288 INFO L298 CegarLoopForPetriNet]: 302 programPoint places, 1136 predicate places. [2025-03-15 02:44:18,288 INFO L471 AbstractCegarLoop]: Abstraction has has 1438 places, 7131 transitions, 741913 flow [2025-03-15 02:44:18,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 233.825) internal successors, (9353), 40 states have internal predecessors, (9353), 0 states have call successors, (0), 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:44:18,289 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:44:18,289 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-15 02:44:18,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-15 02:44:18,490 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,SelfDestructingSolverStorable58 [2025-03-15 02:44:18,490 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 55 more)] === [2025-03-15 02:44:18,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:44:18,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1694931567, now seen corresponding path program 1 times [2025-03-15 02:44:18,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:44:18,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880932559] [2025-03-15 02:44:18,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:44:18,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:44:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:44:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:44:18,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:44:18,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880932559] [2025-03-15 02:44:18,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880932559] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:44:18,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995041505] [2025-03-15 02:44:18,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:44:18,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:44:18,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:44:18,696 INFO L229 MonitoredProcess]: Starting monitored process 15 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:44:18,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-15 02:44:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:44:18,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-15 02:44:18,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:44:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:44:18,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:44:19,378 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:44:19,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995041505] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:44:19,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:44:19,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 41 [2025-03-15 02:44:19,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939438480] [2025-03-15 02:44:19,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:44:19,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-15 02:44:19,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:44:19,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-15 02:44:19,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2025-03-15 02:44:19,382 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 315 [2025-03-15 02:44:19,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1438 places, 7131 transitions, 741913 flow. Second operand has 42 states, 42 states have (on average 233.42857142857142) internal successors, (9804), 42 states have internal predecessors, (9804), 0 states have call successors, (0), 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:44:19,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:44:19,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 315 [2025-03-15 02:44:19,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 02:45:47,620 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:45:47,620 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 02:45:48,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-15 02:45:48,634 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:45:49,700 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 58 remaining) [2025-03-15 02:45:49,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2025-03-15 02:45:49,701 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 58 remaining) [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 58 remaining) [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 58 remaining) [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 58 remaining) [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 58 remaining) [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 58 remaining) [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 58 remaining) [2025-03-15 02:45:49,703 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 58 remaining) [2025-03-15 02:45:49,704 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 58 remaining) [2025-03-15 02:45:49,705 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 58 remaining) [2025-03-15 02:45:49,705 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-15 02:45:49,717 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:45:49,717 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:45:49,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:45:49 BasicIcfg [2025-03-15 02:45:49,725 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:45:49,726 INFO L158 Benchmark]: Toolchain (without parser) took 784581.11ms. Allocated memory was 71.3MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 44.2MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2025-03-15 02:45:49,726 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:45:49,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.45ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 32.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 02:45:49,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.72ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 30.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 02:45:49,727 INFO L158 Benchmark]: Boogie Preprocessor took 23.65ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 29.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:45:49,727 INFO L158 Benchmark]: RCFGBuilder took 505.25ms. Allocated memory is still 71.3MB. Free memory was 29.2MB in the beginning and 32.7MB in the end (delta: -3.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2025-03-15 02:45:49,727 INFO L158 Benchmark]: TraceAbstraction took 783813.12ms. Allocated memory was 71.3MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 31.5MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 5.8GB. Max. memory is 8.0GB. [2025-03-15 02:45:49,732 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 36.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.45ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 32.4MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.72ms. Allocated memory is still 71.3MB. Free memory was 32.4MB in the beginning and 30.4MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.65ms. Allocated memory is still 71.3MB. Free memory was 30.4MB in the beginning and 29.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 505.25ms. Allocated memory is still 71.3MB. Free memory was 29.2MB in the beginning and 32.7MB in the end (delta: -3.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * TraceAbstraction took 783813.12ms. Allocated memory was 71.3MB in the beginning and 6.5GB in the end (delta: 6.4GB). Free memory was 31.5MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 5.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 44]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 79]: 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, 512 locations, 58 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: 783.6s, OverallIterations: 60, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 767.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12226 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12226 mSDsluCounter, 13576 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12169 mSDsCounter, 275 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31705 IncrementalHoareTripleChecker+Invalid, 31980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 275 mSolverCounterUnsat, 1407 mSDtfsCounter, 31705 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5921 GetRequests, 4240 SyntacticMatches, 1 SemanticMatches, 1680 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55061 ImplicationChecksByTransitivity, 24.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741913occurred in iteration=59, InterpolantAutomatonStates: 1233, 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.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 9584 NumberOfCodeBlocks, 9584 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 11185 ConstructedInterpolants, 0 QuantifiedInterpolants, 32436 SizeOfPredicates, 171 NumberOfNonLiveVariables, 3820 ConjunctsInSsa, 184 ConjunctsInUnsatCore, 83 InterpolantComputations, 51 PerfectInterpolantSequences, 559/1659 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