/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/goblint-regression/04-mutex_46-escape_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:54:25,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:54:25,137 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 01:54:25,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:54:25,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:54:25,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:54:25,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:54:25,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:54:25,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:54:25,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:54:25,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:54:25,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:54:25,180 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:54:25,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:25,181 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:54:25,181 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:54:25,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:54:25,182 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 01:54:25,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:54:25,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:54:25,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:54:25,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:54:25,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:54:25,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_46-escape_nr.i [2025-03-15 01:54:26,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4254a9c/72a598e8ace9432584ee91b4d658d001/FLAG7a7b0fcef [2025-03-15 01:54:26,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:54:26,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_46-escape_nr.i [2025-03-15 01:54:26,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4254a9c/72a598e8ace9432584ee91b4d658d001/FLAG7a7b0fcef [2025-03-15 01:54:26,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4254a9c/72a598e8ace9432584ee91b4d658d001 [2025-03-15 01:54:26,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:54:26,857 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:54:26,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:26,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:54:26,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:54:26,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:26" (1/1) ... [2025-03-15 01:54:26,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314eb7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:26, skipping insertion in model container [2025-03-15 01:54:26,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:26" (1/1) ... [2025-03-15 01:54:26,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:54:27,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:27,136 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:54:27,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:27,237 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:54:27,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27 WrapperNode [2025-03-15 01:54:27,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:27,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:27,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:54:27,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:54:27,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,264 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 106 [2025-03-15 01:54:27,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:27,264 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:54:27,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:54:27,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:54:27,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,278 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:54:27,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:54:27,292 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:54:27,292 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:54:27,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (1/1) ... [2025-03-15 01:54:27,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:27,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:27,320 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 01:54:27,323 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 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 01:54:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:54:27,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:54:27,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:54:27,340 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 01:54:27,434 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:54:27,435 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:54:27,576 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:54:27,576 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:54:27,590 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:54:27,590 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:54:27,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:27 BoogieIcfgContainer [2025-03-15 01:54:27,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:54:27,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:54:27,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:54:27,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:54:27,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:54:26" (1/3) ... [2025-03-15 01:54:27,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6e5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:27, skipping insertion in model container [2025-03-15 01:54:27,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:27" (2/3) ... [2025-03-15 01:54:27,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6e5c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:27, skipping insertion in model container [2025-03-15 01:54:27,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:27" (3/3) ... [2025-03-15 01:54:27,599 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_46-escape_nr.i [2025-03-15 01:54:27,609 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:54:27,610 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_46-escape_nr.i that has 2 procedures, 126 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-15 01:54:27,611 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:54:27,664 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 01:54:27,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:54:27,702 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;@6eb798c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:54:27,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-15 01:54:27,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:54:27,742 INFO L124 PetriNetUnfolderBase]: 0/101 cut-off events. [2025-03-15 01:54:27,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:54:27,744 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:27,745 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:27,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:27,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:27,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1961501016, now seen corresponding path program 1 times [2025-03-15 01:54:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:27,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181646791] [2025-03-15 01:54:27,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:27,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:28,410 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 01:54:28,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:28,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181646791] [2025-03-15 01:54:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181646791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:28,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459598488] [2025-03-15 01:54:28,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:28,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:28,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:28,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:28,444 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 126 [2025-03-15 01:54:28,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 126 transitions, 259 flow. Second operand has 9 states, 9 states have (on average 92.11111111111111) internal successors, (829), 9 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:28,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:28,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 126 [2025-03-15 01:54:28,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:28,905 INFO L124 PetriNetUnfolderBase]: 59/317 cut-off events. [2025-03-15 01:54:28,906 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-15 01:54:28,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 317 events. 59/317 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1097 event pairs, 7 based on Foata normal form. 0/301 useless extension candidates. Maximal degree in co-relation 363. Up to 59 conditions per place. [2025-03-15 01:54:28,912 INFO L140 encePairwiseOnDemand]: 111/126 looper letters, 40 selfloop transitions, 17 changer transitions 32/172 dead transitions. [2025-03-15 01:54:28,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 172 transitions, 519 flow [2025-03-15 01:54:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-15 01:54:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-15 01:54:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1615 transitions. [2025-03-15 01:54:28,928 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.753968253968254 [2025-03-15 01:54:28,930 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 15 predicate places. [2025-03-15 01:54:28,930 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 172 transitions, 519 flow [2025-03-15 01:54:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.11111111111111) internal successors, (829), 9 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:28,931 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:28,931 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:28,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:54:28,931 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:28,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:28,932 INFO L85 PathProgramCache]: Analyzing trace with hash -573729028, now seen corresponding path program 1 times [2025-03-15 01:54:28,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:28,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888651026] [2025-03-15 01:54:28,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:28,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:29,089 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 01:54:29,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:29,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888651026] [2025-03-15 01:54:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888651026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:29,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545644278] [2025-03-15 01:54:29,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:29,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:29,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:29,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:29,093 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 126 [2025-03-15 01:54:29,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 172 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:29,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:29,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 126 [2025-03-15 01:54:29,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:29,307 INFO L124 PetriNetUnfolderBase]: 102/464 cut-off events. [2025-03-15 01:54:29,307 INFO L125 PetriNetUnfolderBase]: For 83/97 co-relation queries the response was YES. [2025-03-15 01:54:29,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 955 conditions, 464 events. 102/464 cut-off events. For 83/97 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2088 event pairs, 8 based on Foata normal form. 8/446 useless extension candidates. Maximal degree in co-relation 790. Up to 86 conditions per place. [2025-03-15 01:54:29,310 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 54 selfloop transitions, 16 changer transitions 60/223 dead transitions. [2025-03-15 01:54:29,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 223 transitions, 934 flow [2025-03-15 01:54:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:54:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:54:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1083 transitions. [2025-03-15 01:54:29,323 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7813852813852814 [2025-03-15 01:54:29,323 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 25 predicate places. [2025-03-15 01:54:29,323 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 223 transitions, 934 flow [2025-03-15 01:54:29,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:29,324 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:29,324 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:29,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:54:29,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:29,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash -676989042, now seen corresponding path program 1 times [2025-03-15 01:54:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102775113] [2025-03-15 01:54:29,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:29,583 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 01:54:29,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:29,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102775113] [2025-03-15 01:54:29,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102775113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:29,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:29,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841983028] [2025-03-15 01:54:29,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:29,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:29,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:29,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:29,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:29,585 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 126 [2025-03-15 01:54:29,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 223 transitions, 934 flow. Second operand has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:29,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:29,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 126 [2025-03-15 01:54:29,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:29,844 INFO L124 PetriNetUnfolderBase]: 98/457 cut-off events. [2025-03-15 01:54:29,844 INFO L125 PetriNetUnfolderBase]: For 218/274 co-relation queries the response was YES. [2025-03-15 01:54:29,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 457 events. 98/457 cut-off events. For 218/274 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1997 event pairs, 8 based on Foata normal form. 24/460 useless extension candidates. Maximal degree in co-relation 979. Up to 127 conditions per place. [2025-03-15 01:54:29,847 INFO L140 encePairwiseOnDemand]: 111/126 looper letters, 47 selfloop transitions, 19 changer transitions 67/223 dead transitions. [2025-03-15 01:54:29,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 223 transitions, 1184 flow [2025-03-15 01:54:29,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:54:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:54:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1234 transitions. [2025-03-15 01:54:29,851 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7533577533577533 [2025-03-15 01:54:29,851 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 37 predicate places. [2025-03-15 01:54:29,851 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 223 transitions, 1184 flow [2025-03-15 01:54:29,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.11111111111111) internal successors, (820), 9 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:29,852 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:29,852 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:29,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:54:29,852 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:29,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:29,853 INFO L85 PathProgramCache]: Analyzing trace with hash -605730494, now seen corresponding path program 1 times [2025-03-15 01:54:29,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:29,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877622296] [2025-03-15 01:54:29,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:29,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:29,983 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 01:54:29,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:29,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877622296] [2025-03-15 01:54:29,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877622296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924043113] [2025-03-15 01:54:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:29,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:29,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:29,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:29,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:29,985 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 126 [2025-03-15 01:54:29,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 223 transitions, 1184 flow. Second operand has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:29,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:29,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 126 [2025-03-15 01:54:29,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:30,162 INFO L124 PetriNetUnfolderBase]: 94/437 cut-off events. [2025-03-15 01:54:30,162 INFO L125 PetriNetUnfolderBase]: For 337/375 co-relation queries the response was YES. [2025-03-15 01:54:30,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 437 events. 94/437 cut-off events. For 337/375 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1886 event pairs, 6 based on Foata normal form. 16/439 useless extension candidates. Maximal degree in co-relation 1131. Up to 125 conditions per place. [2025-03-15 01:54:30,163 INFO L140 encePairwiseOnDemand]: 114/126 looper letters, 41 selfloop transitions, 14 changer transitions 77/222 dead transitions. [2025-03-15 01:54:30,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 222 transitions, 1420 flow [2025-03-15 01:54:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:54:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:54:30,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 977 transitions. [2025-03-15 01:54:30,165 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7753968253968254 [2025-03-15 01:54:30,166 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 46 predicate places. [2025-03-15 01:54:30,166 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 222 transitions, 1420 flow [2025-03-15 01:54:30,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:30,166 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:30,166 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] [2025-03-15 01:54:30,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:54:30,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:30,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:30,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2086636890, now seen corresponding path program 1 times [2025-03-15 01:54:30,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:30,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063913343] [2025-03-15 01:54:30,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:30,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:30,234 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 01:54:30,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:30,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063913343] [2025-03-15 01:54:30,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063913343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:30,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:30,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863186946] [2025-03-15 01:54:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:30,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:54:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:30,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:54:30,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:54:30,237 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 126 [2025-03-15 01:54:30,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 222 transitions, 1420 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:30,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:30,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 126 [2025-03-15 01:54:30,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:30,269 INFO L124 PetriNetUnfolderBase]: 10/176 cut-off events. [2025-03-15 01:54:30,269 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2025-03-15 01:54:30,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 468 conditions, 176 events. 10/176 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 210 event pairs, 0 based on Foata normal form. 16/187 useless extension candidates. Maximal degree in co-relation 279. Up to 42 conditions per place. [2025-03-15 01:54:30,270 INFO L140 encePairwiseOnDemand]: 122/126 looper letters, 7 selfloop transitions, 8 changer transitions 22/151 dead transitions. [2025-03-15 01:54:30,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 151 transitions, 788 flow [2025-03-15 01:54:30,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:54:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:54:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-03-15 01:54:30,271 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9417989417989417 [2025-03-15 01:54:30,272 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 39 predicate places. [2025-03-15 01:54:30,272 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 151 transitions, 788 flow [2025-03-15 01:54:30,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:30,272 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:30,272 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:30,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:54:30,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:30,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash -242828107, now seen corresponding path program 1 times [2025-03-15 01:54:30,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:30,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257953607] [2025-03-15 01:54:30,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:30,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:30,663 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 01:54:30,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257953607] [2025-03-15 01:54:30,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257953607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:30,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:30,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:30,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231507269] [2025-03-15 01:54:30,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:30,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:30,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:30,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:30,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:30,665 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 126 [2025-03-15 01:54:30,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 151 transitions, 788 flow. Second operand has 12 states, 12 states have (on average 85.33333333333333) internal successors, (1024), 12 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:30,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:30,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 126 [2025-03-15 01:54:30,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:31,059 INFO L124 PetriNetUnfolderBase]: 20/191 cut-off events. [2025-03-15 01:54:31,059 INFO L125 PetriNetUnfolderBase]: For 331/339 co-relation queries the response was YES. [2025-03-15 01:54:31,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 191 events. 20/191 cut-off events. For 331/339 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 226 event pairs, 0 based on Foata normal form. 8/195 useless extension candidates. Maximal degree in co-relation 385. Up to 49 conditions per place. [2025-03-15 01:54:31,060 INFO L140 encePairwiseOnDemand]: 107/126 looper letters, 42 selfloop transitions, 16 changer transitions 25/159 dead transitions. [2025-03-15 01:54:31,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 159 transitions, 1007 flow [2025-03-15 01:54:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 01:54:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 01:54:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1406 transitions. [2025-03-15 01:54:31,064 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6974206349206349 [2025-03-15 01:54:31,065 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 53 predicate places. [2025-03-15 01:54:31,065 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 159 transitions, 1007 flow [2025-03-15 01:54:31,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.33333333333333) internal successors, (1024), 12 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:31,066 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:31,066 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] [2025-03-15 01:54:31,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:54:31,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:31,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:31,067 INFO L85 PathProgramCache]: Analyzing trace with hash 786271765, now seen corresponding path program 1 times [2025-03-15 01:54:31,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:31,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639058298] [2025-03-15 01:54:31,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:31,269 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 01:54:31,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:31,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639058298] [2025-03-15 01:54:31,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639058298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:31,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:31,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:31,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146114070] [2025-03-15 01:54:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:31,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:31,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:31,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:31,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:31,272 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 126 [2025-03-15 01:54:31,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 159 transitions, 1007 flow. Second operand has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:31,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:31,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 126 [2025-03-15 01:54:31,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:31,538 INFO L124 PetriNetUnfolderBase]: 19/217 cut-off events. [2025-03-15 01:54:31,539 INFO L125 PetriNetUnfolderBase]: For 517/525 co-relation queries the response was YES. [2025-03-15 01:54:31,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 217 events. 19/217 cut-off events. For 517/525 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 359 event pairs, 0 based on Foata normal form. 8/220 useless extension candidates. Maximal degree in co-relation 551. Up to 65 conditions per place. [2025-03-15 01:54:31,540 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 55 selfloop transitions, 12 changer transitions 34/181 dead transitions. [2025-03-15 01:54:31,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 181 transitions, 1434 flow [2025-03-15 01:54:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:54:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:54:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1204 transitions. [2025-03-15 01:54:31,542 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7350427350427351 [2025-03-15 01:54:31,542 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 65 predicate places. [2025-03-15 01:54:31,542 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 181 transitions, 1434 flow [2025-03-15 01:54:31,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:31,543 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:31,543 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] [2025-03-15 01:54:31,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:54:31,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1172854955, now seen corresponding path program 2 times [2025-03-15 01:54:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044444621] [2025-03-15 01:54:31,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:31,564 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:31,564 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:31,734 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 01:54:31,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:31,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044444621] [2025-03-15 01:54:31,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044444621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:31,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277124941] [2025-03-15 01:54:31,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:31,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:31,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:31,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:31,736 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 126 [2025-03-15 01:54:31,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 181 transitions, 1434 flow. Second operand has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:31,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:31,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 126 [2025-03-15 01:54:31,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:32,003 INFO L124 PetriNetUnfolderBase]: 22/254 cut-off events. [2025-03-15 01:54:32,003 INFO L125 PetriNetUnfolderBase]: For 828/836 co-relation queries the response was YES. [2025-03-15 01:54:32,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 254 events. 22/254 cut-off events. For 828/836 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 560 event pairs, 1 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 804. Up to 89 conditions per place. [2025-03-15 01:54:32,004 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 65 selfloop transitions, 21 changer transitions 43/209 dead transitions. [2025-03-15 01:54:32,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 209 transitions, 2013 flow [2025-03-15 01:54:32,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:54:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:54:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1195 transitions. [2025-03-15 01:54:32,008 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7295482295482295 [2025-03-15 01:54:32,009 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 77 predicate places. [2025-03-15 01:54:32,009 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 209 transitions, 2013 flow [2025-03-15 01:54:32,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:32,010 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:32,010 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] [2025-03-15 01:54:32,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:54:32,010 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:32,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1456953309, now seen corresponding path program 3 times [2025-03-15 01:54:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:32,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733562714] [2025-03-15 01:54:32,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:54:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:32,029 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:54:32,029 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:32,193 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 01:54:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733562714] [2025-03-15 01:54:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733562714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111186770] [2025-03-15 01:54:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:32,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:32,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:32,195 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 126 [2025-03-15 01:54:32,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 209 transitions, 2013 flow. Second operand has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:32,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:32,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 126 [2025-03-15 01:54:32,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:32,455 INFO L124 PetriNetUnfolderBase]: 21/281 cut-off events. [2025-03-15 01:54:32,455 INFO L125 PetriNetUnfolderBase]: For 1238/1262 co-relation queries the response was YES. [2025-03-15 01:54:32,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 281 events. 21/281 cut-off events. For 1238/1262 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 714 event pairs, 2 based on Foata normal form. 3/277 useless extension candidates. Maximal degree in co-relation 1021. Up to 106 conditions per place. [2025-03-15 01:54:32,456 INFO L140 encePairwiseOnDemand]: 113/126 looper letters, 73 selfloop transitions, 20 changer transitions 52/225 dead transitions. [2025-03-15 01:54:32,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 2528 flow [2025-03-15 01:54:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:54:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:54:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1201 transitions. [2025-03-15 01:54:32,459 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7332112332112332 [2025-03-15 01:54:32,460 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 89 predicate places. [2025-03-15 01:54:32,460 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 225 transitions, 2528 flow [2025-03-15 01:54:32,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:32,461 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:32,461 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] [2025-03-15 01:54:32,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:54:32,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:32,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:32,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1763424477, now seen corresponding path program 4 times [2025-03-15 01:54:32,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:32,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207130192] [2025-03-15 01:54:32,462 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:54:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:32,487 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:54:32,487 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:32,710 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 01:54:32,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:32,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207130192] [2025-03-15 01:54:32,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207130192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:32,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:32,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:32,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111545025] [2025-03-15 01:54:32,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:32,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:32,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:32,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:32,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:32,712 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 126 [2025-03-15 01:54:32,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 225 transitions, 2528 flow. Second operand has 12 states, 12 states have (on average 85.33333333333333) internal successors, (1024), 12 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:32,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:32,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 126 [2025-03-15 01:54:32,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:33,177 INFO L124 PetriNetUnfolderBase]: 27/352 cut-off events. [2025-03-15 01:54:33,177 INFO L125 PetriNetUnfolderBase]: For 1829/1851 co-relation queries the response was YES. [2025-03-15 01:54:33,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 352 events. 27/352 cut-off events. For 1829/1851 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1249 event pairs, 2 based on Foata normal form. 3/345 useless extension candidates. Maximal degree in co-relation 1623. Up to 153 conditions per place. [2025-03-15 01:54:33,179 INFO L140 encePairwiseOnDemand]: 106/126 looper letters, 101 selfloop transitions, 37 changer transitions 65/279 dead transitions. [2025-03-15 01:54:33,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 279 transitions, 3771 flow [2025-03-15 01:54:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 01:54:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 01:54:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1842 transitions. [2025-03-15 01:54:33,181 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6961451247165533 [2025-03-15 01:54:33,182 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 109 predicate places. [2025-03-15 01:54:33,182 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 279 transitions, 3771 flow [2025-03-15 01:54:33,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 85.33333333333333) internal successors, (1024), 12 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:33,182 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:33,182 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] [2025-03-15 01:54:33,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:54:33,182 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:33,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:33,183 INFO L85 PathProgramCache]: Analyzing trace with hash -733319783, now seen corresponding path program 5 times [2025-03-15 01:54:33,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:33,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468146586] [2025-03-15 01:54:33,183 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:54:33,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:33,195 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:33,195 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:33,314 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 01:54:33,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:33,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468146586] [2025-03-15 01:54:33,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468146586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:33,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:33,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732770289] [2025-03-15 01:54:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:33,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:33,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:33,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:33,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:33,316 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 126 [2025-03-15 01:54:33,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 279 transitions, 3771 flow. Second operand has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:33,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:33,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 126 [2025-03-15 01:54:33,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:33,661 INFO L124 PetriNetUnfolderBase]: 26/381 cut-off events. [2025-03-15 01:54:33,661 INFO L125 PetriNetUnfolderBase]: For 2529/2559 co-relation queries the response was YES. [2025-03-15 01:54:33,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 381 events. 26/381 cut-off events. For 2529/2559 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1475 event pairs, 2 based on Foata normal form. 5/375 useless extension candidates. Maximal degree in co-relation 1941. Up to 172 conditions per place. [2025-03-15 01:54:33,663 INFO L140 encePairwiseOnDemand]: 112/126 looper letters, 101 selfloop transitions, 39 changer transitions 75/297 dead transitions. [2025-03-15 01:54:33,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 297 transitions, 4532 flow [2025-03-15 01:54:33,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 01:54:33,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 01:54:33,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1473 transitions. [2025-03-15 01:54:33,666 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7306547619047619 [2025-03-15 01:54:33,667 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 124 predicate places. [2025-03-15 01:54:33,667 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 297 transitions, 4532 flow [2025-03-15 01:54:33,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:33,667 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:33,667 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] [2025-03-15 01:54:33,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:54:33,667 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:33,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:33,668 INFO L85 PathProgramCache]: Analyzing trace with hash 931839249, now seen corresponding path program 6 times [2025-03-15 01:54:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:33,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470229306] [2025-03-15 01:54:33,668 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:54:33,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:33,684 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:54:33,684 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:33,815 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 01:54:33,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:33,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470229306] [2025-03-15 01:54:33,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470229306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:33,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:33,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:33,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654552384] [2025-03-15 01:54:33,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:33,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:33,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:33,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:33,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:33,816 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 126 [2025-03-15 01:54:33,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 297 transitions, 4532 flow. Second operand has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:33,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:33,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 126 [2025-03-15 01:54:33,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:34,099 INFO L124 PetriNetUnfolderBase]: 28/413 cut-off events. [2025-03-15 01:54:34,099 INFO L125 PetriNetUnfolderBase]: For 3324/3358 co-relation queries the response was YES. [2025-03-15 01:54:34,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 413 events. 28/413 cut-off events. For 3324/3358 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1733 event pairs, 4 based on Foata normal form. 0/401 useless extension candidates. Maximal degree in co-relation 2337. Up to 196 conditions per place. [2025-03-15 01:54:34,102 INFO L140 encePairwiseOnDemand]: 112/126 looper letters, 114 selfloop transitions, 37 changer transitions 84/317 dead transitions. [2025-03-15 01:54:34,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 317 transitions, 5401 flow [2025-03-15 01:54:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 01:54:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 01:54:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1377 transitions. [2025-03-15 01:54:34,104 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2025-03-15 01:54:34,107 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 138 predicate places. [2025-03-15 01:54:34,108 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 317 transitions, 5401 flow [2025-03-15 01:54:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:34,108 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:34,108 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] [2025-03-15 01:54:34,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:54:34,108 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:34,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash 181295815, now seen corresponding path program 7 times [2025-03-15 01:54:34,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:34,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521098519] [2025-03-15 01:54:34,109 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 01:54:34,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:34,238 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 01:54:34,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:34,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521098519] [2025-03-15 01:54:34,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521098519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:34,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:34,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:34,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914153548] [2025-03-15 01:54:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:34,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:34,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:34,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:34,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:34,240 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 126 [2025-03-15 01:54:34,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 317 transitions, 5401 flow. Second operand has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:34,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:34,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 126 [2025-03-15 01:54:34,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:34,535 INFO L124 PetriNetUnfolderBase]: 27/416 cut-off events. [2025-03-15 01:54:34,536 INFO L125 PetriNetUnfolderBase]: For 4142/4212 co-relation queries the response was YES. [2025-03-15 01:54:34,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3275 conditions, 416 events. 27/416 cut-off events. For 4142/4212 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1753 event pairs, 4 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 2530. Up to 196 conditions per place. [2025-03-15 01:54:34,540 INFO L140 encePairwiseOnDemand]: 112/126 looper letters, 106 selfloop transitions, 44 changer transitions 85/317 dead transitions. [2025-03-15 01:54:34,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 317 transitions, 5861 flow [2025-03-15 01:54:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 01:54:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 01:54:34,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1466 transitions. [2025-03-15 01:54:34,542 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7271825396825397 [2025-03-15 01:54:34,542 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 152 predicate places. [2025-03-15 01:54:34,542 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 317 transitions, 5861 flow [2025-03-15 01:54:34,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.66666666666667) internal successors, (807), 9 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:34,543 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:34,543 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] [2025-03-15 01:54:34,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:54:34,543 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:34,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1062263465, now seen corresponding path program 1 times [2025-03-15 01:54:34,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:34,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493565270] [2025-03-15 01:54:34,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:34,783 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 01:54:34,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:34,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493565270] [2025-03-15 01:54:34,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493565270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:34,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11955347] [2025-03-15 01:54:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:34,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:34,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:34,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:34,785 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 126 [2025-03-15 01:54:34,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 317 transitions, 5861 flow. Second operand has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:34,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:34,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 126 [2025-03-15 01:54:34,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:35,191 INFO L124 PetriNetUnfolderBase]: 27/416 cut-off events. [2025-03-15 01:54:35,192 INFO L125 PetriNetUnfolderBase]: For 4777/4843 co-relation queries the response was YES. [2025-03-15 01:54:35,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3531 conditions, 416 events. 27/416 cut-off events. For 4777/4843 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1751 event pairs, 0 based on Foata normal form. 6/412 useless extension candidates. Maximal degree in co-relation 2736. Up to 196 conditions per place. [2025-03-15 01:54:35,194 INFO L140 encePairwiseOnDemand]: 108/126 looper letters, 99 selfloop transitions, 50 changer transitions 101/324 dead transitions. [2025-03-15 01:54:35,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 324 transitions, 6501 flow [2025-03-15 01:54:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 01:54:35,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 01:54:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1965 transitions. [2025-03-15 01:54:35,197 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6780538302277432 [2025-03-15 01:54:35,197 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 172 predicate places. [2025-03-15 01:54:35,198 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 324 transitions, 6501 flow [2025-03-15 01:54:35,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:35,199 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:35,199 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] [2025-03-15 01:54:35,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:54:35,199 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:35,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1395378751, now seen corresponding path program 1 times [2025-03-15 01:54:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170572008] [2025-03-15 01:54:35,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:35,385 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 01:54:35,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:35,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170572008] [2025-03-15 01:54:35,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170572008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:35,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:35,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:35,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75260815] [2025-03-15 01:54:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:35,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:35,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:35,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:35,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:35,387 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 126 [2025-03-15 01:54:35,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 324 transitions, 6501 flow. Second operand has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:35,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:35,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 126 [2025-03-15 01:54:35,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:35,785 INFO L124 PetriNetUnfolderBase]: 27/431 cut-off events. [2025-03-15 01:54:35,785 INFO L125 PetriNetUnfolderBase]: For 5486/5530 co-relation queries the response was YES. [2025-03-15 01:54:35,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3986 conditions, 431 events. 27/431 cut-off events. For 5486/5530 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1885 event pairs, 0 based on Foata normal form. 8/429 useless extension candidates. Maximal degree in co-relation 3141. Up to 207 conditions per place. [2025-03-15 01:54:35,788 INFO L140 encePairwiseOnDemand]: 107/126 looper letters, 122 selfloop transitions, 24 changer transitions 118/338 dead transitions. [2025-03-15 01:54:35,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 338 transitions, 7363 flow [2025-03-15 01:54:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 01:54:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 01:54:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1640 transitions. [2025-03-15 01:54:35,790 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6850459482038429 [2025-03-15 01:54:35,791 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 190 predicate places. [2025-03-15 01:54:35,791 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 338 transitions, 7363 flow [2025-03-15 01:54:35,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:35,791 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:35,791 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] [2025-03-15 01:54:35,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:54:35,792 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash 347405487, now seen corresponding path program 2 times [2025-03-15 01:54:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:35,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096244228] [2025-03-15 01:54:35,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:35,804 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:35,804 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:35,990 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 01:54:35,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096244228] [2025-03-15 01:54:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096244228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:35,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:35,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:35,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665137495] [2025-03-15 01:54:35,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:35,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:35,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:35,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:35,992 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 126 [2025-03-15 01:54:35,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 338 transitions, 7363 flow. Second operand has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:35,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:35,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 126 [2025-03-15 01:54:35,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:36,523 INFO L124 PetriNetUnfolderBase]: 27/437 cut-off events. [2025-03-15 01:54:36,523 INFO L125 PetriNetUnfolderBase]: For 6235/6265 co-relation queries the response was YES. [2025-03-15 01:54:36,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4333 conditions, 437 events. 27/437 cut-off events. For 6235/6265 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1937 event pairs, 0 based on Foata normal form. 6/435 useless extension candidates. Maximal degree in co-relation 3438. Up to 210 conditions per place. [2025-03-15 01:54:36,526 INFO L140 encePairwiseOnDemand]: 107/126 looper letters, 96 selfloop transitions, 27 changer transitions 147/344 dead transitions. [2025-03-15 01:54:36,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 344 transitions, 8025 flow [2025-03-15 01:54:36,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-15 01:54:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-15 01:54:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2395 transitions. [2025-03-15 01:54:36,529 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6788548752834467 [2025-03-15 01:54:36,530 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 216 predicate places. [2025-03-15 01:54:36,530 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 344 transitions, 8025 flow [2025-03-15 01:54:36,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:36,531 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:36,531 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] [2025-03-15 01:54:36,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:54:36,531 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:36,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1197299907, now seen corresponding path program 3 times [2025-03-15 01:54:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:36,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181765628] [2025-03-15 01:54:36,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:54:36,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:36,542 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:54:36,542 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:36,717 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 01:54:36,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181765628] [2025-03-15 01:54:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181765628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:36,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:36,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985022569] [2025-03-15 01:54:36,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:36,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:36,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:36,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:36,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:36,719 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 126 [2025-03-15 01:54:36,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 344 transitions, 8025 flow. Second operand has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:36,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:36,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 126 [2025-03-15 01:54:36,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:37,141 INFO L124 PetriNetUnfolderBase]: 27/436 cut-off events. [2025-03-15 01:54:37,141 INFO L125 PetriNetUnfolderBase]: For 7006/7036 co-relation queries the response was YES. [2025-03-15 01:54:37,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4603 conditions, 436 events. 27/436 cut-off events. For 7006/7036 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1930 event pairs, 0 based on Foata normal form. 6/435 useless extension candidates. Maximal degree in co-relation 3658. Up to 209 conditions per place. [2025-03-15 01:54:37,144 INFO L140 encePairwiseOnDemand]: 107/126 looper letters, 85 selfloop transitions, 17 changer transitions 167/343 dead transitions. [2025-03-15 01:54:37,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 343 transitions, 8521 flow [2025-03-15 01:54:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-15 01:54:37,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-15 01:54:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2062 transitions. [2025-03-15 01:54:37,146 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6818783068783069 [2025-03-15 01:54:37,146 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 239 predicate places. [2025-03-15 01:54:37,146 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 343 transitions, 8521 flow [2025-03-15 01:54:37,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:37,147 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:37,147 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] [2025-03-15 01:54:37,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:54:37,147 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:37,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1998764927, now seen corresponding path program 4 times [2025-03-15 01:54:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421118260] [2025-03-15 01:54:37,148 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:54:37,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:37,160 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:54:37,160 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:37,423 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 01:54:37,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:37,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421118260] [2025-03-15 01:54:37,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421118260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:37,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:37,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:37,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901566894] [2025-03-15 01:54:37,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:37,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:37,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:37,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:37,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:37,425 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 126 [2025-03-15 01:54:37,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 343 transitions, 8521 flow. Second operand has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:37,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:37,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 126 [2025-03-15 01:54:37,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:37,872 INFO L124 PetriNetUnfolderBase]: 32/471 cut-off events. [2025-03-15 01:54:37,872 INFO L125 PetriNetUnfolderBase]: For 8030/8068 co-relation queries the response was YES. [2025-03-15 01:54:37,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5464 conditions, 471 events. 32/471 cut-off events. For 8030/8068 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2253 event pairs, 0 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 4469. Up to 237 conditions per place. [2025-03-15 01:54:37,875 INFO L140 encePairwiseOnDemand]: 107/126 looper letters, 63 selfloop transitions, 38 changer transitions 202/377 dead transitions. [2025-03-15 01:54:37,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 377 transitions, 10149 flow [2025-03-15 01:54:37,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-15 01:54:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-15 01:54:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2057 transitions. [2025-03-15 01:54:37,877 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6802248677248677 [2025-03-15 01:54:37,877 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 261 predicate places. [2025-03-15 01:54:37,877 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 377 transitions, 10149 flow [2025-03-15 01:54:37,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:37,877 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:37,877 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] [2025-03-15 01:54:37,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:54:37,878 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1148870507, now seen corresponding path program 5 times [2025-03-15 01:54:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898266388] [2025-03-15 01:54:37,878 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:54:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:37,888 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:37,888 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:38,054 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 01:54:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:38,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898266388] [2025-03-15 01:54:38,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898266388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:38,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:38,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:38,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844074039] [2025-03-15 01:54:38,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:38,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:38,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:38,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:38,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:38,055 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 126 [2025-03-15 01:54:38,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 377 transitions, 10149 flow. Second operand has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:38,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:38,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 126 [2025-03-15 01:54:38,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:38,638 INFO L124 PetriNetUnfolderBase]: 32/470 cut-off events. [2025-03-15 01:54:38,638 INFO L125 PetriNetUnfolderBase]: For 8941/9001 co-relation queries the response was YES. [2025-03-15 01:54:38,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5719 conditions, 470 events. 32/470 cut-off events. For 8941/9001 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2229 event pairs, 0 based on Foata normal form. 8/476 useless extension candidates. Maximal degree in co-relation 4674. Up to 233 conditions per place. [2025-03-15 01:54:38,641 INFO L140 encePairwiseOnDemand]: 107/126 looper letters, 23 selfloop transitions, 15 changer transitions 265/377 dead transitions. [2025-03-15 01:54:38,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 377 transitions, 10693 flow [2025-03-15 01:54:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-15 01:54:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-15 01:54:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 3061 transitions. [2025-03-15 01:54:38,643 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6748236331569665 [2025-03-15 01:54:38,644 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 294 predicate places. [2025-03-15 01:54:38,644 INFO L471 AbstractCegarLoop]: Abstraction has has 423 places, 377 transitions, 10693 flow [2025-03-15 01:54:38,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:38,644 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:38,644 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] [2025-03-15 01:54:38,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:54:38,644 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1325203279, now seen corresponding path program 6 times [2025-03-15 01:54:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772696289] [2025-03-15 01:54:38,645 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:54:38,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:38,654 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:54:38,654 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:38,806 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 01:54:38,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:38,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772696289] [2025-03-15 01:54:38,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772696289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:38,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:38,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:54:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470821451] [2025-03-15 01:54:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:38,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:54:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:38,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:54:38,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:54:38,808 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 126 [2025-03-15 01:54:38,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 423 places, 377 transitions, 10693 flow. Second operand has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:38,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:38,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 126 [2025-03-15 01:54:38,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:39,257 INFO L124 PetriNetUnfolderBase]: 32/467 cut-off events. [2025-03-15 01:54:39,257 INFO L125 PetriNetUnfolderBase]: For 10001/10053 co-relation queries the response was YES. [2025-03-15 01:54:39,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 467 events. 32/467 cut-off events. For 10001/10053 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2194 event pairs, 0 based on Foata normal form. 8/474 useless extension candidates. Maximal degree in co-relation 4920. Up to 232 conditions per place. [2025-03-15 01:54:39,262 INFO L140 encePairwiseOnDemand]: 108/126 looper letters, 0 selfloop transitions, 0 changer transitions 376/376 dead transitions. [2025-03-15 01:54:39,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 376 transitions, 11249 flow [2025-03-15 01:54:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-15 01:54:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-15 01:54:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 2462 transitions. [2025-03-15 01:54:39,266 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6737821565407772 [2025-03-15 01:54:39,266 INFO L298 CegarLoopForPetriNet]: 129 programPoint places, 314 predicate places. [2025-03-15 01:54:39,266 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 376 transitions, 11249 flow [2025-03-15 01:54:39,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.33333333333333) internal successors, (1012), 12 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:39,272 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/04-mutex_46-escape_nr.i_petrified1_AllErrorsAtOnce [2025-03-15 01:54:39,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-03-15 01:54:39,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-03-15 01:54:39,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-15 01:54:39,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-03-15 01:54:39,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-03-15 01:54:39,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-03-15 01:54:39,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-03-15 01:54:39,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:54:39,366 INFO L422 BasicCegarLoop]: Path program histogram: [7, 6, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:39,370 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:54:39,370 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:54:39,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:54:39 BasicIcfg [2025-03-15 01:54:39,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:54:39,376 INFO L158 Benchmark]: Toolchain (without parser) took 12519.13ms. Allocated memory was 71.3MB in the beginning and 302.0MB in the end (delta: 230.7MB). Free memory was 42.3MB in the beginning and 136.2MB in the end (delta: -93.9MB). Peak memory consumption was 232.5MB. Max. memory is 8.0GB. [2025-03-15 01:54:39,377 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 35.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:39,377 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.19ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 39.5MB in the end (delta: 2.6MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2025-03-15 01:54:39,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:54:39,377 INFO L158 Benchmark]: Boogie Preprocessor took 26.45ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 36.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:39,377 INFO L158 Benchmark]: RCFGBuilder took 299.16ms. Allocated memory is still 71.3MB. Free memory was 35.8MB in the beginning and 20.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:54:39,378 INFO L158 Benchmark]: TraceAbstraction took 11781.75ms. Allocated memory was 71.3MB in the beginning and 302.0MB in the end (delta: 230.7MB). Free memory was 19.6MB in the beginning and 136.2MB in the end (delta: -116.5MB). Peak memory consumption was 211.3MB. Max. memory is 8.0GB. [2025-03-15 01:54:39,379 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.20ms. Allocated memory is still 71.3MB. Free memory is still 35.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 380.19ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 39.5MB in the end (delta: 2.6MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.4MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.45ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 36.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 299.16ms. Allocated memory is still 71.3MB. Free memory was 35.8MB in the beginning and 20.9MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11781.75ms. Allocated memory was 71.3MB in the beginning and 302.0MB in the end (delta: 230.7MB). Free memory was 19.6MB in the beginning and 136.2MB in the end (delta: -116.5MB). Peak memory consumption was 211.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 936]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 936]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 924]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 924]: 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 3 procedures, 145 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1477 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1477 mSDsluCounter, 3131 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2573 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5271 IncrementalHoareTripleChecker+Invalid, 5332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 558 mSDtfsCounter, 5271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 428 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 398 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11249occurred in iteration=20, InterpolantAutomatonStates: 360, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1958 NumberOfCodeBlocks, 1958 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1938 ConstructedInterpolants, 0 QuantifiedInterpolants, 5048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:54:39,395 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...