/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:22:15,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:22:15,257 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:22:15,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:22:15,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:22:15,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:22:15,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:22:15,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:22:15,277 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:22:15,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:22:15,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:22:15,278 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:22:15,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:22:15,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:22:15,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:22:15,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:22:15,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:22:15,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:22:15,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:22:15,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:22:15,279 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:22:15,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:22:15,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:22:15,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:22:15,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:22:15,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:22:15,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2025-03-15 02:22:16,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516f37784/acf8cce1090048639560d47916328b6e/FLAGecb19fff6 [2025-03-15 02:22:16,940 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:22:16,944 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-file-item-symm.wvr.c [2025-03-15 02:22:16,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516f37784/acf8cce1090048639560d47916328b6e/FLAGecb19fff6 [2025-03-15 02:22:17,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/516f37784/acf8cce1090048639560d47916328b6e [2025-03-15 02:22:17,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:22:17,319 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:22:17,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:22:17,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:22:17,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:22:17,323 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,324 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a506bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17, skipping insertion in model container [2025-03-15 02:22:17,324 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:22:17,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:22:17,457 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:22:17,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:22:17,485 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:22:17,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17 WrapperNode [2025-03-15 02:22:17,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:22:17,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:22:17,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:22:17,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:22:17,494 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:22:17" (1/1) ... [2025-03-15 02:22:17,505 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:22:17" (1/1) ... [2025-03-15 02:22:17,534 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 171 [2025-03-15 02:22:17,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:22:17,535 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:22:17,535 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:22:17,535 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:22:17,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,551 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:22:17,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:22:17,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:22:17,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:22:17,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (1/1) ... [2025-03-15 02:22:17,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:22:17,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:22:17,594 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:22:17,597 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:22:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:22:17,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:22:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:22:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:22:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:22:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:22:17,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:22:17,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:22:17,618 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:22:17,696 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:22:17,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:22:17,999 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:22:17,999 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:22:18,016 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:22:18,018 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:22:18,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:22:18 BoogieIcfgContainer [2025-03-15 02:22:18,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:22:18,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:22:18,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:22:18,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:22:18,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:22:17" (1/3) ... [2025-03-15 02:22:18,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaad84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:22:18, skipping insertion in model container [2025-03-15 02:22:18,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:22:17" (2/3) ... [2025-03-15 02:22:18,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aaad84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:22:18, skipping insertion in model container [2025-03-15 02:22:18,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:22:18" (3/3) ... [2025-03-15 02:22:18,029 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2025-03-15 02:22:18,045 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:22:18,047 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-file-item-symm.wvr.c that has 3 procedures, 218 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-15 02:22:18,048 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:22:18,149 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:22:18,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:22:18,197 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;@5195955, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:22:18,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-15 02:22:18,244 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:22:18,244 INFO L124 PetriNetUnfolderBase]: 6/109 cut-off events. [2025-03-15 02:22:18,247 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 02:22:18,247 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:18,248 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] [2025-03-15 02:22:18,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:18,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash -717591172, now seen corresponding path program 1 times [2025-03-15 02:22:18,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:18,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177609125] [2025-03-15 02:22:18,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:18,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:18,625 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:22:18,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:18,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177609125] [2025-03-15 02:22:18,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177609125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:18,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:18,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:22:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368139124] [2025-03-15 02:22:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:18,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:22:18,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:18,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:22:18,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:22:18,656 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 236 [2025-03-15 02:22:18,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 236 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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:22:18,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:18,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 236 [2025-03-15 02:22:18,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:18,862 INFO L124 PetriNetUnfolderBase]: 60/507 cut-off events. [2025-03-15 02:22:18,863 INFO L125 PetriNetUnfolderBase]: For 41/42 co-relation queries the response was YES. [2025-03-15 02:22:18,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 684 conditions, 507 events. 60/507 cut-off events. For 41/42 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2674 event pairs, 13 based on Foata normal form. 33/462 useless extension candidates. Maximal degree in co-relation 600. Up to 49 conditions per place. [2025-03-15 02:22:18,876 INFO L140 encePairwiseOnDemand]: 220/236 looper letters, 34 selfloop transitions, 5 changer transitions 23/232 dead transitions. [2025-03-15 02:22:18,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 232 transitions, 562 flow [2025-03-15 02:22:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:22:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:22:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 857 transitions. [2025-03-15 02:22:18,889 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9078389830508474 [2025-03-15 02:22:18,893 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, -7 predicate places. [2025-03-15 02:22:18,893 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 232 transitions, 562 flow [2025-03-15 02:22:18,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.5) internal successors, (806), 4 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have 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:22:18,893 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:18,894 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] [2025-03-15 02:22:18,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:22:18,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:18,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash -770489236, now seen corresponding path program 1 times [2025-03-15 02:22:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143451046] [2025-03-15 02:22:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:18,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:19,075 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:22:19,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143451046] [2025-03-15 02:22:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143451046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:19,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047120101] [2025-03-15 02:22:19,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:19,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:19,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:19,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:19,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:19,082 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 236 [2025-03-15 02:22:19,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 232 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 196.16666666666666) internal successors, (1177), 6 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have 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:22:19,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:19,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 236 [2025-03-15 02:22:19,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:19,259 INFO L124 PetriNetUnfolderBase]: 87/578 cut-off events. [2025-03-15 02:22:19,259 INFO L125 PetriNetUnfolderBase]: For 100/103 co-relation queries the response was YES. [2025-03-15 02:22:19,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 578 events. 87/578 cut-off events. For 100/103 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3008 event pairs, 3 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 793. Up to 122 conditions per place. [2025-03-15 02:22:19,263 INFO L140 encePairwiseOnDemand]: 228/236 looper letters, 37 selfloop transitions, 8 changer transitions 23/235 dead transitions. [2025-03-15 02:22:19,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 235 transitions, 668 flow [2025-03-15 02:22:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:22:19,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:22:19,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1200 transitions. [2025-03-15 02:22:19,270 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.847457627118644 [2025-03-15 02:22:19,270 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, -3 predicate places. [2025-03-15 02:22:19,270 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 235 transitions, 668 flow [2025-03-15 02:22:19,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.16666666666666) internal successors, (1177), 6 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have 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:22:19,271 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:19,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] [2025-03-15 02:22:19,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:22:19,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:19,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -429166514, now seen corresponding path program 1 times [2025-03-15 02:22:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703885895] [2025-03-15 02:22:19,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:19,348 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:22:19,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703885895] [2025-03-15 02:22:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703885895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:19,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:19,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:22:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481040476] [2025-03-15 02:22:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:19,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:22:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:19,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:22:19,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:22:19,350 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 236 [2025-03-15 02:22:19,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 235 transitions, 668 flow. Second operand has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have 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:22:19,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:19,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 236 [2025-03-15 02:22:19,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:19,500 INFO L124 PetriNetUnfolderBase]: 121/690 cut-off events. [2025-03-15 02:22:19,500 INFO L125 PetriNetUnfolderBase]: For 503/609 co-relation queries the response was YES. [2025-03-15 02:22:19,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1328 conditions, 690 events. 121/690 cut-off events. For 503/609 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4284 event pairs, 16 based on Foata normal form. 0/594 useless extension candidates. Maximal degree in co-relation 948. Up to 122 conditions per place. [2025-03-15 02:22:19,511 INFO L140 encePairwiseOnDemand]: 228/236 looper letters, 38 selfloop transitions, 5 changer transitions 23/247 dead transitions. [2025-03-15 02:22:19,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 247 transitions, 794 flow [2025-03-15 02:22:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:22:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:22:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 843 transitions. [2025-03-15 02:22:19,517 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8930084745762712 [2025-03-15 02:22:19,518 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, -1 predicate places. [2025-03-15 02:22:19,518 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 247 transitions, 794 flow [2025-03-15 02:22:19,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have 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:22:19,519 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:19,520 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:22:19,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:22:19,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -419259357, now seen corresponding path program 1 times [2025-03-15 02:22:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956983731] [2025-03-15 02:22:19,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:19,597 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:22:19,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:19,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956983731] [2025-03-15 02:22:19,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956983731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:19,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:19,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:19,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792066133] [2025-03-15 02:22:19,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:19,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:19,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:19,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:19,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:19,600 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 236 [2025-03-15 02:22:19,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 247 transitions, 794 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:22:19,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:19,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 236 [2025-03-15 02:22:19,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:19,784 INFO L124 PetriNetUnfolderBase]: 153/851 cut-off events. [2025-03-15 02:22:19,785 INFO L125 PetriNetUnfolderBase]: For 753/760 co-relation queries the response was YES. [2025-03-15 02:22:19,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 851 events. 153/851 cut-off events. For 753/760 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5618 event pairs, 5 based on Foata normal form. 0/732 useless extension candidates. Maximal degree in co-relation 1399. Up to 146 conditions per place. [2025-03-15 02:22:19,793 INFO L140 encePairwiseOnDemand]: 228/236 looper letters, 41 selfloop transitions, 10 changer transitions 23/250 dead transitions. [2025-03-15 02:22:19,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 250 transitions, 924 flow [2025-03-15 02:22:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:22:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:22:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1200 transitions. [2025-03-15 02:22:19,797 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.847457627118644 [2025-03-15 02:22:19,798 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 3 predicate places. [2025-03-15 02:22:19,798 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 250 transitions, 924 flow [2025-03-15 02:22:19,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:22:19,799 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:19,799 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] [2025-03-15 02:22:19,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:22:19,799 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:19,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash -409931341, now seen corresponding path program 1 times [2025-03-15 02:22:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013152047] [2025-03-15 02:22:19,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:19,932 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:22:19,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:19,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013152047] [2025-03-15 02:22:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013152047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:19,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:19,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41430500] [2025-03-15 02:22:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:19,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:19,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:19,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:19,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:19,934 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 236 [2025-03-15 02:22:19,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 250 transitions, 924 flow. Second operand has 6 states, 6 states have (on average 196.16666666666666) internal successors, (1177), 6 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have 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:22:19,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:19,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 236 [2025-03-15 02:22:19,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:20,101 INFO L124 PetriNetUnfolderBase]: 151/845 cut-off events. [2025-03-15 02:22:20,101 INFO L125 PetriNetUnfolderBase]: For 1099/1108 co-relation queries the response was YES. [2025-03-15 02:22:20,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2065 conditions, 845 events. 151/845 cut-off events. For 1099/1108 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5547 event pairs, 5 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 1571. Up to 146 conditions per place. [2025-03-15 02:22:20,107 INFO L140 encePairwiseOnDemand]: 228/236 looper letters, 40 selfloop transitions, 10 changer transitions 23/249 dead transitions. [2025-03-15 02:22:20,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 249 transitions, 1020 flow [2025-03-15 02:22:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:22:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:22:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-15 02:22:20,109 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8467514124293786 [2025-03-15 02:22:20,112 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 7 predicate places. [2025-03-15 02:22:20,112 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 249 transitions, 1020 flow [2025-03-15 02:22:20,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.16666666666666) internal successors, (1177), 6 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have 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:22:20,113 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:20,113 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] [2025-03-15 02:22:20,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:22:20,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:20,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:20,114 INFO L85 PathProgramCache]: Analyzing trace with hash 177030950, now seen corresponding path program 1 times [2025-03-15 02:22:20,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:20,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93790146] [2025-03-15 02:22:20,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:20,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:20,173 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:22:20,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:20,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93790146] [2025-03-15 02:22:20,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93790146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:20,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:20,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:22:20,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252612801] [2025-03-15 02:22:20,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:20,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:22:20,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:20,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:22:20,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:22:20,176 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 236 [2025-03-15 02:22:20,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 249 transitions, 1020 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:22:20,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:20,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 236 [2025-03-15 02:22:20,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:20,294 INFO L124 PetriNetUnfolderBase]: 147/841 cut-off events. [2025-03-15 02:22:20,294 INFO L125 PetriNetUnfolderBase]: For 1441/1452 co-relation queries the response was YES. [2025-03-15 02:22:20,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2242 conditions, 841 events. 147/841 cut-off events. For 1441/1452 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5540 event pairs, 5 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 1711. Up to 146 conditions per place. [2025-03-15 02:22:20,300 INFO L140 encePairwiseOnDemand]: 231/236 looper letters, 41 selfloop transitions, 4 changer transitions 23/251 dead transitions. [2025-03-15 02:22:20,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 251 transitions, 1149 flow [2025-03-15 02:22:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:22:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:22:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 838 transitions. [2025-03-15 02:22:20,302 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8877118644067796 [2025-03-15 02:22:20,303 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 10 predicate places. [2025-03-15 02:22:20,303 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 251 transitions, 1149 flow [2025-03-15 02:22:20,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:22:20,304 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:20,304 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:22:20,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:22:20,304 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:20,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1404005360, now seen corresponding path program 1 times [2025-03-15 02:22:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:20,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137338851] [2025-03-15 02:22:20,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:20,388 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:22:20,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137338851] [2025-03-15 02:22:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137338851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:20,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:20,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291672595] [2025-03-15 02:22:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:20,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:22:20,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:20,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:22:20,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:22:20,390 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 236 [2025-03-15 02:22:20,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 251 transitions, 1149 flow. Second operand has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have 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:22:20,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:20,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 236 [2025-03-15 02:22:20,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:20,539 INFO L124 PetriNetUnfolderBase]: 153/867 cut-off events. [2025-03-15 02:22:20,539 INFO L125 PetriNetUnfolderBase]: For 1991/2004 co-relation queries the response was YES. [2025-03-15 02:22:20,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 867 events. 153/867 cut-off events. For 1991/2004 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5811 event pairs, 5 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1949. Up to 146 conditions per place. [2025-03-15 02:22:20,546 INFO L140 encePairwiseOnDemand]: 228/236 looper letters, 46 selfloop transitions, 8 changer transitions 23/256 dead transitions. [2025-03-15 02:22:20,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 256 transitions, 1283 flow [2025-03-15 02:22:20,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:22:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:22:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2025-03-15 02:22:20,548 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8637005649717514 [2025-03-15 02:22:20,548 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 14 predicate places. [2025-03-15 02:22:20,548 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 256 transitions, 1283 flow [2025-03-15 02:22:20,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 198.8) internal successors, (994), 5 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have 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:22:20,549 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:20,549 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:22:20,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:22:20,549 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:20,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash 297408234, now seen corresponding path program 1 times [2025-03-15 02:22:20,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:20,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772089959] [2025-03-15 02:22:20,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:20,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:20,617 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:22:20,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:20,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772089959] [2025-03-15 02:22:20,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772089959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:20,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:20,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813001408] [2025-03-15 02:22:20,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:20,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:20,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:20,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:20,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:20,618 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 236 [2025-03-15 02:22:20,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 256 transitions, 1283 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:22:20,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:20,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 236 [2025-03-15 02:22:20,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:20,799 INFO L124 PetriNetUnfolderBase]: 151/861 cut-off events. [2025-03-15 02:22:20,799 INFO L125 PetriNetUnfolderBase]: For 2385/2400 co-relation queries the response was YES. [2025-03-15 02:22:20,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2734 conditions, 861 events. 151/861 cut-off events. For 2385/2400 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5764 event pairs, 5 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 2108. Up to 140 conditions per place. [2025-03-15 02:22:20,807 INFO L140 encePairwiseOnDemand]: 228/236 looper letters, 45 selfloop transitions, 10 changer transitions 23/255 dead transitions. [2025-03-15 02:22:20,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 255 transitions, 1389 flow [2025-03-15 02:22:20,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:22:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:22:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-03-15 02:22:20,810 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8467514124293786 [2025-03-15 02:22:20,811 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 18 predicate places. [2025-03-15 02:22:20,812 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 255 transitions, 1389 flow [2025-03-15 02:22:20,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have 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:22:20,812 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:20,812 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:22:20,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:22:20,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:20,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:20,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1907537131, now seen corresponding path program 1 times [2025-03-15 02:22:20,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:20,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55041029] [2025-03-15 02:22:20,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:20,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:20,909 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:22:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55041029] [2025-03-15 02:22:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55041029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:20,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:22:20,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357281244] [2025-03-15 02:22:20,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:20,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:22:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:22:20,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:22:20,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 236 [2025-03-15 02:22:20,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 255 transitions, 1389 flow. Second operand has 8 states, 8 states have (on average 191.125) internal successors, (1529), 8 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have 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:22:20,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:20,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 236 [2025-03-15 02:22:20,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:21,106 INFO L124 PetriNetUnfolderBase]: 157/863 cut-off events. [2025-03-15 02:22:21,106 INFO L125 PetriNetUnfolderBase]: For 3078/3095 co-relation queries the response was YES. [2025-03-15 02:22:21,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3000 conditions, 863 events. 157/863 cut-off events. For 3078/3095 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5807 event pairs, 5 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 2331. Up to 140 conditions per place. [2025-03-15 02:22:21,115 INFO L140 encePairwiseOnDemand]: 224/236 looper letters, 50 selfloop transitions, 14 changer transitions 23/260 dead transitions. [2025-03-15 02:22:21,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 260 transitions, 1600 flow [2025-03-15 02:22:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:22:21,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:22:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1559 transitions. [2025-03-15 02:22:21,117 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8257415254237288 [2025-03-15 02:22:21,118 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 25 predicate places. [2025-03-15 02:22:21,118 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 260 transitions, 1600 flow [2025-03-15 02:22:21,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 191.125) internal successors, (1529), 8 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have 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:22:21,119 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:21,119 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:22:21,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:22:21,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:21,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:21,120 INFO L85 PathProgramCache]: Analyzing trace with hash 629721368, now seen corresponding path program 1 times [2025-03-15 02:22:21,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:21,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484540217] [2025-03-15 02:22:21,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:21,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:21,168 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:22:21,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:21,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484540217] [2025-03-15 02:22:21,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484540217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:21,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:21,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:22:21,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91904688] [2025-03-15 02:22:21,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:21,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:22:21,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:21,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:22:21,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:22:21,170 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 236 [2025-03-15 02:22:21,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 260 transitions, 1600 flow. Second operand has 4 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have 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:22:21,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:21,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 236 [2025-03-15 02:22:21,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:21,324 INFO L124 PetriNetUnfolderBase]: 153/859 cut-off events. [2025-03-15 02:22:21,324 INFO L125 PetriNetUnfolderBase]: For 3502/3521 co-relation queries the response was YES. [2025-03-15 02:22:21,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3183 conditions, 859 events. 153/859 cut-off events. For 3502/3521 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5795 event pairs, 5 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 2451. Up to 136 conditions per place. [2025-03-15 02:22:21,341 INFO L140 encePairwiseOnDemand]: 231/236 looper letters, 49 selfloop transitions, 4 changer transitions 23/262 dead transitions. [2025-03-15 02:22:21,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 262 transitions, 1769 flow [2025-03-15 02:22:21,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:22:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:22:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 838 transitions. [2025-03-15 02:22:21,343 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8877118644067796 [2025-03-15 02:22:21,344 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 28 predicate places. [2025-03-15 02:22:21,344 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 262 transitions, 1769 flow [2025-03-15 02:22:21,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have 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:22:21,345 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:21,345 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:22:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:22:21,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash -995890438, now seen corresponding path program 1 times [2025-03-15 02:22:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165720861] [2025-03-15 02:22:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:21,462 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:22:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165720861] [2025-03-15 02:22:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165720861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:21,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:22:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220869407] [2025-03-15 02:22:21,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:21,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:22:21,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:21,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:22:21,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:22:21,463 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 236 [2025-03-15 02:22:21,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 262 transitions, 1769 flow. Second operand has 8 states, 8 states have (on average 191.25) internal successors, (1530), 8 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have 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:22:21,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:21,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 236 [2025-03-15 02:22:21,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:21,674 INFO L124 PetriNetUnfolderBase]: 163/873 cut-off events. [2025-03-15 02:22:21,675 INFO L125 PetriNetUnfolderBase]: For 4375/4396 co-relation queries the response was YES. [2025-03-15 02:22:21,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3564 conditions, 873 events. 163/873 cut-off events. For 4375/4396 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5855 event pairs, 5 based on Foata normal form. 0/778 useless extension candidates. Maximal degree in co-relation 2789. Up to 148 conditions per place. [2025-03-15 02:22:21,689 INFO L140 encePairwiseOnDemand]: 224/236 looper letters, 63 selfloop transitions, 16 changer transitions 23/271 dead transitions. [2025-03-15 02:22:21,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 271 transitions, 2091 flow [2025-03-15 02:22:21,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:22:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:22:21,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1559 transitions. [2025-03-15 02:22:21,694 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8257415254237288 [2025-03-15 02:22:21,694 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 35 predicate places. [2025-03-15 02:22:21,694 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 271 transitions, 2091 flow [2025-03-15 02:22:21,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 191.25) internal successors, (1530), 8 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have 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:22:21,695 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:21,695 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:22:21,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:22:21,696 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -145450443, now seen corresponding path program 1 times [2025-03-15 02:22:21,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:21,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161663361] [2025-03-15 02:22:21,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:21,845 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:22:21,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:21,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161663361] [2025-03-15 02:22:21,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161663361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:21,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:21,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:21,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672974779] [2025-03-15 02:22:21,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:21,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:21,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:21,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:21,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:21,847 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 236 [2025-03-15 02:22:21,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 271 transitions, 2091 flow. Second operand has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have 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:22:21,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:21,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 236 [2025-03-15 02:22:21,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:22,060 INFO L124 PetriNetUnfolderBase]: 191/897 cut-off events. [2025-03-15 02:22:22,060 INFO L125 PetriNetUnfolderBase]: For 7324/7347 co-relation queries the response was YES. [2025-03-15 02:22:22,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 897 events. 191/897 cut-off events. For 7324/7347 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6057 event pairs, 5 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 3473. Up to 192 conditions per place. [2025-03-15 02:22:22,070 INFO L140 encePairwiseOnDemand]: 227/236 looper letters, 80 selfloop transitions, 10 changer transitions 23/290 dead transitions. [2025-03-15 02:22:22,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 290 transitions, 2497 flow [2025-03-15 02:22:22,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:22:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:22:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1362 transitions. [2025-03-15 02:22:22,073 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8244552058111381 [2025-03-15 02:22:22,074 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 40 predicate places. [2025-03-15 02:22:22,074 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 290 transitions, 2497 flow [2025-03-15 02:22:22,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.0) internal successors, (1140), 6 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have 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:22:22,074 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:22,074 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:22:22,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 02:22:22,074 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:22,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:22,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1307011047, now seen corresponding path program 1 times [2025-03-15 02:22:22,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951205862] [2025-03-15 02:22:22,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:22,126 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:22:22,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:22,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951205862] [2025-03-15 02:22:22,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951205862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:22,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:22,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:22:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633964482] [2025-03-15 02:22:22,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:22,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:22:22,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:22,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:22:22,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:22:22,128 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 236 [2025-03-15 02:22:22,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 290 transitions, 2497 flow. Second operand has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have 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:22:22,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:22,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 236 [2025-03-15 02:22:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:22,293 INFO L124 PetriNetUnfolderBase]: 211/973 cut-off events. [2025-03-15 02:22:22,293 INFO L125 PetriNetUnfolderBase]: For 9716/9741 co-relation queries the response was YES. [2025-03-15 02:22:22,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4945 conditions, 973 events. 211/973 cut-off events. For 9716/9741 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6868 event pairs, 5 based on Foata normal form. 4/874 useless extension candidates. Maximal degree in co-relation 3799. Up to 207 conditions per place. [2025-03-15 02:22:22,305 INFO L140 encePairwiseOnDemand]: 231/236 looper letters, 68 selfloop transitions, 5 changer transitions 24/301 dead transitions. [2025-03-15 02:22:22,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 301 transitions, 2817 flow [2025-03-15 02:22:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:22:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:22:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 835 transitions. [2025-03-15 02:22:22,308 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8845338983050848 [2025-03-15 02:22:22,308 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 42 predicate places. [2025-03-15 02:22:22,308 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 301 transitions, 2817 flow [2025-03-15 02:22:22,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have 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:22:22,309 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:22,309 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:22:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:22:22,309 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:22,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:22,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1586781849, now seen corresponding path program 1 times [2025-03-15 02:22:22,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:22,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962927739] [2025-03-15 02:22:22,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:22,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:22:22,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:22,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962927739] [2025-03-15 02:22:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962927739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:22,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:22,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827989089] [2025-03-15 02:22:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:22,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:22,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:22,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:22,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:22,417 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 236 [2025-03-15 02:22:22,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 301 transitions, 2817 flow. Second operand has 6 states, 6 states have (on average 190.16666666666666) internal successors, (1141), 6 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have 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:22:22,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:22,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 236 [2025-03-15 02:22:22,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:22,640 INFO L124 PetriNetUnfolderBase]: 209/967 cut-off events. [2025-03-15 02:22:22,641 INFO L125 PetriNetUnfolderBase]: For 10519/10546 co-relation queries the response was YES. [2025-03-15 02:22:22,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5257 conditions, 967 events. 209/967 cut-off events. For 10519/10546 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6898 event pairs, 5 based on Foata normal form. 0/868 useless extension candidates. Maximal degree in co-relation 4060. Up to 262 conditions per place. [2025-03-15 02:22:22,655 INFO L140 encePairwiseOnDemand]: 227/236 looper letters, 97 selfloop transitions, 12 changer transitions 24/315 dead transitions. [2025-03-15 02:22:22,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 315 transitions, 3324 flow [2025-03-15 02:22:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:22:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:22:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1354 transitions. [2025-03-15 02:22:22,658 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8196125907990315 [2025-03-15 02:22:22,659 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 47 predicate places. [2025-03-15 02:22:22,659 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 315 transitions, 3324 flow [2025-03-15 02:22:22,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.16666666666666) internal successors, (1141), 6 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have 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:22:22,660 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:22,660 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:22:22,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 02:22:22,660 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:22,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:22,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1431946051, now seen corresponding path program 1 times [2025-03-15 02:22:22,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:22,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431247765] [2025-03-15 02:22:22,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:22,756 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:22:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431247765] [2025-03-15 02:22:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431247765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:22,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:22:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390733127] [2025-03-15 02:22:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:22,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:22:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:22,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:22:22,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:22:22,758 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 236 [2025-03-15 02:22:22,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 315 transitions, 3324 flow. Second operand has 8 states, 8 states have (on average 191.25) internal successors, (1530), 8 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have 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:22:22,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:22,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 236 [2025-03-15 02:22:22,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:22,987 INFO L124 PetriNetUnfolderBase]: 213/963 cut-off events. [2025-03-15 02:22:22,987 INFO L125 PetriNetUnfolderBase]: For 11998/12027 co-relation queries the response was YES. [2025-03-15 02:22:22,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5572 conditions, 963 events. 213/963 cut-off events. For 11998/12027 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6885 event pairs, 5 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 4310. Up to 261 conditions per place. [2025-03-15 02:22:23,000 INFO L140 encePairwiseOnDemand]: 224/236 looper letters, 85 selfloop transitions, 22 changer transitions 24/319 dead transitions. [2025-03-15 02:22:23,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 319 transitions, 3659 flow [2025-03-15 02:22:23,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:22:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:22:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1560 transitions. [2025-03-15 02:22:23,003 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.826271186440678 [2025-03-15 02:22:23,004 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 54 predicate places. [2025-03-15 02:22:23,004 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 319 transitions, 3659 flow [2025-03-15 02:22:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 191.25) internal successors, (1530), 8 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have 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:22:23,005 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:23,005 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:22:23,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:22:23,005 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:23,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1440653903, now seen corresponding path program 1 times [2025-03-15 02:22:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728831477] [2025-03-15 02:22:23,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:23,095 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:22:23,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:23,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728831477] [2025-03-15 02:22:23,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728831477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:23,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:23,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:22:23,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311554305] [2025-03-15 02:22:23,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:23,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:22:23,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:23,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:22:23,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:22:23,096 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 236 [2025-03-15 02:22:23,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 319 transitions, 3659 flow. Second operand has 8 states, 8 states have (on average 191.375) internal successors, (1531), 8 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have 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:22:23,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:23,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 236 [2025-03-15 02:22:23,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:23,350 INFO L124 PetriNetUnfolderBase]: 219/961 cut-off events. [2025-03-15 02:22:23,350 INFO L125 PetriNetUnfolderBase]: For 13526/13557 co-relation queries the response was YES. [2025-03-15 02:22:23,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5904 conditions, 961 events. 219/961 cut-off events. For 13526/13557 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6790 event pairs, 5 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 4597. Up to 259 conditions per place. [2025-03-15 02:22:23,361 INFO L140 encePairwiseOnDemand]: 224/236 looper letters, 88 selfloop transitions, 23 changer transitions 28/327 dead transitions. [2025-03-15 02:22:23,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 327 transitions, 4139 flow [2025-03-15 02:22:23,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:22:23,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:22:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1559 transitions. [2025-03-15 02:22:23,364 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8257415254237288 [2025-03-15 02:22:23,365 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 61 predicate places. [2025-03-15 02:22:23,365 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 327 transitions, 4139 flow [2025-03-15 02:22:23,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 191.375) internal successors, (1531), 8 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have 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:22:23,365 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:23,366 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] [2025-03-15 02:22:23,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:22:23,366 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:23,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1933591628, now seen corresponding path program 1 times [2025-03-15 02:22:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:23,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934917008] [2025-03-15 02:22:23,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:23,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:23,448 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:22:23,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:23,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934917008] [2025-03-15 02:22:23,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934917008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:23,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:23,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:23,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076302080] [2025-03-15 02:22:23,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:23,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:23,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:23,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:23,450 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 236 [2025-03-15 02:22:23,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 327 transitions, 4139 flow. Second operand has 6 states, 6 states have (on average 190.16666666666666) internal successors, (1141), 6 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have 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:22:23,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:23,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 236 [2025-03-15 02:22:23,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:23,660 INFO L124 PetriNetUnfolderBase]: 247/985 cut-off events. [2025-03-15 02:22:23,660 INFO L125 PetriNetUnfolderBase]: For 19921/19954 co-relation queries the response was YES. [2025-03-15 02:22:23,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6790 conditions, 985 events. 247/985 cut-off events. For 19921/19954 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7422 event pairs, 5 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 4827. Up to 288 conditions per place. [2025-03-15 02:22:23,671 INFO L140 encePairwiseOnDemand]: 227/236 looper letters, 94 selfloop transitions, 11 changer transitions 41/347 dead transitions. [2025-03-15 02:22:23,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 347 transitions, 4697 flow [2025-03-15 02:22:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:22:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:22:23,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1363 transitions. [2025-03-15 02:22:23,673 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8250605326876513 [2025-03-15 02:22:23,674 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 66 predicate places. [2025-03-15 02:22:23,674 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 347 transitions, 4697 flow [2025-03-15 02:22:23,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.16666666666666) internal successors, (1141), 6 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have 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:22:23,674 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:22:23,674 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:22:23,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:22:23,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 23 more)] === [2025-03-15 02:22:23,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:22:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1560987015, now seen corresponding path program 1 times [2025-03-15 02:22:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:22:23,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773138789] [2025-03-15 02:22:23,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:22:23,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:22:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:22:23,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:22:23,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:22:23,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773138789] [2025-03-15 02:22:23,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773138789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:22:23,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:22:23,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:22:23,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053534520] [2025-03-15 02:22:23,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:22:23,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:22:23,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:22:23,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:22:23,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:22:23,747 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 236 [2025-03-15 02:22:23,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 347 transitions, 4697 flow. Second operand has 6 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have 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:22:23,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:22:23,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 236 [2025-03-15 02:22:23,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:22:23,964 INFO L124 PetriNetUnfolderBase]: 245/979 cut-off events. [2025-03-15 02:22:23,965 INFO L125 PetriNetUnfolderBase]: For 21169/21204 co-relation queries the response was YES. [2025-03-15 02:22:23,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 979 events. 245/979 cut-off events. For 21169/21204 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7355 event pairs, 5 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 5060. Up to 287 conditions per place. [2025-03-15 02:22:23,972 INFO L140 encePairwiseOnDemand]: 227/236 looper letters, 0 selfloop transitions, 0 changer transitions 359/359 dead transitions. [2025-03-15 02:22:23,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 359 transitions, 5248 flow [2025-03-15 02:22:23,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:22:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:22:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1354 transitions. [2025-03-15 02:22:23,974 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8196125907990315 [2025-03-15 02:22:23,974 INFO L298 CegarLoopForPetriNet]: 224 programPoint places, 71 predicate places. [2025-03-15 02:22:23,974 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 359 transitions, 5248 flow [2025-03-15 02:22:23,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.33333333333334) internal successors, (1142), 6 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have 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:22:23,979 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-file-item-symm.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 02:22:24,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2025-03-15 02:22:24,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 26 remaining) [2025-03-15 02:22:24,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 26 remaining) [2025-03-15 02:22:24,021 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2025-03-15 02:22:24,022 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2025-03-15 02:22:24,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2025-03-15 02:22:24,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2025-03-15 02:22:24,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2025-03-15 02:22:24,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2025-03-15 02:22:24,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2025-03-15 02:22:24,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2025-03-15 02:22:24,023 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2025-03-15 02:22:24,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 02:22:24,023 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:22:24,029 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:22:24,029 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:22:24,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:22:24 BasicIcfg [2025-03-15 02:22:24,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:22:24,035 INFO L158 Benchmark]: Toolchain (without parser) took 6715.93ms. Allocated memory was 71.3MB in the beginning and 230.7MB in the end (delta: 159.4MB). Free memory was 44.4MB in the beginning and 117.6MB in the end (delta: -73.2MB). Peak memory consumption was 158.8MB. Max. memory is 8.0GB. [2025-03-15 02:22:24,035 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 71.3MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:22:24,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.83ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 32.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 02:22:24,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.35ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 31.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:22:24,036 INFO L158 Benchmark]: Boogie Preprocessor took 28.47ms. Allocated memory is still 71.3MB. Free memory was 30.9MB in the beginning and 29.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:22:24,036 INFO L158 Benchmark]: RCFGBuilder took 455.09ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 37.6MB in the end (delta: -7.8MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. [2025-03-15 02:22:24,036 INFO L158 Benchmark]: TraceAbstraction took 6012.55ms. Allocated memory was 71.3MB in the beginning and 230.7MB in the end (delta: 159.4MB). Free memory was 36.6MB in the beginning and 117.6MB in the end (delta: -81.0MB). Peak memory consumption was 151.8MB. Max. memory is 8.0GB. [2025-03-15 02:22:24,037 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.24ms. Allocated memory is still 71.3MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.83ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 32.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.35ms. Allocated memory is still 71.3MB. Free memory was 32.7MB in the beginning and 31.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.47ms. Allocated memory is still 71.3MB. Free memory was 30.9MB in the beginning and 29.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 455.09ms. Allocated memory is still 71.3MB. Free memory was 29.8MB in the beginning and 37.6MB in the end (delta: -7.8MB). Peak memory consumption was 15.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6012.55ms. Allocated memory was 71.3MB in the beginning and 230.7MB in the end (delta: 159.4MB). Free memory was 36.6MB in the beginning and 117.6MB in the end (delta: -81.0MB). Peak memory consumption was 151.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 80]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 82]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 352 locations, 26 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: 5.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 846 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 846 mSDsluCounter, 643 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 327 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1450 IncrementalHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 316 mSDtfsCounter, 1450 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5248occurred in iteration=18, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1308 ConstructedInterpolants, 0 QuantifiedInterpolants, 2964 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 02:22:24,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...