/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/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 03:10:29,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 03:10:29,926 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 03:10:29,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 03:10:29,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 03:10:29,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 03:10:29,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 03:10:29,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 03:10:29,962 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 03:10:29,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 03:10:29,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 03:10:29,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 03:10:29,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 03:10:29,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 03:10:29,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 03:10:29,964 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 03:10:29,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 03:10:29,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 03:10:29,965 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 03:10:29,965 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 03:10:29,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 03:10:29,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 03:10:29,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 03:10:29,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 03:10:29,965 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 03:10:30,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 03:10:30,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 03:10:30,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 03:10:30,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 03:10:30,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 03:10:30,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2025-03-15 03:10:31,495 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b08182b/bbc8084329084e6eab86d0bba13359bd/FLAGe8f83d23b [2025-03-15 03:10:31,753 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 03:10:31,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2025-03-15 03:10:31,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b08182b/bbc8084329084e6eab86d0bba13359bd/FLAGe8f83d23b [2025-03-15 03:10:31,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41b08182b/bbc8084329084e6eab86d0bba13359bd [2025-03-15 03:10:31,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 03:10:31,786 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 03:10:31,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 03:10:31,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 03:10:31,790 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 03:10:31,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:10:31" (1/1) ... [2025-03-15 03:10:31,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5589df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:31, skipping insertion in model container [2025-03-15 03:10:31,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:10:31" (1/1) ... [2025-03-15 03:10:31,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 03:10:32,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 03:10:32,093 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 03:10:32,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 03:10:32,222 INFO L204 MainTranslator]: Completed translation [2025-03-15 03:10:32,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32 WrapperNode [2025-03-15 03:10:32,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 03:10:32,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 03:10:32,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 03:10:32,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 03:10:32,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,274 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 262 [2025-03-15 03:10:32,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 03:10:32,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 03:10:32,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 03:10:32,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 03:10:32,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 03:10:32,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 03:10:32,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 03:10:32,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 03:10:32,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (1/1) ... [2025-03-15 03:10:32,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 03:10:32,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 03:10:32,353 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 03:10:32,365 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 03:10:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-15 03:10:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 03:10:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 03:10:32,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 03:10:32,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 03:10:32,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 03:10:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 03:10:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 03:10:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 03:10:32,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 03:10:32,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 03:10:32,394 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 03:10:32,518 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 03:10:32,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 03:10:32,889 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 03:10:32,889 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 03:10:32,918 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 03:10:32,918 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 03:10:32,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:10:32 BoogieIcfgContainer [2025-03-15 03:10:32,919 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 03:10:32,921 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 03:10:32,921 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 03:10:32,925 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 03:10:32,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:10:31" (1/3) ... [2025-03-15 03:10:32,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed5083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:10:32, skipping insertion in model container [2025-03-15 03:10:32,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:10:32" (2/3) ... [2025-03-15 03:10:32,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bed5083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:10:32, skipping insertion in model container [2025-03-15 03:10:32,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:10:32" (3/3) ... [2025-03-15 03:10:32,927 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2025-03-15 03:10:32,941 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 03:10:32,942 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_bad.i that has 3 procedures, 326 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-15 03:10:32,943 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 03:10:33,020 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 03:10:33,067 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 03:10:33,079 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;@4e03cf68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 03:10:33,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 03:10:33,178 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 03:10:33,179 INFO L124 PetriNetUnfolderBase]: 1/270 cut-off events. [2025-03-15 03:10:33,181 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 03:10:33,181 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:33,183 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:33,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:33,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:33,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1054234684, now seen corresponding path program 1 times [2025-03-15 03:10:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:33,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822291836] [2025-03-15 03:10:33,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:33,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:33,888 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 03:10:33,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:33,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822291836] [2025-03-15 03:10:33,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822291836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:33,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:33,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:10:33,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768912584] [2025-03-15 03:10:33,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:33,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:10:33,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:33,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:10:33,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:10:33,925 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 332 [2025-03-15 03:10:33,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 332 transitions, 678 flow. Second operand has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:33,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:33,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 332 [2025-03-15 03:10:33,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:34,293 INFO L124 PetriNetUnfolderBase]: 258/914 cut-off events. [2025-03-15 03:10:34,293 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-15 03:10:34,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 914 events. 258/914 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3699 event pairs, 13 based on Foata normal form. 4/807 useless extension candidates. Maximal degree in co-relation 1088. Up to 284 conditions per place. [2025-03-15 03:10:34,307 INFO L140 encePairwiseOnDemand]: 321/332 looper letters, 54 selfloop transitions, 8 changer transitions 13/364 dead transitions. [2025-03-15 03:10:34,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 364 transitions, 885 flow [2025-03-15 03:10:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:10:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:10:34,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1584 transitions. [2025-03-15 03:10:34,327 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9542168674698795 [2025-03-15 03:10:34,330 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 0 predicate places. [2025-03-15 03:10:34,331 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 364 transitions, 885 flow [2025-03-15 03:10:34,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 303.75) internal successors, (1215), 4 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:34,332 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:34,332 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:34,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 03:10:34,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:34,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:34,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1330787606, now seen corresponding path program 1 times [2025-03-15 03:10:34,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:34,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693955187] [2025-03-15 03:10:34,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:34,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:34,611 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 03:10:34,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693955187] [2025-03-15 03:10:34,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693955187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:34,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:34,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:10:34,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528307913] [2025-03-15 03:10:34,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:34,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:10:34,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:34,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:10:34,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:10:34,621 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 332 [2025-03-15 03:10:34,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 364 transitions, 885 flow. Second operand has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:34,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:34,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 332 [2025-03-15 03:10:34,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:35,005 INFO L124 PetriNetUnfolderBase]: 443/1331 cut-off events. [2025-03-15 03:10:35,005 INFO L125 PetriNetUnfolderBase]: For 393/420 co-relation queries the response was YES. [2025-03-15 03:10:35,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 1331 events. 443/1331 cut-off events. For 393/420 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6384 event pairs, 66 based on Foata normal form. 13/1172 useless extension candidates. Maximal degree in co-relation 2315. Up to 413 conditions per place. [2025-03-15 03:10:35,019 INFO L140 encePairwiseOnDemand]: 325/332 looper letters, 73 selfloop transitions, 4 changer transitions 12/401 dead transitions. [2025-03-15 03:10:35,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 401 transitions, 1188 flow [2025-03-15 03:10:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:10:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:10:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1579 transitions. [2025-03-15 03:10:35,030 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9512048192771084 [2025-03-15 03:10:35,031 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 4 predicate places. [2025-03-15 03:10:35,031 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 401 transitions, 1188 flow [2025-03-15 03:10:35,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:35,032 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:35,032 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:35,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 03:10:35,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:35,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:35,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1207818536, now seen corresponding path program 1 times [2025-03-15 03:10:35,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:35,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797239250] [2025-03-15 03:10:35,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:35,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:10:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797239250] [2025-03-15 03:10:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797239250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 03:10:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770734325] [2025-03-15 03:10:35,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:35,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 03:10:35,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 03:10:35,314 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 03:10:35,316 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 03:10:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:35,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 03:10:35,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 03:10:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:10:35,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 03:10:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770734325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:35,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 03:10:35,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 03:10:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551204964] [2025-03-15 03:10:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:35,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 03:10:35,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:35,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 03:10:35,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 03:10:35,680 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 332 [2025-03-15 03:10:35,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 401 transitions, 1188 flow. Second operand has 5 states, 5 states have (on average 305.0) internal successors, (1525), 5 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:35,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:35,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 332 [2025-03-15 03:10:35,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:36,109 INFO L124 PetriNetUnfolderBase]: 476/1556 cut-off events. [2025-03-15 03:10:36,109 INFO L125 PetriNetUnfolderBase]: For 980/1330 co-relation queries the response was YES. [2025-03-15 03:10:36,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3800 conditions, 1556 events. 476/1556 cut-off events. For 980/1330 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7445 event pairs, 77 based on Foata normal form. 49/1397 useless extension candidates. Maximal degree in co-relation 3307. Up to 477 conditions per place. [2025-03-15 03:10:36,122 INFO L140 encePairwiseOnDemand]: 323/332 looper letters, 112 selfloop transitions, 15 changer transitions 13/435 dead transitions. [2025-03-15 03:10:36,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 435 transitions, 1632 flow [2025-03-15 03:10:36,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 03:10:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 03:10:36,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2202 transitions. [2025-03-15 03:10:36,126 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9475043029259896 [2025-03-15 03:10:36,127 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 10 predicate places. [2025-03-15 03:10:36,127 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 435 transitions, 1632 flow [2025-03-15 03:10:36,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 305.0) internal successors, (1525), 5 states have internal predecessors, (1525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:36,129 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:36,129 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:36,139 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 03:10:36,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 03:10:36,330 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:36,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash 895658386, now seen corresponding path program 1 times [2025-03-15 03:10:36,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:36,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416207781] [2025-03-15 03:10:36,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:36,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:36,602 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 03:10:36,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:36,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416207781] [2025-03-15 03:10:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416207781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:36,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:36,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:10:36,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438109438] [2025-03-15 03:10:36,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:36,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 03:10:36,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:36,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 03:10:36,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 03:10:36,606 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 332 [2025-03-15 03:10:36,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 435 transitions, 1632 flow. Second operand has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:36,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:36,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 332 [2025-03-15 03:10:36,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:36,792 INFO L124 PetriNetUnfolderBase]: 161/917 cut-off events. [2025-03-15 03:10:36,792 INFO L125 PetriNetUnfolderBase]: For 1426/1723 co-relation queries the response was YES. [2025-03-15 03:10:36,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 917 events. 161/917 cut-off events. For 1426/1723 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3729 event pairs, 46 based on Foata normal form. 57/853 useless extension candidates. Maximal degree in co-relation 1582. Up to 199 conditions per place. [2025-03-15 03:10:36,799 INFO L140 encePairwiseOnDemand]: 324/332 looper letters, 26 selfloop transitions, 37 changer transitions 14/388 dead transitions. [2025-03-15 03:10:36,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 388 transitions, 1450 flow [2025-03-15 03:10:36,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 03:10:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 03:10:36,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 949 transitions. [2025-03-15 03:10:36,802 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9528112449799196 [2025-03-15 03:10:36,802 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 12 predicate places. [2025-03-15 03:10:36,802 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 388 transitions, 1450 flow [2025-03-15 03:10:36,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:36,803 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:36,803 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:36,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 03:10:36,803 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:36,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:36,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1783209535, now seen corresponding path program 1 times [2025-03-15 03:10:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007785565] [2025-03-15 03:10:36,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:37,060 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 03:10:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007785565] [2025-03-15 03:10:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007785565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 03:10:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735597350] [2025-03-15 03:10:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:37,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:10:37,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:37,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:10:37,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 03:10:37,065 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-03-15 03:10:37,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 388 transitions, 1450 flow. Second operand has 6 states, 6 states have (on average 299.6666666666667) internal successors, (1798), 6 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:37,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:37,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-03-15 03:10:37,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:37,362 INFO L124 PetriNetUnfolderBase]: 172/848 cut-off events. [2025-03-15 03:10:37,362 INFO L125 PetriNetUnfolderBase]: For 1951/2129 co-relation queries the response was YES. [2025-03-15 03:10:37,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 848 events. 172/848 cut-off events. For 1951/2129 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3282 event pairs, 48 based on Foata normal form. 15/766 useless extension candidates. Maximal degree in co-relation 1794. Up to 212 conditions per place. [2025-03-15 03:10:37,369 INFO L140 encePairwiseOnDemand]: 321/332 looper letters, 80 selfloop transitions, 10 changer transitions 14/394 dead transitions. [2025-03-15 03:10:37,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 394 transitions, 1672 flow [2025-03-15 03:10:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 03:10:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 03:10:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2440 transitions. [2025-03-15 03:10:37,375 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9186746987951807 [2025-03-15 03:10:37,376 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 19 predicate places. [2025-03-15 03:10:37,376 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 394 transitions, 1672 flow [2025-03-15 03:10:37,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.6666666666667) internal successors, (1798), 6 states have internal predecessors, (1798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:37,377 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:37,378 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:37,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 03:10:37,378 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:37,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:37,379 INFO L85 PathProgramCache]: Analyzing trace with hash 555080065, now seen corresponding path program 1 times [2025-03-15 03:10:37,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:37,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030306189] [2025-03-15 03:10:37,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:37,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:37,606 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 03:10:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030306189] [2025-03-15 03:10:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030306189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:37,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:37,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 03:10:37,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136275632] [2025-03-15 03:10:37,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:37,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:10:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:37,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:10:37,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 03:10:37,611 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-03-15 03:10:37,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 394 transitions, 1672 flow. Second operand has 6 states, 6 states have (on average 299.8333333333333) internal successors, (1799), 6 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:37,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:37,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-03-15 03:10:37,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:37,890 INFO L124 PetriNetUnfolderBase]: 216/1037 cut-off events. [2025-03-15 03:10:37,890 INFO L125 PetriNetUnfolderBase]: For 3638/4720 co-relation queries the response was YES. [2025-03-15 03:10:37,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3397 conditions, 1037 events. 216/1037 cut-off events. For 3638/4720 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4250 event pairs, 54 based on Foata normal form. 29/929 useless extension candidates. Maximal degree in co-relation 2765. Up to 275 conditions per place. [2025-03-15 03:10:37,898 INFO L140 encePairwiseOnDemand]: 322/332 looper letters, 106 selfloop transitions, 13 changer transitions 15/424 dead transitions. [2025-03-15 03:10:37,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 424 transitions, 2202 flow [2025-03-15 03:10:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 03:10:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 03:10:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2444 transitions. [2025-03-15 03:10:37,904 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9201807228915663 [2025-03-15 03:10:37,906 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 26 predicate places. [2025-03-15 03:10:37,906 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 424 transitions, 2202 flow [2025-03-15 03:10:37,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.8333333333333) internal successors, (1799), 6 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:37,908 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:37,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 03:10:37,908 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:37,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:37,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1786422377, now seen corresponding path program 1 times [2025-03-15 03:10:37,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:37,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120030318] [2025-03-15 03:10:37,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:37,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:38,058 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 03:10:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120030318] [2025-03-15 03:10:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120030318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:38,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:38,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:10:38,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662867237] [2025-03-15 03:10:38,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:38,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:10:38,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:38,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:10:38,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:10:38,063 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 332 [2025-03-15 03:10:38,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 424 transitions, 2202 flow. Second operand has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:38,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:38,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 332 [2025-03-15 03:10:38,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:38,475 INFO L124 PetriNetUnfolderBase]: 496/1874 cut-off events. [2025-03-15 03:10:38,475 INFO L125 PetriNetUnfolderBase]: For 11344/12300 co-relation queries the response was YES. [2025-03-15 03:10:38,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7651 conditions, 1874 events. 496/1874 cut-off events. For 11344/12300 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 10832 event pairs, 138 based on Foata normal form. 19/1605 useless extension candidates. Maximal degree in co-relation 6915. Up to 702 conditions per place. [2025-03-15 03:10:38,489 INFO L140 encePairwiseOnDemand]: 325/332 looper letters, 131 selfloop transitions, 4 changer transitions 14/478 dead transitions. [2025-03-15 03:10:38,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 478 transitions, 3182 flow [2025-03-15 03:10:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:10:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:10:38,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1574 transitions. [2025-03-15 03:10:38,492 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9481927710843373 [2025-03-15 03:10:38,493 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 30 predicate places. [2025-03-15 03:10:38,493 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 478 transitions, 3182 flow [2025-03-15 03:10:38,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:38,493 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:38,494 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:38,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 03:10:38,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:38,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash 723596533, now seen corresponding path program 1 times [2025-03-15 03:10:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:38,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021483773] [2025-03-15 03:10:38,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:38,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:38,761 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 03:10:38,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:38,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021483773] [2025-03-15 03:10:38,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021483773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:38,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:38,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:10:38,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129047663] [2025-03-15 03:10:38,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:38,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 03:10:38,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:38,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 03:10:38,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:10:38,766 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-03-15 03:10:38,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 478 transitions, 3182 flow. Second operand has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:38,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:38,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-03-15 03:10:38,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:39,278 INFO L124 PetriNetUnfolderBase]: 542/1990 cut-off events. [2025-03-15 03:10:39,279 INFO L125 PetriNetUnfolderBase]: For 15986/17817 co-relation queries the response was YES. [2025-03-15 03:10:39,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9042 conditions, 1990 events. 542/1990 cut-off events. For 15986/17817 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11822 event pairs, 204 based on Foata normal form. 163/1863 useless extension candidates. Maximal degree in co-relation 8237. Up to 724 conditions per place. [2025-03-15 03:10:39,304 INFO L140 encePairwiseOnDemand]: 318/332 looper letters, 145 selfloop transitions, 27 changer transitions 15/484 dead transitions. [2025-03-15 03:10:39,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 484 transitions, 3670 flow [2025-03-15 03:10:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:10:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:10:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2726 transitions. [2025-03-15 03:10:39,311 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9123159303882196 [2025-03-15 03:10:39,311 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 33 predicate places. [2025-03-15 03:10:39,312 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 484 transitions, 3670 flow [2025-03-15 03:10:39,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 300.0) internal successors, (2400), 8 states have internal predecessors, (2400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:39,313 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:39,314 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:39,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 03:10:39,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:39,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 580275351, now seen corresponding path program 1 times [2025-03-15 03:10:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:39,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859107725] [2025-03-15 03:10:39,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:39,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:39,540 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 03:10:39,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:39,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859107725] [2025-03-15 03:10:39,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859107725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 03:10:39,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961845048] [2025-03-15 03:10:39,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:39,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 03:10:39,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 03:10:39,544 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 03:10:39,550 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 03:10:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:39,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 03:10:39,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 03:10:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:10:39,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 03:10:39,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961845048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:39,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 03:10:39,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 03:10:39,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035101089] [2025-03-15 03:10:39,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:39,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:10:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:39,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:10:39,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:10:39,899 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 332 [2025-03-15 03:10:39,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 484 transitions, 3670 flow. Second operand has 6 states, 6 states have (on average 309.1666666666667) internal successors, (1855), 6 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:39,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:39,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 332 [2025-03-15 03:10:39,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:40,298 INFO L124 PetriNetUnfolderBase]: 504/1870 cut-off events. [2025-03-15 03:10:40,298 INFO L125 PetriNetUnfolderBase]: For 18578/19758 co-relation queries the response was YES. [2025-03-15 03:10:40,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9086 conditions, 1870 events. 504/1870 cut-off events. For 18578/19758 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10563 event pairs, 145 based on Foata normal form. 36/1663 useless extension candidates. Maximal degree in co-relation 8225. Up to 676 conditions per place. [2025-03-15 03:10:40,314 INFO L140 encePairwiseOnDemand]: 327/332 looper letters, 140 selfloop transitions, 6 changer transitions 15/491 dead transitions. [2025-03-15 03:10:40,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 491 transitions, 4112 flow [2025-03-15 03:10:40,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 03:10:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 03:10:40,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2196 transitions. [2025-03-15 03:10:40,318 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9449225473321858 [2025-03-15 03:10:40,319 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 38 predicate places. [2025-03-15 03:10:40,319 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 491 transitions, 4112 flow [2025-03-15 03:10:40,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.1666666666667) internal successors, (1855), 6 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:40,320 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:40,320 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:40,328 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 03:10:40,521 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,SelfDestructingSolverStorable8 [2025-03-15 03:10:40,521 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:40,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:40,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2132048084, now seen corresponding path program 1 times [2025-03-15 03:10:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610626933] [2025-03-15 03:10:40,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:40,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:10:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:40,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610626933] [2025-03-15 03:10:40,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610626933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:40,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:40,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:10:40,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055294490] [2025-03-15 03:10:40,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:40,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:10:40,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:40,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:10:40,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:10:40,628 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 332 [2025-03-15 03:10:40,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 491 transitions, 4112 flow. Second operand has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:40,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:40,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 332 [2025-03-15 03:10:40,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:41,048 INFO L124 PetriNetUnfolderBase]: 516/1797 cut-off events. [2025-03-15 03:10:41,048 INFO L125 PetriNetUnfolderBase]: For 24948/27271 co-relation queries the response was YES. [2025-03-15 03:10:41,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9748 conditions, 1797 events. 516/1797 cut-off events. For 24948/27271 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9866 event pairs, 147 based on Foata normal form. 148/1705 useless extension candidates. Maximal degree in co-relation 8831. Up to 687 conditions per place. [2025-03-15 03:10:41,074 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 157 selfloop transitions, 8 changer transitions 15/510 dead transitions. [2025-03-15 03:10:41,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 510 transitions, 4849 flow [2025-03-15 03:10:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:10:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:10:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1568 transitions. [2025-03-15 03:10:41,079 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.944578313253012 [2025-03-15 03:10:41,079 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 41 predicate places. [2025-03-15 03:10:41,079 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 510 transitions, 4849 flow [2025-03-15 03:10:41,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.0) internal successors, (1244), 4 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:41,080 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:41,080 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:41,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 03:10:41,081 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:41,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:41,082 INFO L85 PathProgramCache]: Analyzing trace with hash -367685069, now seen corresponding path program 1 times [2025-03-15 03:10:41,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:41,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046905645] [2025-03-15 03:10:41,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:41,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:10:41,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046905645] [2025-03-15 03:10:41,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046905645] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 03:10:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102456135] [2025-03-15 03:10:41,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:41,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 03:10:41,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 03:10:41,329 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 03:10:41,330 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 03:10:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:41,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 03:10:41,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 03:10:41,634 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:10:41,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 03:10:41,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102456135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:41,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 03:10:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 03:10:41,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939613646] [2025-03-15 03:10:41,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:41,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:10:41,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:41,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:10:41,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:10:41,636 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 332 [2025-03-15 03:10:41,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 510 transitions, 4849 flow. Second operand has 6 states, 6 states have (on average 307.5) internal successors, (1845), 6 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:41,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:41,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 332 [2025-03-15 03:10:41,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:42,036 INFO L124 PetriNetUnfolderBase]: 498/1762 cut-off events. [2025-03-15 03:10:42,037 INFO L125 PetriNetUnfolderBase]: For 25458/27589 co-relation queries the response was YES. [2025-03-15 03:10:42,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10302 conditions, 1762 events. 498/1762 cut-off events. For 25458/27589 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 9674 event pairs, 84 based on Foata normal form. 59/1602 useless extension candidates. Maximal degree in co-relation 9481. Up to 657 conditions per place. [2025-03-15 03:10:42,051 INFO L140 encePairwiseOnDemand]: 327/332 looper letters, 180 selfloop transitions, 6 changer transitions 15/526 dead transitions. [2025-03-15 03:10:42,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 526 transitions, 5613 flow [2025-03-15 03:10:42,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 03:10:42,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 03:10:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2189 transitions. [2025-03-15 03:10:42,055 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9419104991394148 [2025-03-15 03:10:42,056 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 46 predicate places. [2025-03-15 03:10:42,056 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 526 transitions, 5613 flow [2025-03-15 03:10:42,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 307.5) internal successors, (1845), 6 states have internal predecessors, (1845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:42,057 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:42,057 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:42,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 03:10:42,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 03:10:42,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:42,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1597365514, now seen corresponding path program 1 times [2025-03-15 03:10:42,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:42,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115091550] [2025-03-15 03:10:42,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:42,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 03:10:42,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:42,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115091550] [2025-03-15 03:10:42,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115091550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:42,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:42,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:10:42,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909402651] [2025-03-15 03:10:42,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:42,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:10:42,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:42,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:10:42,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:10:42,371 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 332 [2025-03-15 03:10:42,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 526 transitions, 5613 flow. Second operand has 4 states, 4 states have (on average 309.5) internal successors, (1238), 4 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:42,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:42,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 332 [2025-03-15 03:10:42,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:42,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([735] L881-->L881-3: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~ret5_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~ret5=|v_thread1Thread1of1ForFork0_#t~ret5_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret5, #pthreadsMutex][480], [1218#(<= 1 thread1Thread1of1ForFork0_~i~0), 1192#true, thread2Thread1of1ForFork1InUse, 149#L902true, 1202#(<= 1 ~num~0), thread1Thread1of1ForFork0InUse, 341#true, 1180#true, 1165#true, 351#(<= 1 ~num~0), 335#true, 3031#true, 2118#(<= thread1Thread1of1ForFork0_~i~0 2), 1172#(<= 1 ~num~0), 2127#(<= 1 thread2Thread1of1ForFork1_~j~0), 126#L914-4true, 287#L881-3true]) [2025-03-15 03:10:42,792 INFO L294 olderBase$Statistics]: this new event has 332 ancestors and is cut-off event [2025-03-15 03:10:42,792 INFO L297 olderBase$Statistics]: existing Event has 312 ancestors and is cut-off event [2025-03-15 03:10:42,792 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2025-03-15 03:10:42,792 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2025-03-15 03:10:42,796 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([735] L881-->L881-3: Formula: (and (= |v_thread1Thread1of1ForFork0_#t~ret5_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{thread1Thread1of1ForFork0_#t~ret5=|v_thread1Thread1of1ForFork0_#t~ret5_1|, #pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~ret5, #pthreadsMutex][480], [1218#(<= 1 thread1Thread1of1ForFork0_~i~0), 1192#true, thread2Thread1of1ForFork1InUse, 1202#(<= 1 ~num~0), thread1Thread1of1ForFork0InUse, 341#true, 1180#true, 1165#true, 221#L903true, 351#(<= 1 ~num~0), 335#true, 3031#true, 2118#(<= thread1Thread1of1ForFork0_~i~0 2), 1172#(<= 1 ~num~0), 126#L914-4true, 2127#(<= 1 thread2Thread1of1ForFork1_~j~0), 287#L881-3true]) [2025-03-15 03:10:42,796 INFO L294 olderBase$Statistics]: this new event has 333 ancestors and is cut-off event [2025-03-15 03:10:42,797 INFO L297 olderBase$Statistics]: existing Event has 316 ancestors and is cut-off event [2025-03-15 03:10:42,797 INFO L297 olderBase$Statistics]: existing Event has 313 ancestors and is cut-off event [2025-03-15 03:10:42,797 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2025-03-15 03:10:42,804 INFO L124 PetriNetUnfolderBase]: 478/1742 cut-off events. [2025-03-15 03:10:42,804 INFO L125 PetriNetUnfolderBase]: For 28077/30082 co-relation queries the response was YES. [2025-03-15 03:10:42,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10802 conditions, 1742 events. 478/1742 cut-off events. For 28077/30082 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9523 event pairs, 63 based on Foata normal form. 89/1666 useless extension candidates. Maximal degree in co-relation 9949. Up to 613 conditions per place. [2025-03-15 03:10:42,821 INFO L140 encePairwiseOnDemand]: 326/332 looper letters, 182 selfloop transitions, 8 changer transitions 36/551 dead transitions. [2025-03-15 03:10:42,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 551 transitions, 6681 flow [2025-03-15 03:10:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:10:42,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:10:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1560 transitions. [2025-03-15 03:10:42,825 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9397590361445783 [2025-03-15 03:10:42,827 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 49 predicate places. [2025-03-15 03:10:42,827 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 551 transitions, 6681 flow [2025-03-15 03:10:42,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.5) internal successors, (1238), 4 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:42,827 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:10:42,828 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:10:42,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 03:10:42,828 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 03:10:42,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:10:42,829 INFO L85 PathProgramCache]: Analyzing trace with hash 859375315, now seen corresponding path program 1 times [2025-03-15 03:10:42,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:10:42,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687590924] [2025-03-15 03:10:42,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:10:42,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:10:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:10:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:10:42,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:10:42,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687590924] [2025-03-15 03:10:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687590924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:10:42,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:10:42,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 03:10:42,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356154066] [2025-03-15 03:10:42,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:10:42,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:10:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:10:42,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:10:42,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 03:10:42,976 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 332 [2025-03-15 03:10:42,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 551 transitions, 6681 flow. Second operand has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:42,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:10:42,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 332 [2025-03-15 03:10:42,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:10:43,351 INFO L124 PetriNetUnfolderBase]: 422/1558 cut-off events. [2025-03-15 03:10:43,352 INFO L125 PetriNetUnfolderBase]: For 31001/33632 co-relation queries the response was YES. [2025-03-15 03:10:43,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10374 conditions, 1558 events. 422/1558 cut-off events. For 31001/33632 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 8376 event pairs, 51 based on Foata normal form. 72/1490 useless extension candidates. Maximal degree in co-relation 9480. Up to 536 conditions per place. [2025-03-15 03:10:43,363 INFO L140 encePairwiseOnDemand]: 323/332 looper letters, 0 selfloop transitions, 0 changer transitions 541/541 dead transitions. [2025-03-15 03:10:43,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 541 transitions, 6900 flow [2025-03-15 03:10:43,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 03:10:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 03:10:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2423 transitions. [2025-03-15 03:10:43,367 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9122740963855421 [2025-03-15 03:10:43,367 INFO L298 CegarLoopForPetriNet]: 332 programPoint places, 55 predicate places. [2025-03-15 03:10:43,367 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 541 transitions, 6900 flow [2025-03-15 03:10:43,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 302.3333333333333) internal successors, (1814), 6 states have internal predecessors, (1814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:10:43,378 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/arithmetic_prog_bad.i_petrified1_AllErrorsAtOnce [2025-03-15 03:10:43,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-15 03:10:43,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 03:10:43,422 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 03:10:43,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 03:10:43,423 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:10:43,428 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 03:10:43,429 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 03:10:43,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 03:10:43 BasicIcfg [2025-03-15 03:10:43,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 03:10:43,435 INFO L158 Benchmark]: Toolchain (without parser) took 11648.98ms. Allocated memory was 71.3MB in the beginning and 478.2MB in the end (delta: 406.8MB). Free memory was 43.1MB in the beginning and 135.7MB in the end (delta: -92.6MB). Peak memory consumption was 312.9MB. Max. memory is 8.0GB. [2025-03-15 03:10:43,435 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 03:10:43,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.22ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 39.9MB in the end (delta: 3.0MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. [2025-03-15 03:10:43,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.27ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 37.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 03:10:43,435 INFO L158 Benchmark]: Boogie Preprocessor took 42.97ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 03:10:43,436 INFO L158 Benchmark]: RCFGBuilder took 599.88ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 32.9MB in the end (delta: 2.0MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. [2025-03-15 03:10:43,437 INFO L158 Benchmark]: TraceAbstraction took 10513.09ms. Allocated memory was 71.3MB in the beginning and 478.2MB in the end (delta: 406.8MB). Free memory was 31.8MB in the beginning and 135.7MB in the end (delta: -103.9MB). Peak memory consumption was 301.5MB. Max. memory is 8.0GB. [2025-03-15 03:10:43,438 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 71.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 437.22ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 39.9MB in the end (delta: 3.0MB). Peak memory consumption was 30.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.27ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 37.0MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.97ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.8MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 599.88ms. Allocated memory is still 71.3MB. Free memory was 34.8MB in the beginning and 32.9MB in the end (delta: 2.0MB). Peak memory consumption was 23.9MB. Max. memory is 8.0GB. * TraceAbstraction took 10513.09ms. Allocated memory was 71.3MB in the beginning and 478.2MB in the end (delta: 406.8MB). Free memory was 31.8MB in the beginning and 135.7MB in the end (delta: -103.9MB). Peak memory consumption was 301.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 882]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 882]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 885]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 885]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 897]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 897]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 900]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 900]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 387 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.4s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 430 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 117 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1245 IncrementalHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 82 mSDtfsCounter, 1245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 951 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6900occurred in iteration=13, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 4542 NumberOfCodeBlocks, 4542 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4526 ConstructedInterpolants, 0 QuantifiedInterpolants, 5440 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1830 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 40/59 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 03:10:43,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...