/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/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:35:46,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:35:46,990 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:35:47,037 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:35:47,038 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:35:47,038 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:35:47,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:35:47,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:35:47,048 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:35:47,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:35:47,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:35:47,048 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:35:47,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:35:47,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:35:47,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:35:47,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:35:47,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:35:47,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:35:47,050 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:35:47,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:35:47,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:35:47,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:35:47,050 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:35:47,050 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:35:47,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:35:47,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:35:47,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:35:47,283 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:35:47,284 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:35:47,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-03-15 02:35:48,455 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe822348/908e4ec988c546ebb426690df098cef1/FLAGd0db40d71 [2025-03-15 02:35:48,647 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:35:48,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2025-03-15 02:35:48,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe822348/908e4ec988c546ebb426690df098cef1/FLAGd0db40d71 [2025-03-15 02:35:48,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbe822348/908e4ec988c546ebb426690df098cef1 [2025-03-15 02:35:48,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:35:48,677 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:35:48,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:35:48,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:35:48,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:35:48,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7a568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48, skipping insertion in model container [2025-03-15 02:35:48,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:35:48,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:35:48,846 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:35:48,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:35:48,887 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:35:48,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48 WrapperNode [2025-03-15 02:35:48,887 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:35:48,888 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:35:48,888 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:35:48,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:35:48,892 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:35:48" (1/1) ... [2025-03-15 02:35:48,903 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:35:48" (1/1) ... [2025-03-15 02:35:48,933 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 388 [2025-03-15 02:35:48,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:35:48,934 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:35:48,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:35:48,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:35:48,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,961 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,962 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,965 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:35:48,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:35:48,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:35:48,982 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:35:48,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (1/1) ... [2025-03-15 02:35:48,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:35:49,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:35:49,013 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:35:49,019 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:35:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:35:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:35:49,038 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:35:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:35:49,039 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:35:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:35:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:35:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:35:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:35:49,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:35:49,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:35:49,040 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:35:49,138 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:35:49,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:35:49,617 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:35:49,617 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:35:49,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:35:49,644 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:35:49,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:35:49 BoogieIcfgContainer [2025-03-15 02:35:49,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:35:49,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:35:49,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:35:49,653 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:35:49,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:35:48" (1/3) ... [2025-03-15 02:35:49,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff9c830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:35:49, skipping insertion in model container [2025-03-15 02:35:49,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:48" (2/3) ... [2025-03-15 02:35:49,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff9c830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:35:49, skipping insertion in model container [2025-03-15 02:35:49,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:35:49" (3/3) ... [2025-03-15 02:35:49,655 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-03-15 02:35:49,688 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:35:49,689 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 544 locations, 1 initial locations, 3 loop locations, and 54 error locations. [2025-03-15 02:35:49,690 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:35:49,812 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:35:49,853 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:35:49,867 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;@7c7460ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:35:49,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2025-03-15 02:35:49,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:35:49,906 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2025-03-15 02:35:49,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:35:49,907 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:49,908 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:49,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 400375431, now seen corresponding path program 1 times [2025-03-15 02:35:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260899939] [2025-03-15 02:35:49,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:49,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:50,206 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:35:50,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:50,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260899939] [2025-03-15 02:35:50,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260899939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:50,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:35:50,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619168914] [2025-03-15 02:35:50,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:35:50,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:50,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:35:50,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:35:50,245 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 584 [2025-03-15 02:35:50,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 584 transitions, 1182 flow. Second operand has 4 states, 4 states have (on average 546.5) internal successors, (2186), 4 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:50,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:50,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 584 [2025-03-15 02:35:50,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:50,499 INFO L124 PetriNetUnfolderBase]: 22/567 cut-off events. [2025-03-15 02:35:50,499 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-15 02:35:50,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 567 events. 22/567 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1844 event pairs, 0 based on Foata normal form. 25/496 useless extension candidates. Maximal degree in co-relation 439. Up to 20 conditions per place. [2025-03-15 02:35:50,521 INFO L140 encePairwiseOnDemand]: 556/584 looper letters, 21 selfloop transitions, 5 changer transitions 12/564 dead transitions. [2025-03-15 02:35:50,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 564 transitions, 1194 flow [2025-03-15 02:35:50,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:35:50,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:35:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2775 transitions. [2025-03-15 02:35:50,540 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9503424657534246 [2025-03-15 02:35:50,543 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, -5 predicate places. [2025-03-15 02:35:50,543 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 564 transitions, 1194 flow [2025-03-15 02:35:50,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 546.5) internal successors, (2186), 4 states have internal predecessors, (2186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:50,544 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:50,545 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:50,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:35:50,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:50,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:50,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1984009046, now seen corresponding path program 1 times [2025-03-15 02:35:50,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:50,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146008080] [2025-03-15 02:35:50,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:50,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146008080] [2025-03-15 02:35:50,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146008080] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:35:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272779652] [2025-03-15 02:35:50,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:50,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:35:50,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:35:50,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 02:35:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:50,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:35:50,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:35:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:50,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:35:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272779652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:35:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:35:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196633180] [2025-03-15 02:35:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:50,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:35:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:50,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:35:50,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:35:50,899 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 584 [2025-03-15 02:35:50,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 564 transitions, 1194 flow. Second operand has 6 states, 6 states have (on average 547.1666666666666) internal successors, (3283), 6 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:50,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:50,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 584 [2025-03-15 02:35:50,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:51,076 INFO L124 PetriNetUnfolderBase]: 22/566 cut-off events. [2025-03-15 02:35:51,077 INFO L125 PetriNetUnfolderBase]: For 21/24 co-relation queries the response was YES. [2025-03-15 02:35:51,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 566 events. 22/566 cut-off events. For 21/24 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1842 event pairs, 0 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 440. Up to 19 conditions per place. [2025-03-15 02:35:51,087 INFO L140 encePairwiseOnDemand]: 578/584 looper letters, 17 selfloop transitions, 8 changer transitions 12/563 dead transitions. [2025-03-15 02:35:51,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 563 transitions, 1242 flow [2025-03-15 02:35:51,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:35:51,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:35:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3842 transitions. [2025-03-15 02:35:51,097 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9398238747553816 [2025-03-15 02:35:51,097 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 0 predicate places. [2025-03-15 02:35:51,097 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 563 transitions, 1242 flow [2025-03-15 02:35:51,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 547.1666666666666) internal successors, (3283), 6 states have internal predecessors, (3283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:51,099 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:51,099 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:51,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 02:35:51,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:51,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:51,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1374737489, now seen corresponding path program 1 times [2025-03-15 02:35:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:51,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767863436] [2025-03-15 02:35:51,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:51,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:51,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767863436] [2025-03-15 02:35:51,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767863436] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:35:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084405022] [2025-03-15 02:35:51,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:51,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:51,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:35:51,432 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:35:51,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 02:35:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:51,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:35:51,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:35:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:51,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:35:51,596 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:51,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084405022] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:35:51,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:35:51,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:35:51,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512523082] [2025-03-15 02:35:51,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:35:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:35:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:51,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:35:51,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:35:51,609 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 584 [2025-03-15 02:35:51,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 563 transitions, 1242 flow. Second operand has 12 states, 12 states have (on average 547.8333333333334) internal successors, (6574), 12 states have internal predecessors, (6574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:51,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:51,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 584 [2025-03-15 02:35:51,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:51,812 INFO L124 PetriNetUnfolderBase]: 25/601 cut-off events. [2025-03-15 02:35:51,812 INFO L125 PetriNetUnfolderBase]: For 65/70 co-relation queries the response was YES. [2025-03-15 02:35:51,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 601 events. 25/601 cut-off events. For 65/70 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2084 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 523. Up to 45 conditions per place. [2025-03-15 02:35:51,820 INFO L140 encePairwiseOnDemand]: 577/584 looper letters, 33 selfloop transitions, 18 changer transitions 12/589 dead transitions. [2025-03-15 02:35:51,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 563 places, 589 transitions, 1502 flow [2025-03-15 02:35:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:35:51,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:35:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 7685 transitions. [2025-03-15 02:35:51,830 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9399461839530333 [2025-03-15 02:35:51,831 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 13 predicate places. [2025-03-15 02:35:51,831 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 589 transitions, 1502 flow [2025-03-15 02:35:51,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 547.8333333333334) internal successors, (6574), 12 states have internal predecessors, (6574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:51,834 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:51,834 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:51,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 02:35:52,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-15 02:35:52,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:52,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1650451246, now seen corresponding path program 1 times [2025-03-15 02:35:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:52,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817048349] [2025-03-15 02:35:52,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:52,104 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:35:52,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:52,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817048349] [2025-03-15 02:35:52,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817048349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:52,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:52,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:35:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031159717] [2025-03-15 02:35:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:52,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:35:52,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:52,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:35:52,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:35:52,106 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 584 [2025-03-15 02:35:52,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 589 transitions, 1502 flow. Second operand has 4 states, 4 states have (on average 464.5) internal successors, (1858), 4 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:52,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:52,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 584 [2025-03-15 02:35:52,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:52,519 INFO L124 PetriNetUnfolderBase]: 168/1156 cut-off events. [2025-03-15 02:35:52,519 INFO L125 PetriNetUnfolderBase]: For 1315/1315 co-relation queries the response was YES. [2025-03-15 02:35:52,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2347 conditions, 1156 events. 168/1156 cut-off events. For 1315/1315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 7022 event pairs, 52 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 2015. Up to 188 conditions per place. [2025-03-15 02:35:52,541 INFO L140 encePairwiseOnDemand]: 552/584 looper letters, 121 selfloop transitions, 20 changer transitions 12/631 dead transitions. [2025-03-15 02:35:52,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 631 transitions, 1888 flow [2025-03-15 02:35:52,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:35:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:35:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2006 transitions. [2025-03-15 02:35:52,545 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8587328767123288 [2025-03-15 02:35:52,546 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 12 predicate places. [2025-03-15 02:35:52,546 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 631 transitions, 1888 flow [2025-03-15 02:35:52,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 464.5) internal successors, (1858), 4 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:52,547 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:52,547 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:52,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:35:52,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:52,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash -375617531, now seen corresponding path program 1 times [2025-03-15 02:35:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:52,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030810178] [2025-03-15 02:35:52,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:52,661 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:35:52,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:52,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030810178] [2025-03-15 02:35:52,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030810178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:52,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:52,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:35:52,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899008448] [2025-03-15 02:35:52,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:52,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:35:52,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:52,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:35:52,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:35:52,663 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 584 [2025-03-15 02:35:52,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 631 transitions, 1888 flow. Second operand has 6 states, 6 states have (on average 463.3333333333333) internal successors, (2780), 6 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:52,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:52,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 584 [2025-03-15 02:35:52,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:53,524 INFO L124 PetriNetUnfolderBase]: 409/2996 cut-off events. [2025-03-15 02:35:53,524 INFO L125 PetriNetUnfolderBase]: For 3762/4214 co-relation queries the response was YES. [2025-03-15 02:35:53,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6461 conditions, 2996 events. 409/2996 cut-off events. For 3762/4214 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 22688 event pairs, 30 based on Foata normal form. 2/2499 useless extension candidates. Maximal degree in co-relation 6096. Up to 477 conditions per place. [2025-03-15 02:35:53,574 INFO L140 encePairwiseOnDemand]: 559/584 looper letters, 267 selfloop transitions, 33 changer transitions 13/798 dead transitions. [2025-03-15 02:35:53,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 798 transitions, 3239 flow [2025-03-15 02:35:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:35:53,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:35:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3914 transitions. [2025-03-15 02:35:53,580 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8377568493150684 [2025-03-15 02:35:53,580 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 19 predicate places. [2025-03-15 02:35:53,580 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 798 transitions, 3239 flow [2025-03-15 02:35:53,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 463.3333333333333) internal successors, (2780), 6 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:53,582 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:53,582 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:53,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:35:53,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:53,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash 99738997, now seen corresponding path program 1 times [2025-03-15 02:35:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092512562] [2025-03-15 02:35:53,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:53,737 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:35:53,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:53,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092512562] [2025-03-15 02:35:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092512562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:53,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:35:53,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869349025] [2025-03-15 02:35:53,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:53,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:35:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:53,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:35:53,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:35:53,740 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 505 out of 584 [2025-03-15 02:35:53,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 798 transitions, 3239 flow. Second operand has 9 states, 9 states have (on average 508.77777777777777) internal successors, (4579), 9 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:53,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:53,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 505 of 584 [2025-03-15 02:35:53,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:54,560 INFO L124 PetriNetUnfolderBase]: 555/4775 cut-off events. [2025-03-15 02:35:54,561 INFO L125 PetriNetUnfolderBase]: For 6478/6485 co-relation queries the response was YES. [2025-03-15 02:35:54,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10343 conditions, 4775 events. 555/4775 cut-off events. For 6478/6485 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41058 event pairs, 62 based on Foata normal form. 1/3939 useless extension candidates. Maximal degree in co-relation 8298. Up to 827 conditions per place. [2025-03-15 02:35:54,612 INFO L140 encePairwiseOnDemand]: 566/584 looper letters, 96 selfloop transitions, 16 changer transitions 22/836 dead transitions. [2025-03-15 02:35:54,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 836 transitions, 3810 flow [2025-03-15 02:35:54,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 02:35:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 02:35:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 7666 transitions. [2025-03-15 02:35:54,626 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8751141552511416 [2025-03-15 02:35:54,627 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 33 predicate places. [2025-03-15 02:35:54,627 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 836 transitions, 3810 flow [2025-03-15 02:35:54,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 508.77777777777777) internal successors, (4579), 9 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:54,629 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:54,630 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:54,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:35:54,630 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:54,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash -332648676, now seen corresponding path program 1 times [2025-03-15 02:35:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494147823] [2025-03-15 02:35:54,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:54,697 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:35:54,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494147823] [2025-03-15 02:35:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494147823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:54,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:35:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443607452] [2025-03-15 02:35:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:35:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:54,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:35:54,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:35:54,700 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 584 [2025-03-15 02:35:54,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 836 transitions, 3810 flow. Second operand has 4 states, 4 states have (on average 464.75) internal successors, (1859), 4 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:54,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:54,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 584 [2025-03-15 02:35:54,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:55,856 INFO L124 PetriNetUnfolderBase]: 966/6111 cut-off events. [2025-03-15 02:35:55,857 INFO L125 PetriNetUnfolderBase]: For 23800/25667 co-relation queries the response was YES. [2025-03-15 02:35:55,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15971 conditions, 6111 events. 966/6111 cut-off events. For 23800/25667 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 63437 event pairs, 218 based on Foata normal form. 1/4879 useless extension candidates. Maximal degree in co-relation 9099. Up to 1199 conditions per place. [2025-03-15 02:35:55,921 INFO L140 encePairwiseOnDemand]: 552/584 looper letters, 153 selfloop transitions, 20 changer transitions 22/882 dead transitions. [2025-03-15 02:35:55,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 882 transitions, 4344 flow [2025-03-15 02:35:55,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:35:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:35:55,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2006 transitions. [2025-03-15 02:35:55,924 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8587328767123288 [2025-03-15 02:35:55,925 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 32 predicate places. [2025-03-15 02:35:55,925 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 882 transitions, 4344 flow [2025-03-15 02:35:55,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 464.75) internal successors, (1859), 4 states have internal predecessors, (1859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:55,926 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:55,926 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:55,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:35:55,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:55,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:55,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1722172747, now seen corresponding path program 1 times [2025-03-15 02:35:55,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:55,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776724324] [2025-03-15 02:35:55,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:56,012 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:35:56,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:56,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776724324] [2025-03-15 02:35:56,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776724324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:56,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:56,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:35:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455939498] [2025-03-15 02:35:56,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:56,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:35:56,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:56,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:35:56,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:35:56,015 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 584 [2025-03-15 02:35:56,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 882 transitions, 4344 flow. Second operand has 6 states, 6 states have (on average 463.5) internal successors, (2781), 6 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:56,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:56,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 584 [2025-03-15 02:35:56,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:58,386 INFO L124 PetriNetUnfolderBase]: 1628/9935 cut-off events. [2025-03-15 02:35:58,386 INFO L125 PetriNetUnfolderBase]: For 77127/134418 co-relation queries the response was YES. [2025-03-15 02:35:58,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28947 conditions, 9935 events. 1628/9935 cut-off events. For 77127/134418 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 112213 event pairs, 267 based on Foata normal form. 40/7815 useless extension candidates. Maximal degree in co-relation 16700. Up to 2138 conditions per place. [2025-03-15 02:35:58,517 INFO L140 encePairwiseOnDemand]: 559/584 looper letters, 317 selfloop transitions, 33 changer transitions 25/1068 dead transitions. [2025-03-15 02:35:58,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 1068 transitions, 6230 flow [2025-03-15 02:35:58,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:35:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:35:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3913 transitions. [2025-03-15 02:35:58,522 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.837542808219178 [2025-03-15 02:35:58,523 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 39 predicate places. [2025-03-15 02:35:58,523 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 1068 transitions, 6230 flow [2025-03-15 02:35:58,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 463.5) internal successors, (2781), 6 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:58,524 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:58,524 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:58,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:35:58,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:35:58,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:58,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1306200483, now seen corresponding path program 1 times [2025-03-15 02:35:58,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:58,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758405430] [2025-03-15 02:35:58,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:58,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:58,686 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:35:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758405430] [2025-03-15 02:35:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758405430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:58,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:35:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573141979] [2025-03-15 02:35:58,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:58,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:35:58,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:58,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:35:58,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:35:58,690 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 505 out of 584 [2025-03-15 02:35:58,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 1068 transitions, 6230 flow. Second operand has 9 states, 9 states have (on average 508.8888888888889) internal successors, (4580), 9 states have internal predecessors, (4580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:58,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:58,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 505 of 584 [2025-03-15 02:35:58,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:00,863 INFO L124 PetriNetUnfolderBase]: 1465/11356 cut-off events. [2025-03-15 02:36:00,863 INFO L125 PetriNetUnfolderBase]: For 389435/503336 co-relation queries the response was YES. [2025-03-15 02:36:01,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30732 conditions, 11356 events. 1465/11356 cut-off events. For 389435/503336 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 133396 event pairs, 197 based on Foata normal form. 18/9248 useless extension candidates. Maximal degree in co-relation 19032. Up to 2112 conditions per place. [2025-03-15 02:36:01,077 INFO L140 encePairwiseOnDemand]: 566/584 looper letters, 140 selfloop transitions, 17 changer transitions 24/1079 dead transitions. [2025-03-15 02:36:01,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 1079 transitions, 6804 flow [2025-03-15 02:36:01,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 02:36:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 02:36:01,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 7665 transitions. [2025-03-15 02:36:01,087 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-03-15 02:36:01,091 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 53 predicate places. [2025-03-15 02:36:01,091 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 1079 transitions, 6804 flow [2025-03-15 02:36:01,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 508.8888888888889) internal successors, (4580), 9 states have internal predecessors, (4580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:01,097 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:01,097 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:01,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:36:01,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:36:01,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:01,098 INFO L85 PathProgramCache]: Analyzing trace with hash -541572365, now seen corresponding path program 1 times [2025-03-15 02:36:01,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:01,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542073301] [2025-03-15 02:36:01,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:01,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:01,184 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:36:01,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:01,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542073301] [2025-03-15 02:36:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542073301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:01,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:01,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:36:01,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721347444] [2025-03-15 02:36:01,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:01,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:01,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:01,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:01,187 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 584 [2025-03-15 02:36:01,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 1079 transitions, 6804 flow. Second operand has 6 states, 6 states have (on average 463.3333333333333) internal successors, (2780), 6 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:01,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:01,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 584 [2025-03-15 02:36:01,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:03,640 INFO L124 PetriNetUnfolderBase]: 1442/10773 cut-off events. [2025-03-15 02:36:03,641 INFO L125 PetriNetUnfolderBase]: For 242226/535795 co-relation queries the response was YES. [2025-03-15 02:36:03,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32014 conditions, 10773 events. 1442/10773 cut-off events. For 242226/535795 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 124176 event pairs, 253 based on Foata normal form. 610/9339 useless extension candidates. Maximal degree in co-relation 24073. Up to 1968 conditions per place. [2025-03-15 02:36:04,027 INFO L140 encePairwiseOnDemand]: 561/584 looper letters, 329 selfloop transitions, 33 changer transitions 24/1080 dead transitions. [2025-03-15 02:36:04,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 1080 transitions, 7595 flow [2025-03-15 02:36:04,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:36:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:36:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3876 transitions. [2025-03-15 02:36:04,033 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8296232876712328 [2025-03-15 02:36:04,033 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 60 predicate places. [2025-03-15 02:36:04,033 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 1080 transitions, 7595 flow [2025-03-15 02:36:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 463.3333333333333) internal successors, (2780), 6 states have internal predecessors, (2780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:04,035 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:04,035 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:36:04,036 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:36:04,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:04,036 INFO L85 PathProgramCache]: Analyzing trace with hash 391127298, now seen corresponding path program 1 times [2025-03-15 02:36:04,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:04,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598190520] [2025-03-15 02:36:04,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:04,087 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:36:04,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:04,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598190520] [2025-03-15 02:36:04,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598190520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:04,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:04,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:04,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350942854] [2025-03-15 02:36:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:04,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:04,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:04,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:04,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:04,089 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 584 [2025-03-15 02:36:04,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 1080 transitions, 7595 flow. Second operand has 4 states, 4 states have (on average 465.5) internal successors, (1862), 4 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:04,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:04,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 584 [2025-03-15 02:36:04,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:06,328 INFO L124 PetriNetUnfolderBase]: 1398/10586 cut-off events. [2025-03-15 02:36:06,328 INFO L125 PetriNetUnfolderBase]: For 297079/864593 co-relation queries the response was YES. [2025-03-15 02:36:06,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33959 conditions, 10586 events. 1398/10586 cut-off events. For 297079/864593 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 123177 event pairs, 183 based on Foata normal form. 881/9521 useless extension candidates. Maximal degree in co-relation 20751. Up to 1968 conditions per place. [2025-03-15 02:36:06,562 INFO L140 encePairwiseOnDemand]: 564/584 looper letters, 337 selfloop transitions, 34 changer transitions 24/1093 dead transitions. [2025-03-15 02:36:06,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 1093 transitions, 8808 flow [2025-03-15 02:36:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1994 transitions. [2025-03-15 02:36:06,566 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.853595890410959 [2025-03-15 02:36:06,566 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 63 predicate places. [2025-03-15 02:36:06,566 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 1093 transitions, 8808 flow [2025-03-15 02:36:06,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 465.5) internal successors, (1862), 4 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:06,567 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:06,567 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:06,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:36:06,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:36:06,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:06,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1026326542, now seen corresponding path program 1 times [2025-03-15 02:36:06,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:06,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855658920] [2025-03-15 02:36:06,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:06,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:07,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855658920] [2025-03-15 02:36:07,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855658920] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:36:07,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966168887] [2025-03-15 02:36:07,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:07,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:07,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:07,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:36:07,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 02:36:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:07,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 02:36:07,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:36:07,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:36:07,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:36:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:07,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:36:07,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-15 02:36:07,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-15 02:36:07,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:07,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966168887] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:36:07,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:36:07,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 36 [2025-03-15 02:36:07,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363561676] [2025-03-15 02:36:07,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:36:07,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-15 02:36:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:07,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-15 02:36:07,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2025-03-15 02:36:07,861 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 584 [2025-03-15 02:36:07,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 1093 transitions, 8808 flow. Second operand has 37 states, 37 states have (on average 406.8918918918919) internal successors, (15055), 37 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:07,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:07,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 584 [2025-03-15 02:36:07,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:18,593 INFO L124 PetriNetUnfolderBase]: 6710/44424 cut-off events. [2025-03-15 02:36:18,594 INFO L125 PetriNetUnfolderBase]: For 304792/400031 co-relation queries the response was YES. [2025-03-15 02:36:19,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130259 conditions, 44424 events. 6710/44424 cut-off events. For 304792/400031 co-relation queries the response was YES. Maximal size of possible extension queue 1149. Compared 654976 event pairs, 1514 based on Foata normal form. 268/35679 useless extension candidates. Maximal degree in co-relation 61171. Up to 6272 conditions per place. [2025-03-15 02:36:19,222 INFO L140 encePairwiseOnDemand]: 533/584 looper letters, 820 selfloop transitions, 103 changer transitions 43/1582 dead transitions. [2025-03-15 02:36:19,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 1582 transitions, 17066 flow [2025-03-15 02:36:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 02:36:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 02:36:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 13104 transitions. [2025-03-15 02:36:19,233 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7238179407865665 [2025-03-15 02:36:19,234 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 93 predicate places. [2025-03-15 02:36:19,234 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 1582 transitions, 17066 flow [2025-03-15 02:36:19,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 406.8918918918919) internal successors, (15055), 37 states have internal predecessors, (15055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:19,238 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:19,238 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:19,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 02:36:19,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:19,439 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:36:19,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:19,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2069094226, now seen corresponding path program 1 times [2025-03-15 02:36:19,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:19,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063480242] [2025-03-15 02:36:19,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:19,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:19,491 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:36:19,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:19,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063480242] [2025-03-15 02:36:19,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063480242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:19,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931943145] [2025-03-15 02:36:19,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:19,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:19,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:19,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:19,494 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 584 [2025-03-15 02:36:19,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 1582 transitions, 17066 flow. Second operand has 4 states, 4 states have (on average 465.75) internal successors, (1863), 4 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:19,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:19,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 584 [2025-03-15 02:36:19,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:29,226 INFO L124 PetriNetUnfolderBase]: 6765/44298 cut-off events. [2025-03-15 02:36:29,226 INFO L125 PetriNetUnfolderBase]: For 378143/507666 co-relation queries the response was YES. [2025-03-15 02:36:29,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140732 conditions, 44298 events. 6765/44298 cut-off events. For 378143/507666 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 651487 event pairs, 1514 based on Foata normal form. 447/35769 useless extension candidates. Maximal degree in co-relation 64890. Up to 6425 conditions per place. [2025-03-15 02:36:30,108 INFO L140 encePairwiseOnDemand]: 564/584 looper letters, 723 selfloop transitions, 56 changer transitions 43/1615 dead transitions. [2025-03-15 02:36:30,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 1615 transitions, 19655 flow [2025-03-15 02:36:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1982 transitions. [2025-03-15 02:36:30,110 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.848458904109589 [2025-03-15 02:36:30,112 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 92 predicate places. [2025-03-15 02:36:30,112 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 1615 transitions, 19655 flow [2025-03-15 02:36:30,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 465.75) internal successors, (1863), 4 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:30,112 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:30,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:36:30,113 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:36:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1267766435, now seen corresponding path program 1 times [2025-03-15 02:36:30,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:30,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15436660] [2025-03-15 02:36:30,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:30,277 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:36:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15436660] [2025-03-15 02:36:30,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15436660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:30,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:30,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:36:30,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504165775] [2025-03-15 02:36:30,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:30,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:30,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:30,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:30,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:30,281 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 584 [2025-03-15 02:36:30,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 1615 transitions, 19655 flow. Second operand has 6 states, 6 states have (on average 463.5) internal successors, (2781), 6 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:30,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:30,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 584 [2025-03-15 02:36:30,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:41,429 INFO L124 PetriNetUnfolderBase]: 6770/44898 cut-off events. [2025-03-15 02:36:41,430 INFO L125 PetriNetUnfolderBase]: For 328687/505567 co-relation queries the response was YES. [2025-03-15 02:36:41,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152216 conditions, 44898 events. 6770/44898 cut-off events. For 328687/505567 co-relation queries the response was YES. Maximal size of possible extension queue 1155. Compared 663402 event pairs, 1505 based on Foata normal form. 201/36041 useless extension candidates. Maximal degree in co-relation 70536. Up to 6600 conditions per place. [2025-03-15 02:36:42,202 INFO L140 encePairwiseOnDemand]: 561/584 looper letters, 516 selfloop transitions, 33 changer transitions 43/1625 dead transitions. [2025-03-15 02:36:42,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 1625 transitions, 21131 flow [2025-03-15 02:36:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:36:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:36:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 3875 transitions. [2025-03-15 02:36:42,206 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8294092465753424 [2025-03-15 02:36:42,206 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 99 predicate places. [2025-03-15 02:36:42,206 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 1625 transitions, 21131 flow [2025-03-15 02:36:42,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 463.5) internal successors, (2781), 6 states have internal predecessors, (2781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:42,207 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:42,207 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:42,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 02:36:42,207 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:36:42,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash 646055472, now seen corresponding path program 1 times [2025-03-15 02:36:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32127155] [2025-03-15 02:36:42,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:42,261 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:36:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:42,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32127155] [2025-03-15 02:36:42,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32127155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:42,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:42,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:42,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015895565] [2025-03-15 02:36:42,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:42,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:42,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:42,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:42,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:42,264 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 584 [2025-03-15 02:36:42,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 1625 transitions, 21131 flow. Second operand has 4 states, 4 states have (on average 465.75) internal successors, (1863), 4 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:42,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:42,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 584 [2025-03-15 02:36:42,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:53,789 INFO L124 PetriNetUnfolderBase]: 6512/44644 cut-off events. [2025-03-15 02:36:53,789 INFO L125 PetriNetUnfolderBase]: For 378894/688709 co-relation queries the response was YES. [2025-03-15 02:36:54,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162964 conditions, 44644 events. 6512/44644 cut-off events. For 378894/688709 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 663221 event pairs, 1366 based on Foata normal form. 185/36110 useless extension candidates. Maximal degree in co-relation 75762. Up to 6600 conditions per place. [2025-03-15 02:36:54,448 INFO L140 encePairwiseOnDemand]: 564/584 looper letters, 577 selfloop transitions, 34 changer transitions 43/1692 dead transitions. [2025-03-15 02:36:54,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 1692 transitions, 24782 flow [2025-03-15 02:36:54,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:54,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1994 transitions. [2025-03-15 02:36:54,450 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.853595890410959 [2025-03-15 02:36:54,450 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 102 predicate places. [2025-03-15 02:36:54,450 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 1692 transitions, 24782 flow [2025-03-15 02:36:54,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 465.75) internal successors, (1863), 4 states have internal predecessors, (1863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:54,451 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:54,451 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:54,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:36:54,451 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:36:54,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2078726867, now seen corresponding path program 1 times [2025-03-15 02:36:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534838491] [2025-03-15 02:36:54,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:54,537 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:36:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:54,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534838491] [2025-03-15 02:36:54,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534838491] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:54,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:54,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:36:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222785456] [2025-03-15 02:36:54,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:54,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:36:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:54,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:36:54,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:36:54,539 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 584 [2025-03-15 02:36:54,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 1692 transitions, 24782 flow. Second operand has 8 states, 8 states have (on average 442.25) internal successors, (3538), 8 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:54,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:54,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 584 [2025-03-15 02:36:54,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:10,213 INFO L124 PetriNetUnfolderBase]: 8900/59195 cut-off events. [2025-03-15 02:37:10,214 INFO L125 PetriNetUnfolderBase]: For 595736/761681 co-relation queries the response was YES. [2025-03-15 02:37:11,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228954 conditions, 59195 events. 8900/59195 cut-off events. For 595736/761681 co-relation queries the response was YES. Maximal size of possible extension queue 1582. Compared 916656 event pairs, 1846 based on Foata normal form. 1215/49583 useless extension candidates. Maximal degree in co-relation 97935. Up to 8028 conditions per place. [2025-03-15 02:37:11,473 INFO L140 encePairwiseOnDemand]: 551/584 looper letters, 1173 selfloop transitions, 175 changer transitions 43/2127 dead transitions. [2025-03-15 02:37:11,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 2127 transitions, 36363 flow [2025-03-15 02:37:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:37:11,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:37:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5529 transitions. [2025-03-15 02:37:11,476 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7889554794520548 [2025-03-15 02:37:11,476 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 113 predicate places. [2025-03-15 02:37:11,476 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 2127 transitions, 36363 flow [2025-03-15 02:37:11,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 442.25) internal successors, (3538), 8 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:37:11,477 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:11,477 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:11,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:37:11,477 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err25ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:37:11,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:11,478 INFO L85 PathProgramCache]: Analyzing trace with hash -16021982, now seen corresponding path program 1 times [2025-03-15 02:37:11,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:11,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243093554] [2025-03-15 02:37:11,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:11,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:11,556 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:37:11,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:11,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243093554] [2025-03-15 02:37:11,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243093554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:11,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:11,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:37:11,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329997452] [2025-03-15 02:37:11,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:11,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:37:11,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:11,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:37:11,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:37:11,558 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 584 [2025-03-15 02:37:11,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 2127 transitions, 36363 flow. Second operand has 8 states, 8 states have (on average 442.375) internal successors, (3539), 8 states have internal predecessors, (3539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:37:11,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:11,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 584 [2025-03-15 02:37:11,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:29,883 INFO L124 PetriNetUnfolderBase]: 8769/58366 cut-off events. [2025-03-15 02:37:29,884 INFO L125 PetriNetUnfolderBase]: For 725646/869545 co-relation queries the response was YES. [2025-03-15 02:37:30,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240119 conditions, 58366 events. 8769/58366 cut-off events. For 725646/869545 co-relation queries the response was YES. Maximal size of possible extension queue 1561. Compared 901621 event pairs, 1801 based on Foata normal form. 1215/49062 useless extension candidates. Maximal degree in co-relation 102663. Up to 7826 conditions per place. [2025-03-15 02:37:31,416 INFO L140 encePairwiseOnDemand]: 545/584 looper letters, 1214 selfloop transitions, 235 changer transitions 43/2252 dead transitions. [2025-03-15 02:37:31,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 2252 transitions, 43456 flow [2025-03-15 02:37:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:37:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:37:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5527 transitions. [2025-03-15 02:37:31,419 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.788670091324201 [2025-03-15 02:37:31,419 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 124 predicate places. [2025-03-15 02:37:31,419 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 2252 transitions, 43456 flow [2025-03-15 02:37:31,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 442.375) internal successors, (3539), 8 states have internal predecessors, (3539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:37:31,420 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:31,420 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:31,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:37:31,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:37:31,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:31,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1913393760, now seen corresponding path program 1 times [2025-03-15 02:37:31,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:31,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351153194] [2025-03-15 02:37:31,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:32,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351153194] [2025-03-15 02:37:32,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351153194] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:37:32,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023192077] [2025-03-15 02:37:32,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:32,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:32,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:37:32,303 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:37:32,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 02:37:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:32,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-15 02:37:32,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:37:32,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:37:32,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:37:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:32,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:37:32,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-15 02:37:32,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-15 02:37:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023192077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:37:32,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:37:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 41 [2025-03-15 02:37:32,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249104450] [2025-03-15 02:37:32,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:37:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-15 02:37:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:32,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-15 02:37:32,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1589, Unknown=0, NotChecked=0, Total=1722 [2025-03-15 02:37:32,954 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 584 [2025-03-15 02:37:32,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 2252 transitions, 43456 flow. Second operand has 42 states, 42 states have (on average 371.64285714285717) internal successors, (15609), 42 states have internal predecessors, (15609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:37:32,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:32,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 584 [2025-03-15 02:37:32,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:54,115 INFO L124 PetriNetUnfolderBase]: 37715/275386 cut-off events. [2025-03-15 02:38:54,116 INFO L125 PetriNetUnfolderBase]: For 1160538/2010562 co-relation queries the response was YES. [2025-03-15 02:38:57,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174158 conditions, 275386 events. 37715/275386 cut-off events. For 1160538/2010562 co-relation queries the response was YES. Maximal size of possible extension queue 3352. Compared 5075060 event pairs, 7078 based on Foata normal form. 520/225355 useless extension candidates. Maximal degree in co-relation 655324. Up to 65687 conditions per place. [2025-03-15 02:38:59,443 INFO L140 encePairwiseOnDemand]: 521/584 looper letters, 1859 selfloop transitions, 163 changer transitions 57/3186 dead transitions. [2025-03-15 02:38:59,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 3186 transitions, 57380 flow [2025-03-15 02:38:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-15 02:38:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-03-15 02:38:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 18620 transitions. [2025-03-15 02:38:59,453 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6642408675799086 [2025-03-15 02:38:59,453 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 171 predicate places. [2025-03-15 02:38:59,453 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 3186 transitions, 57380 flow [2025-03-15 02:38:59,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 371.64285714285717) internal successors, (15609), 42 states have internal predecessors, (15609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:38:59,456 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:59,456 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:38:59,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 02:38:59,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 02:38:59,657 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:38:59,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:59,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1005821474, now seen corresponding path program 1 times [2025-03-15 02:38:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160952863] [2025-03-15 02:38:59,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:59,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:59,696 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:38:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:59,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160952863] [2025-03-15 02:38:59,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160952863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:38:59,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:38:59,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:38:59,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663860017] [2025-03-15 02:38:59,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:38:59,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:38:59,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:59,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:38:59,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:38:59,698 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 584 [2025-03-15 02:38:59,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 3186 transitions, 57380 flow. Second operand has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:38:59,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:59,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 584 [2025-03-15 02:38:59,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:40:28,204 INFO L124 PetriNetUnfolderBase]: 37236/270612 cut-off events. [2025-03-15 02:40:28,204 INFO L125 PetriNetUnfolderBase]: For 1318584/2150319 co-relation queries the response was YES. [2025-03-15 02:40:31,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1193331 conditions, 270612 events. 37236/270612 cut-off events. For 1318584/2150319 co-relation queries the response was YES. Maximal size of possible extension queue 3320. Compared 4973950 event pairs, 7271 based on Foata normal form. 2369/223188 useless extension candidates. Maximal degree in co-relation 657088. Up to 64631 conditions per place. [2025-03-15 02:40:33,010 INFO L140 encePairwiseOnDemand]: 564/584 looper letters, 1294 selfloop transitions, 68 changer transitions 80/3252 dead transitions. [2025-03-15 02:40:33,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 3252 transitions, 63142 flow [2025-03-15 02:40:33,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:40:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:40:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1982 transitions. [2025-03-15 02:40:33,012 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.848458904109589 [2025-03-15 02:40:33,012 INFO L298 CegarLoopForPetriNet]: 550 programPoint places, 170 predicate places. [2025-03-15 02:40:33,013 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 3252 transitions, 63142 flow [2025-03-15 02:40:33,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 466.0) internal successors, (1864), 4 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:40:33,013 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:40:33,013 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:40:33,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 02:40:33,013 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 105 more)] === [2025-03-15 02:40:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:40:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash 552186841, now seen corresponding path program 1 times [2025-03-15 02:40:33,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:40:33,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261145347] [2025-03-15 02:40:33,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:40:33,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:40:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:40:33,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:40:33,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:40:33,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261145347] [2025-03-15 02:40:33,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261145347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:40:33,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:40:33,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:40:33,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592933511] [2025-03-15 02:40:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:40:33,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:40:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:40:33,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:40:33,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:40:33,097 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 584 [2025-03-15 02:40:33,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 3252 transitions, 63142 flow. Second operand has 6 states, 6 states have (on average 411.0) internal successors, (2466), 6 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:40:33,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:40:33,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 584 [2025-03-15 02:40:33,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand