/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:28:19,675 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:28:19,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 02:28:19,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:28:19,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:28:19,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:28:19,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:28:19,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:28:19,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:28:19,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:28:19,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:28:19,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:28:19,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:28:19,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:28:19,778 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:28:19,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:28:19,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 02:28:20,030 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:28:20,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:28:20,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:28:20,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:28:20,041 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:28:20,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2025-03-15 02:28:21,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2696462/b7aa577ddc0143ddbe77b5e4a709198b/FLAGbf7946631 [2025-03-15 02:28:21,475 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:28:21,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-node-symm.wvr.c [2025-03-15 02:28:21,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2696462/b7aa577ddc0143ddbe77b5e4a709198b/FLAGbf7946631 [2025-03-15 02:28:21,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2696462/b7aa577ddc0143ddbe77b5e4a709198b [2025-03-15 02:28:21,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:28:21,841 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:28:21,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:28:21,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:28:21,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:28:21,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:28:21" (1/1) ... [2025-03-15 02:28:21,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9ad943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:21, skipping insertion in model container [2025-03-15 02:28:21,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:28:21" (1/1) ... [2025-03-15 02:28:21,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:28:22,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:28:22,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:28:22,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:28:22,122 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:28:22,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22 WrapperNode [2025-03-15 02:28:22,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:28:22,125 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:28:22,125 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:28:22,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:28:22,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,174 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 325 [2025-03-15 02:28:22,175 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:28:22,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:28:22,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:28:22,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:28:22,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,186 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,187 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,203 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:28:22,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:28:22,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:28:22,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:28:22,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (1/1) ... [2025-03-15 02:28:22,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:28:22,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:22,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 02:28:22,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 02:28:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:28:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:28:22,271 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:28:22,271 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:28:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:28:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:28:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:28:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:28:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:28:22,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:28:22,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:28:22,273 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 02:28:22,355 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:28:22,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:28:22,813 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:28:22,813 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:28:22,834 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:28:22,834 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:28:22,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:28:22 BoogieIcfgContainer [2025-03-15 02:28:22,835 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:28:22,839 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:28:22,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:28:22,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:28:22,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:28:21" (1/3) ... [2025-03-15 02:28:22,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369c115a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:28:22, skipping insertion in model container [2025-03-15 02:28:22,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:28:22" (2/3) ... [2025-03-15 02:28:22,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@369c115a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:28:22, skipping insertion in model container [2025-03-15 02:28:22,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:28:22" (3/3) ... [2025-03-15 02:28:22,845 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-03-15 02:28:22,857 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:28:22,859 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 433 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-03-15 02:28:22,859 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:28:22,949 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:28:22,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:28:23,000 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;@74484ec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:28:23,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-03-15 02:28:23,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:28:23,033 INFO L124 PetriNetUnfolderBase]: 3/78 cut-off events. [2025-03-15 02:28:23,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:28:23,034 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:23,035 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:23,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:23,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:23,041 INFO L85 PathProgramCache]: Analyzing trace with hash -12035198, now seen corresponding path program 1 times [2025-03-15 02:28:23,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:23,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194761450] [2025-03-15 02:28:23,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:23,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:23,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194761450] [2025-03-15 02:28:23,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194761450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:23,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:23,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600894551] [2025-03-15 02:28:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:23,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:23,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:23,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:23,385 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 460 [2025-03-15 02:28:23,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 460 transitions, 934 flow. Second operand has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:23,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:23,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 460 [2025-03-15 02:28:23,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:23,694 INFO L124 PetriNetUnfolderBase]: 43/745 cut-off events. [2025-03-15 02:28:23,695 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-03-15 02:28:23,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 820 conditions, 745 events. 43/745 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2716 event pairs, 15 based on Foata normal form. 30/669 useless extension candidates. Maximal degree in co-relation 505. Up to 54 conditions per place. [2025-03-15 02:28:23,710 INFO L140 encePairwiseOnDemand]: 436/460 looper letters, 22 selfloop transitions, 3 changer transitions 22/431 dead transitions. [2025-03-15 02:28:23,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 431 transitions, 926 flow [2025-03-15 02:28:23,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:28:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:28:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1695 transitions. [2025-03-15 02:28:23,731 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9211956521739131 [2025-03-15 02:28:23,735 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, -10 predicate places. [2025-03-15 02:28:23,735 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 431 transitions, 926 flow [2025-03-15 02:28:23,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:23,736 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:23,737 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:23,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:28:23,739 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:23,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:23,740 INFO L85 PathProgramCache]: Analyzing trace with hash -373090308, now seen corresponding path program 1 times [2025-03-15 02:28:23,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:23,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761261681] [2025-03-15 02:28:23,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:23,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761261681] [2025-03-15 02:28:23,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761261681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:23,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:23,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:28:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609703713] [2025-03-15 02:28:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:23,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:28:23,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:23,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:28:23,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:28:23,969 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 460 [2025-03-15 02:28:23,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 431 transitions, 926 flow. Second operand has 5 states, 5 states have (on average 339.4) internal successors, (1697), 5 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:23,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:23,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 460 [2025-03-15 02:28:23,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:24,159 INFO L124 PetriNetUnfolderBase]: 43/743 cut-off events. [2025-03-15 02:28:24,159 INFO L125 PetriNetUnfolderBase]: For 56/64 co-relation queries the response was YES. [2025-03-15 02:28:24,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 949 conditions, 743 events. 43/743 cut-off events. For 56/64 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2706 event pairs, 15 based on Foata normal form. 0/639 useless extension candidates. Maximal degree in co-relation 536. Up to 113 conditions per place. [2025-03-15 02:28:24,168 INFO L140 encePairwiseOnDemand]: 451/460 looper letters, 78 selfloop transitions, 5 changer transitions 22/429 dead transitions. [2025-03-15 02:28:24,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 429 transitions, 1122 flow [2025-03-15 02:28:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:28:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:28:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2114 transitions. [2025-03-15 02:28:24,174 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7659420289855072 [2025-03-15 02:28:24,175 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, -7 predicate places. [2025-03-15 02:28:24,175 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 429 transitions, 1122 flow [2025-03-15 02:28:24,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 339.4) internal successors, (1697), 5 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:24,176 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:24,176 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 02:28:24,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:28:24,177 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:24,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2085870249, now seen corresponding path program 1 times [2025-03-15 02:28:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:24,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501443731] [2025-03-15 02:28:24,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:24,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:24,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:24,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501443731] [2025-03-15 02:28:24,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501443731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:24,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:24,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:24,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805480920] [2025-03-15 02:28:24,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:24,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:24,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:24,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:24,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:24,358 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 460 [2025-03-15 02:28:24,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 429 transitions, 1122 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:24,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:24,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 460 [2025-03-15 02:28:24,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:24,626 INFO L124 PetriNetUnfolderBase]: 45/767 cut-off events. [2025-03-15 02:28:24,626 INFO L125 PetriNetUnfolderBase]: For 87/95 co-relation queries the response was YES. [2025-03-15 02:28:24,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 767 events. 45/767 cut-off events. For 87/95 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2774 event pairs, 15 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 540. Up to 113 conditions per place. [2025-03-15 02:28:24,630 INFO L140 encePairwiseOnDemand]: 446/460 looper letters, 39 selfloop transitions, 10 changer transitions 22/447 dead transitions. [2025-03-15 02:28:24,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 447 transitions, 1258 flow [2025-03-15 02:28:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:28:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:28:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2099 transitions. [2025-03-15 02:28:24,641 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.912608695652174 [2025-03-15 02:28:24,642 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, -3 predicate places. [2025-03-15 02:28:24,642 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 447 transitions, 1258 flow [2025-03-15 02:28:24,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:24,643 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:24,643 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:24,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:28:24,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:24,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1338190970, now seen corresponding path program 1 times [2025-03-15 02:28:24,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:24,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322067319] [2025-03-15 02:28:24,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:24,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322067319] [2025-03-15 02:28:24,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322067319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:24,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:24,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257431870] [2025-03-15 02:28:24,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:24,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:24,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:24,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:24,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:24,775 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 460 [2025-03-15 02:28:24,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 447 transitions, 1258 flow. Second operand has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:24,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:24,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 460 [2025-03-15 02:28:24,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:24,959 INFO L124 PetriNetUnfolderBase]: 69/873 cut-off events. [2025-03-15 02:28:24,959 INFO L125 PetriNetUnfolderBase]: For 234/254 co-relation queries the response was YES. [2025-03-15 02:28:24,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 873 events. 69/873 cut-off events. For 234/254 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3660 event pairs, 39 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 700. Up to 128 conditions per place. [2025-03-15 02:28:24,968 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 22 selfloop transitions, 3 changer transitions 22/445 dead transitions. [2025-03-15 02:28:24,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 445 transitions, 1306 flow [2025-03-15 02:28:24,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:28:24,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:28:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1676 transitions. [2025-03-15 02:28:24,973 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9108695652173913 [2025-03-15 02:28:24,975 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, -2 predicate places. [2025-03-15 02:28:24,975 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 445 transitions, 1306 flow [2025-03-15 02:28:24,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:24,976 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:24,977 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:24,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:28:24,977 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:24,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:24,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1465752272, now seen corresponding path program 1 times [2025-03-15 02:28:24,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:24,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165188896] [2025-03-15 02:28:24,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:25,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:25,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:25,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165188896] [2025-03-15 02:28:25,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165188896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:25,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:25,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 02:28:25,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158787796] [2025-03-15 02:28:25,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:25,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:28:25,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:25,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:28:25,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:28:25,221 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 460 [2025-03-15 02:28:25,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 445 transitions, 1306 flow. Second operand has 8 states, 8 states have (on average 315.375) internal successors, (2523), 8 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:25,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:25,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 460 [2025-03-15 02:28:25,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:25,439 INFO L124 PetriNetUnfolderBase]: 68/871 cut-off events. [2025-03-15 02:28:25,439 INFO L125 PetriNetUnfolderBase]: For 402/441 co-relation queries the response was YES. [2025-03-15 02:28:25,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 871 events. 68/871 cut-off events. For 402/441 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3637 event pairs, 39 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 743. Up to 147 conditions per place. [2025-03-15 02:28:25,444 INFO L140 encePairwiseOnDemand]: 448/460 looper letters, 107 selfloop transitions, 11 changer transitions 22/443 dead transitions. [2025-03-15 02:28:25,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 443 transitions, 1572 flow [2025-03-15 02:28:25,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:28:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:28:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2612 transitions. [2025-03-15 02:28:25,452 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7097826086956521 [2025-03-15 02:28:25,452 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 5 predicate places. [2025-03-15 02:28:25,452 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 443 transitions, 1572 flow [2025-03-15 02:28:25,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 315.375) internal successors, (2523), 8 states have internal predecessors, (2523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:25,453 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:25,453 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:25,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:28:25,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:25,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:25,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1658909374, now seen corresponding path program 1 times [2025-03-15 02:28:25,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500837516] [2025-03-15 02:28:25,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:25,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:25,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500837516] [2025-03-15 02:28:25,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500837516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:25,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278148645] [2025-03-15 02:28:25,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:25,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:25,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:25,570 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:25,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 02:28:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:25,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:25,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:25,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:28:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278148645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:25,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:28:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:28:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687813444] [2025-03-15 02:28:25,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:25,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:28:25,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:25,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:28:25,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:28:25,727 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 460 [2025-03-15 02:28:25,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 443 transitions, 1572 flow. Second operand has 6 states, 6 states have (on average 411.1666666666667) internal successors, (2467), 6 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:25,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:25,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 460 [2025-03-15 02:28:25,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:25,912 INFO L124 PetriNetUnfolderBase]: 68/869 cut-off events. [2025-03-15 02:28:25,912 INFO L125 PetriNetUnfolderBase]: For 533/572 co-relation queries the response was YES. [2025-03-15 02:28:25,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 869 events. 68/869 cut-off events. For 533/572 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3618 event pairs, 39 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 750. Up to 147 conditions per place. [2025-03-15 02:28:25,919 INFO L140 encePairwiseOnDemand]: 448/460 looper letters, 30 selfloop transitions, 15 changer transitions 22/441 dead transitions. [2025-03-15 02:28:25,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 441 transitions, 1656 flow [2025-03-15 02:28:25,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:28:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:28:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2911 transitions. [2025-03-15 02:28:25,937 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9040372670807454 [2025-03-15 02:28:25,938 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 9 predicate places. [2025-03-15 02:28:25,938 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 441 transitions, 1656 flow [2025-03-15 02:28:25,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 411.1666666666667) internal successors, (2467), 6 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:25,939 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:25,939 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:25,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-15 02:28:26,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:26,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:26,143 INFO L85 PathProgramCache]: Analyzing trace with hash -113415986, now seen corresponding path program 1 times [2025-03-15 02:28:26,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:26,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417268497] [2025-03-15 02:28:26,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:26,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:26,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417268497] [2025-03-15 02:28:26,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417268497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:26,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317798098] [2025-03-15 02:28:26,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:26,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:26,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:26,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 02:28:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:26,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:26,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:26,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:26,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317798098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:26,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:26,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:28:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649590216] [2025-03-15 02:28:26,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:26,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:28:26,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:26,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:28:26,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:26,428 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 460 [2025-03-15 02:28:26,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 441 transitions, 1656 flow. Second operand has 12 states, 12 states have (on average 411.8333333333333) internal successors, (4942), 12 states have internal predecessors, (4942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:26,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:26,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 460 [2025-03-15 02:28:26,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:26,747 INFO L124 PetriNetUnfolderBase]: 74/939 cut-off events. [2025-03-15 02:28:26,747 INFO L125 PetriNetUnfolderBase]: For 761/800 co-relation queries the response was YES. [2025-03-15 02:28:26,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1808 conditions, 939 events. 74/939 cut-off events. For 761/800 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3820 event pairs, 39 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 1001. Up to 165 conditions per place. [2025-03-15 02:28:26,752 INFO L140 encePairwiseOnDemand]: 446/460 looper letters, 62 selfloop transitions, 35 changer transitions 22/493 dead transitions. [2025-03-15 02:28:26,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 493 transitions, 2236 flow [2025-03-15 02:28:26,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:28:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:28:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 5830 transitions. [2025-03-15 02:28:26,761 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.90527950310559 [2025-03-15 02:28:26,761 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 22 predicate places. [2025-03-15 02:28:26,761 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 493 transitions, 2236 flow [2025-03-15 02:28:26,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 411.8333333333333) internal successors, (4942), 12 states have internal predecessors, (4942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:26,763 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:26,763 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:26,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 02:28:26,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-15 02:28:26,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:26,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:26,969 INFO L85 PathProgramCache]: Analyzing trace with hash 635951355, now seen corresponding path program 1 times [2025-03-15 02:28:26,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:26,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777677573] [2025-03-15 02:28:26,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:26,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:27,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777677573] [2025-03-15 02:28:27,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777677573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:27,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:27,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:28:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450025667] [2025-03-15 02:28:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:27,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:28:27,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:27,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:28:27,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:28:27,077 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 460 [2025-03-15 02:28:27,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 493 transitions, 2236 flow. Second operand has 5 states, 5 states have (on average 341.8) internal successors, (1709), 5 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:27,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:27,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 460 [2025-03-15 02:28:27,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:27,232 INFO L124 PetriNetUnfolderBase]: 74/937 cut-off events. [2025-03-15 02:28:27,232 INFO L125 PetriNetUnfolderBase]: For 932/994 co-relation queries the response was YES. [2025-03-15 02:28:27,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 937 events. 74/937 cut-off events. For 932/994 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3799 event pairs, 39 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 1086. Up to 165 conditions per place. [2025-03-15 02:28:27,237 INFO L140 encePairwiseOnDemand]: 452/460 looper letters, 78 selfloop transitions, 5 changer transitions 22/491 dead transitions. [2025-03-15 02:28:27,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 491 transitions, 2432 flow [2025-03-15 02:28:27,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:28:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:28:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2114 transitions. [2025-03-15 02:28:27,242 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7659420289855072 [2025-03-15 02:28:27,242 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 25 predicate places. [2025-03-15 02:28:27,242 INFO L471 AbstractCegarLoop]: Abstraction has has 464 places, 491 transitions, 2432 flow [2025-03-15 02:28:27,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 341.8) internal successors, (1709), 5 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:27,243 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:27,243 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:27,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:28:27,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:27,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:27,244 INFO L85 PathProgramCache]: Analyzing trace with hash 561200623, now seen corresponding path program 2 times [2025-03-15 02:28:27,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:27,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594618690] [2025-03-15 02:28:27,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:27,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:27,259 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:27,259 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:28:27,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:27,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594618690] [2025-03-15 02:28:27,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594618690] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:27,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577740097] [2025-03-15 02:28:27,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:27,333 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:27,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 02:28:27,404 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:27,405 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:27,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:28:27,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:28:27,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:28:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577740097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:27,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:27,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:28:27,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614528958] [2025-03-15 02:28:27,603 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:27,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:28:27,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:27,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:28:27,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:28:27,606 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 460 [2025-03-15 02:28:27,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 491 transitions, 2432 flow. Second operand has 7 states, 7 states have (on average 381.57142857142856) internal successors, (2671), 7 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:27,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:27,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 460 [2025-03-15 02:28:27,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:27,915 INFO L124 PetriNetUnfolderBase]: 74/939 cut-off events. [2025-03-15 02:28:27,916 INFO L125 PetriNetUnfolderBase]: For 1296/1377 co-relation queries the response was YES. [2025-03-15 02:28:27,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 939 events. 74/939 cut-off events. For 1296/1377 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3804 event pairs, 39 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 1208. Up to 166 conditions per place. [2025-03-15 02:28:27,921 INFO L140 encePairwiseOnDemand]: 439/460 looper letters, 84 selfloop transitions, 40 changer transitions 22/491 dead transitions. [2025-03-15 02:28:27,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 491 transitions, 2684 flow [2025-03-15 02:28:27,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:28:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:28:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 4981 transitions. [2025-03-15 02:28:27,929 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8329431438127091 [2025-03-15 02:28:27,929 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 36 predicate places. [2025-03-15 02:28:27,930 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 491 transitions, 2684 flow [2025-03-15 02:28:27,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 381.57142857142856) internal successors, (2671), 7 states have internal predecessors, (2671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:27,930 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:27,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:27,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:28,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:28,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:28,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1095740561, now seen corresponding path program 1 times [2025-03-15 02:28:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257938858] [2025-03-15 02:28:28,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:28,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:28,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257938858] [2025-03-15 02:28:28,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257938858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:28,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:28,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501759861] [2025-03-15 02:28:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:28,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:28,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:28,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:28,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:28,203 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 460 [2025-03-15 02:28:28,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 491 transitions, 2684 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:28,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:28,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 460 [2025-03-15 02:28:28,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:28,345 INFO L124 PetriNetUnfolderBase]: 76/963 cut-off events. [2025-03-15 02:28:28,345 INFO L125 PetriNetUnfolderBase]: For 1473/1554 co-relation queries the response was YES. [2025-03-15 02:28:28,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2213 conditions, 963 events. 76/963 cut-off events. For 1473/1554 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3933 event pairs, 39 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 1279. Up to 166 conditions per place. [2025-03-15 02:28:28,351 INFO L140 encePairwiseOnDemand]: 446/460 looper letters, 39 selfloop transitions, 10 changer transitions 22/509 dead transitions. [2025-03-15 02:28:28,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 509 transitions, 2820 flow [2025-03-15 02:28:28,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:28:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:28:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2099 transitions. [2025-03-15 02:28:28,354 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.912608695652174 [2025-03-15 02:28:28,354 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 40 predicate places. [2025-03-15 02:28:28,354 INFO L471 AbstractCegarLoop]: Abstraction has has 479 places, 509 transitions, 2820 flow [2025-03-15 02:28:28,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:28,355 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:28,355 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:28,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:28:28,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:28,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:28,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1268873776, now seen corresponding path program 1 times [2025-03-15 02:28:28,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:28,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108753560] [2025-03-15 02:28:28,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:28,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108753560] [2025-03-15 02:28:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108753560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266375418] [2025-03-15 02:28:28,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:28,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:28,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:28,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 02:28:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:28,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:28:28,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:28,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266375418] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:29,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:29,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13, 13] total 25 [2025-03-15 02:28:29,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587984982] [2025-03-15 02:28:29,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:29,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-15 02:28:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:29,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-15 02:28:29,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-03-15 02:28:29,215 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 460 [2025-03-15 02:28:29,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 509 transitions, 2820 flow. Second operand has 25 states, 25 states have (on average 346.04) internal successors, (8651), 25 states have internal predecessors, (8651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:29,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:29,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 460 [2025-03-15 02:28:29,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:30,312 INFO L124 PetriNetUnfolderBase]: 146/1764 cut-off events. [2025-03-15 02:28:30,313 INFO L125 PetriNetUnfolderBase]: For 3631/3829 co-relation queries the response was YES. [2025-03-15 02:28:30,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4274 conditions, 1764 events. 146/1764 cut-off events. For 3631/3829 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 10457 event pairs, 78 based on Foata normal form. 0/1523 useless extension candidates. Maximal degree in co-relation 2316. Up to 312 conditions per place. [2025-03-15 02:28:30,324 INFO L140 encePairwiseOnDemand]: 425/460 looper letters, 219 selfloop transitions, 75 changer transitions 23/625 dead transitions. [2025-03-15 02:28:30,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 625 transitions, 4408 flow [2025-03-15 02:28:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-15 02:28:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-15 02:28:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 12827 transitions. [2025-03-15 02:28:30,344 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7536427732079906 [2025-03-15 02:28:30,344 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 74 predicate places. [2025-03-15 02:28:30,344 INFO L471 AbstractCegarLoop]: Abstraction has has 513 places, 625 transitions, 4408 flow [2025-03-15 02:28:30,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 346.04) internal successors, (8651), 25 states have internal predecessors, (8651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:30,349 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:30,349 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:30,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 02:28:30,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:30,551 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:30,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:30,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1850692978, now seen corresponding path program 1 times [2025-03-15 02:28:30,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:30,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265323364] [2025-03-15 02:28:30,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:30,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:30,783 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:30,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:30,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265323364] [2025-03-15 02:28:30,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265323364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:30,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856354709] [2025-03-15 02:28:30,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:30,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:30,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:30,789 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:30,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 02:28:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:30,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-15 02:28:30,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:31,031 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:31,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:31,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856354709] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:31,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:31,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-03-15 02:28:31,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757716974] [2025-03-15 02:28:31,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:31,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 02:28:31,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:31,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 02:28:31,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-03-15 02:28:31,219 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 460 [2025-03-15 02:28:31,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 625 transitions, 4408 flow. Second operand has 24 states, 24 states have (on average 412.6666666666667) internal successors, (9904), 24 states have internal predecessors, (9904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:31,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:31,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 460 [2025-03-15 02:28:31,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:32,067 INFO L124 PetriNetUnfolderBase]: 164/1980 cut-off events. [2025-03-15 02:28:32,067 INFO L125 PetriNetUnfolderBase]: For 5041/5239 co-relation queries the response was YES. [2025-03-15 02:28:32,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5747 conditions, 1980 events. 164/1980 cut-off events. For 5041/5239 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 12170 event pairs, 78 based on Foata normal form. 0/1721 useless extension candidates. Maximal degree in co-relation 3758. Up to 384 conditions per place. [2025-03-15 02:28:32,087 INFO L140 encePairwiseOnDemand]: 447/460 looper letters, 187 selfloop transitions, 125 changer transitions 23/787 dead transitions. [2025-03-15 02:28:32,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 787 transitions, 7196 flow [2025-03-15 02:28:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-15 02:28:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-15 02:28:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13299 transitions. [2025-03-15 02:28:32,099 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9034646739130435 [2025-03-15 02:28:32,099 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 105 predicate places. [2025-03-15 02:28:32,099 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 787 transitions, 7196 flow [2025-03-15 02:28:32,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 412.6666666666667) internal successors, (9904), 24 states have internal predecessors, (9904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:32,102 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:32,102 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:32,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:32,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-15 02:28:32,303 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1694116888, now seen corresponding path program 1 times [2025-03-15 02:28:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279940598] [2025-03-15 02:28:32,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:32,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-15 02:28:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279940598] [2025-03-15 02:28:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279940598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221485817] [2025-03-15 02:28:32,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:32,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:32,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:32,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:32,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 02:28:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:32,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:32,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-15 02:28:32,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:32,595 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-15 02:28:32,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221485817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:32,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:32,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:28:32,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406271145] [2025-03-15 02:28:32,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:32,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:28:32,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:32,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:28:32,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:32,598 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 460 [2025-03-15 02:28:32,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 787 transitions, 7196 flow. Second operand has 12 states, 12 states have (on average 411.8333333333333) internal successors, (4942), 12 states have internal predecessors, (4942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:32,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:32,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 460 [2025-03-15 02:28:32,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:33,091 INFO L124 PetriNetUnfolderBase]: 173/2085 cut-off events. [2025-03-15 02:28:33,091 INFO L125 PetriNetUnfolderBase]: For 5577/5775 co-relation queries the response was YES. [2025-03-15 02:28:33,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6202 conditions, 2085 events. 173/2085 cut-off events. For 5577/5775 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13095 event pairs, 78 based on Foata normal form. 0/1817 useless extension candidates. Maximal degree in co-relation 4182. Up to 384 conditions per place. [2025-03-15 02:28:33,116 INFO L140 encePairwiseOnDemand]: 446/460 looper letters, 107 selfloop transitions, 60 changer transitions 23/865 dead transitions. [2025-03-15 02:28:33,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 865 transitions, 8002 flow [2025-03-15 02:28:33,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:28:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:28:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 5832 transitions. [2025-03-15 02:28:33,121 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9055900621118013 [2025-03-15 02:28:33,122 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 118 predicate places. [2025-03-15 02:28:33,122 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 865 transitions, 8002 flow [2025-03-15 02:28:33,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 411.8333333333333) internal successors, (4942), 12 states have internal predecessors, (4942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:33,123 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:33,123 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:33,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:33,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:33,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:33,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:33,329 INFO L85 PathProgramCache]: Analyzing trace with hash -347456757, now seen corresponding path program 2 times [2025-03-15 02:28:33,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:33,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499965042] [2025-03-15 02:28:33,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:33,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:33,348 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:33,348 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:33,424 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-15 02:28:33,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499965042] [2025-03-15 02:28:33,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499965042] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:33,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102101811] [2025-03-15 02:28:33,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:33,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:33,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:33,426 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:33,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 02:28:33,510 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:33,510 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:33,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:28:33,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-15 02:28:33,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-15 02:28:33,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102101811] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:33,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:33,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:28:33,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699806526] [2025-03-15 02:28:33,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:33,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:28:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:33,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:28:33,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:28:33,786 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 460 [2025-03-15 02:28:33,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 865 transitions, 8002 flow. Second operand has 7 states, 7 states have (on average 383.85714285714283) internal successors, (2687), 7 states have internal predecessors, (2687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:33,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:33,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 460 [2025-03-15 02:28:33,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:34,205 INFO L124 PetriNetUnfolderBase]: 173/2084 cut-off events. [2025-03-15 02:28:34,205 INFO L125 PetriNetUnfolderBase]: For 6422/6656 co-relation queries the response was YES. [2025-03-15 02:28:34,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 2084 events. 173/2084 cut-off events. For 6422/6656 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13091 event pairs, 78 based on Foata normal form. 0/1817 useless extension candidates. Maximal degree in co-relation 4377. Up to 384 conditions per place. [2025-03-15 02:28:34,220 INFO L140 encePairwiseOnDemand]: 438/460 looper letters, 144 selfloop transitions, 65 changer transitions 23/864 dead transitions. [2025-03-15 02:28:34,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 864 transitions, 8416 flow [2025-03-15 02:28:34,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:28:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:28:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 5007 transitions. [2025-03-15 02:28:34,223 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8372909698996656 [2025-03-15 02:28:34,223 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 129 predicate places. [2025-03-15 02:28:34,223 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 864 transitions, 8416 flow [2025-03-15 02:28:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 383.85714285714283) internal successors, (2687), 7 states have internal predecessors, (2687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:34,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:34,224 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:34,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 02:28:34,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:34,425 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:34,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:34,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1840084574, now seen corresponding path program 1 times [2025-03-15 02:28:34,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:34,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121404983] [2025-03-15 02:28:34,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:34,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:34,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:34,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:34,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121404983] [2025-03-15 02:28:34,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121404983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:34,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:34,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:34,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700302203] [2025-03-15 02:28:34,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:34,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:34,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:34,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:34,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:34,503 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 460 [2025-03-15 02:28:34,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 864 transitions, 8416 flow. Second operand has 4 states, 4 states have (on average 414.5) internal successors, (1658), 4 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:34,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:34,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 460 [2025-03-15 02:28:34,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:34,871 INFO L124 PetriNetUnfolderBase]: 245/2416 cut-off events. [2025-03-15 02:28:34,871 INFO L125 PetriNetUnfolderBase]: For 14336/14570 co-relation queries the response was YES. [2025-03-15 02:28:34,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8259 conditions, 2416 events. 245/2416 cut-off events. For 14336/14570 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 16754 event pairs, 104 based on Foata normal form. 0/2109 useless extension candidates. Maximal degree in co-relation 4501. Up to 446 conditions per place. [2025-03-15 02:28:34,910 INFO L140 encePairwiseOnDemand]: 452/460 looper letters, 39 selfloop transitions, 5 changer transitions 23/878 dead transitions. [2025-03-15 02:28:34,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 878 transitions, 8660 flow [2025-03-15 02:28:34,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:28:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:28:34,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1695 transitions. [2025-03-15 02:28:34,912 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9211956521739131 [2025-03-15 02:28:34,912 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 131 predicate places. [2025-03-15 02:28:34,913 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 878 transitions, 8660 flow [2025-03-15 02:28:34,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.5) internal successors, (1658), 4 states have internal predecessors, (1658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:34,913 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:34,913 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:34,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:28:34,913 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:34,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1208048054, now seen corresponding path program 1 times [2025-03-15 02:28:34,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:34,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051927120] [2025-03-15 02:28:34,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:34,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:35,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051927120] [2025-03-15 02:28:35,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051927120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:35,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034201243] [2025-03-15 02:28:35,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:35,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:35,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:35,121 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:35,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 02:28:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:35,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 02:28:35,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:35,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:35,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:28:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034201243] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 02:28:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2025-03-15 02:28:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922797866] [2025-03-15 02:28:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:35,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:28:35,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:35,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:28:35,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-15 02:28:35,486 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2025-03-15 02:28:35,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 878 transitions, 8660 flow. Second operand has 9 states, 9 states have (on average 367.44444444444446) internal successors, (3307), 9 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:35,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:35,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2025-03-15 02:28:35,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:35,974 INFO L124 PetriNetUnfolderBase]: 243/2409 cut-off events. [2025-03-15 02:28:35,974 INFO L125 PetriNetUnfolderBase]: For 16976/17246 co-relation queries the response was YES. [2025-03-15 02:28:35,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8770 conditions, 2409 events. 243/2409 cut-off events. For 16976/17246 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 16443 event pairs, 104 based on Foata normal form. 0/2104 useless extension candidates. Maximal degree in co-relation 4847. Up to 447 conditions per place. [2025-03-15 02:28:36,002 INFO L140 encePairwiseOnDemand]: 444/460 looper letters, 341 selfloop transitions, 46 changer transitions 23/873 dead transitions. [2025-03-15 02:28:36,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 873 transitions, 9388 flow [2025-03-15 02:28:36,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:28:36,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:28:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3689 transitions. [2025-03-15 02:28:36,005 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8019565217391305 [2025-03-15 02:28:36,005 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 139 predicate places. [2025-03-15 02:28:36,005 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 873 transitions, 9388 flow [2025-03-15 02:28:36,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 367.44444444444446) internal successors, (3307), 9 states have internal predecessors, (3307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:36,006 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:36,007 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:36,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 02:28:36,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-15 02:28:36,212 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 530927959, now seen corresponding path program 1 times [2025-03-15 02:28:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096712934] [2025-03-15 02:28:36,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:28:36,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096712934] [2025-03-15 02:28:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096712934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 02:28:36,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868894402] [2025-03-15 02:28:36,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:36,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:28:36,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:36,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:28:36,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:28:36,446 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 460 [2025-03-15 02:28:36,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 873 transitions, 9388 flow. Second operand has 8 states, 8 states have (on average 322.25) internal successors, (2578), 8 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:36,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:36,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 460 [2025-03-15 02:28:36,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:36,899 INFO L124 PetriNetUnfolderBase]: 241/2399 cut-off events. [2025-03-15 02:28:36,899 INFO L125 PetriNetUnfolderBase]: For 19424/19746 co-relation queries the response was YES. [2025-03-15 02:28:36,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9245 conditions, 2399 events. 241/2399 cut-off events. For 19424/19746 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16148 event pairs, 104 based on Foata normal form. 0/2096 useless extension candidates. Maximal degree in co-relation 5143. Up to 441 conditions per place. [2025-03-15 02:28:36,922 INFO L140 encePairwiseOnDemand]: 448/460 looper letters, 292 selfloop transitions, 17 changer transitions 23/867 dead transitions. [2025-03-15 02:28:36,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 867 transitions, 9938 flow [2025-03-15 02:28:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:28:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:28:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2612 transitions. [2025-03-15 02:28:36,924 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7097826086956521 [2025-03-15 02:28:36,924 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 144 predicate places. [2025-03-15 02:28:36,924 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 867 transitions, 9938 flow [2025-03-15 02:28:36,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 322.25) internal successors, (2578), 8 states have internal predecessors, (2578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:36,925 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:36,925 INFO L221 CegarLoopForPetriNet]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:36,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:28:36,925 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:36,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash -401104424, now seen corresponding path program 2 times [2025-03-15 02:28:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2828830] [2025-03-15 02:28:36,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:36,948 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:36,948 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:37,023 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-15 02:28:37,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2828830] [2025-03-15 02:28:37,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2828830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:37,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770011182] [2025-03-15 02:28:37,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:28:37,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:37,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:37,027 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:37,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 02:28:37,121 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:28:37,121 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:28:37,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:28:37,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-15 02:28:37,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-03-15 02:28:37,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770011182] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:37,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:28:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405768064] [2025-03-15 02:28:37,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:37,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:28:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:37,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:28:37,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:28:37,435 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 460 [2025-03-15 02:28:37,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 867 transitions, 9938 flow. Second operand has 7 states, 7 states have (on average 384.14285714285717) internal successors, (2689), 7 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:37,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:37,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 460 [2025-03-15 02:28:37,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:38,000 INFO L124 PetriNetUnfolderBase]: 241/2397 cut-off events. [2025-03-15 02:28:38,000 INFO L125 PetriNetUnfolderBase]: For 21960/22326 co-relation queries the response was YES. [2025-03-15 02:28:38,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9735 conditions, 2397 events. 241/2397 cut-off events. For 21960/22326 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16123 event pairs, 104 based on Foata normal form. 0/2096 useless extension candidates. Maximal degree in co-relation 5468. Up to 441 conditions per place. [2025-03-15 02:28:38,019 INFO L140 encePairwiseOnDemand]: 442/460 looper letters, 223 selfloop transitions, 120 changer transitions 23/865 dead transitions. [2025-03-15 02:28:38,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 865 transitions, 10600 flow [2025-03-15 02:28:38,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:28:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:28:38,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4221 transitions. [2025-03-15 02:28:38,021 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8341897233201581 [2025-03-15 02:28:38,022 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 153 predicate places. [2025-03-15 02:28:38,022 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 865 transitions, 10600 flow [2025-03-15 02:28:38,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 384.14285714285717) internal successors, (2689), 7 states have internal predecessors, (2689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:38,022 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:38,022 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:38,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:38,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 02:28:38,227 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:38,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:38,228 INFO L85 PathProgramCache]: Analyzing trace with hash 22045550, now seen corresponding path program 1 times [2025-03-15 02:28:38,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:38,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627259582] [2025-03-15 02:28:38,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:38,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:38,388 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:28:38,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:38,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627259582] [2025-03-15 02:28:38,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627259582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:38,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962400283] [2025-03-15 02:28:38,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:38,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:38,391 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:38,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-15 02:28:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:38,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 02:28:38,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:28:38,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:28:38,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962400283] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:38,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-15 02:28:38,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 16 [2025-03-15 02:28:38,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797132719] [2025-03-15 02:28:38,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:38,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:28:38,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:38,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:28:38,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-15 02:28:38,792 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 460 [2025-03-15 02:28:38,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 865 transitions, 10600 flow. Second operand has 9 states, 9 states have (on average 368.22222222222223) internal successors, (3314), 9 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:38,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:38,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 460 [2025-03-15 02:28:38,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:39,334 INFO L124 PetriNetUnfolderBase]: 239/2387 cut-off events. [2025-03-15 02:28:39,334 INFO L125 PetriNetUnfolderBase]: For 25161/25571 co-relation queries the response was YES. [2025-03-15 02:28:39,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10223 conditions, 2387 events. 239/2387 cut-off events. For 25161/25571 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 15729 event pairs, 104 based on Foata normal form. 0/2088 useless extension candidates. Maximal degree in co-relation 5791. Up to 440 conditions per place. [2025-03-15 02:28:39,353 INFO L140 encePairwiseOnDemand]: 442/460 looper letters, 297 selfloop transitions, 70 changer transitions 23/859 dead transitions. [2025-03-15 02:28:39,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 859 transitions, 11266 flow [2025-03-15 02:28:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:28:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:28:39,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4050 transitions. [2025-03-15 02:28:39,355 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8003952569169961 [2025-03-15 02:28:39,356 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 157 predicate places. [2025-03-15 02:28:39,356 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 859 transitions, 11266 flow [2025-03-15 02:28:39,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 368.22222222222223) internal successors, (3314), 9 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:39,356 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:39,356 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:39,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:39,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:39,557 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:39,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1455885022, now seen corresponding path program 1 times [2025-03-15 02:28:39,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:39,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904608552] [2025-03-15 02:28:39,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:39,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:41,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904608552] [2025-03-15 02:28:41,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904608552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:41,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096993487] [2025-03-15 02:28:41,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:41,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:41,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:41,084 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:41,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-15 02:28:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:41,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-15 02:28:41,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:41,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:28:41,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:28:41,739 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:28:41,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:28:41,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:28:41,961 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:28:41,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:28:42,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:28:42,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:28:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:42,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:42,402 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_357) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 9223372039002259456)) is different from false [2025-03-15 02:28:43,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:28:43,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-15 02:28:43,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:28:43,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 142 [2025-03-15 02:28:43,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-03-15 02:28:43,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-15 02:28:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:28:44,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096993487] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:44,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:44,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 24] total 66 [2025-03-15 02:28:44,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434982350] [2025-03-15 02:28:44,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:44,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-15 02:28:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:44,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-15 02:28:44,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=3941, Unknown=16, NotChecked=128, Total=4422 [2025-03-15 02:28:44,248 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 460 [2025-03-15 02:28:44,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 859 transitions, 11266 flow. Second operand has 67 states, 67 states have (on average 235.73134328358208) internal successors, (15794), 67 states have internal predecessors, (15794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:44,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:44,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 460 [2025-03-15 02:28:44,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:46,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~id_3~0 4))) (and (forall ((v_ArrVal_355 Int) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| Int) (v_ArrVal_357 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39| Int) (v_ArrVal_356 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39| v_ArrVal_356) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39| v_ArrVal_355) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35|) 0)))) (forall ((v_ArrVal_355 Int) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| Int) (v_ArrVal_357 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39| Int) (v_ArrVal_356 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39| v_ArrVal_356) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| v_ArrVal_357) |c_ULTIMATE.start_main_#t~ret28#1.base|) (+ .cse0 |c_ULTIMATE.start_main_#t~ret28#1.offset|)) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39|) 0)) (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_39| v_ArrVal_355) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35|) 0)))))) is different from false [2025-03-15 02:28:48,267 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((v_ArrVal_357 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_357) c_~get_5~0.base) .cse0) 9223372039002259456)) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35|) 0)) (forall ((v_ArrVal_357 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| v_ArrVal_357) c_~get_5~0.base) .cse0) 9223372039002259456)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_356) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| v_ArrVal_357) c_~get_5~0.base) .cse0) 9223372039002259456))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_356) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_35| v_ArrVal_357) c_~get_5~0.base) .cse0) 9223372039002259456))))) is different from false [2025-03-15 02:28:51,719 INFO L124 PetriNetUnfolderBase]: 1711/10202 cut-off events. [2025-03-15 02:28:51,720 INFO L125 PetriNetUnfolderBase]: For 86512/87042 co-relation queries the response was YES. [2025-03-15 02:28:51,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35825 conditions, 10202 events. 1711/10202 cut-off events. For 86512/87042 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 106500 event pairs, 356 based on Foata normal form. 0/8873 useless extension candidates. Maximal degree in co-relation 9378. Up to 1340 conditions per place. [2025-03-15 02:28:51,806 INFO L140 encePairwiseOnDemand]: 403/460 looper letters, 561 selfloop transitions, 261 changer transitions 44/1195 dead transitions. [2025-03-15 02:28:51,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 1195 transitions, 17576 flow [2025-03-15 02:28:51,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-15 02:28:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2025-03-15 02:28:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 15256 transitions. [2025-03-15 02:28:51,813 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5182065217391304 [2025-03-15 02:28:51,814 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 220 predicate places. [2025-03-15 02:28:51,814 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 1195 transitions, 17576 flow [2025-03-15 02:28:51,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 235.73134328358208) internal successors, (15794), 67 states have internal predecessors, (15794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:51,817 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:51,817 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:51,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-15 02:28:52,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:52,018 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:52,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1547770649, now seen corresponding path program 1 times [2025-03-15 02:28:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:52,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429336365] [2025-03-15 02:28:52,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-15 02:28:52,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:52,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429336365] [2025-03-15 02:28:52,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429336365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:52,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302620852] [2025-03-15 02:28:52,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:52,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:52,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:52,320 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:52,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-15 02:28:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:28:52,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-15 02:28:52,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-15 02:28:52,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302620852] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:52,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:52,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2025-03-15 02:28:52,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532109600] [2025-03-15 02:28:52,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:52,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-15 02:28:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:52,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-15 02:28:52,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-03-15 02:28:52,932 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 460 [2025-03-15 02:28:52,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 1195 transitions, 17576 flow. Second operand has 26 states, 26 states have (on average 345.7307692307692) internal successors, (8989), 26 states have internal predecessors, (8989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:52,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:52,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 460 [2025-03-15 02:28:52,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:55,660 INFO L124 PetriNetUnfolderBase]: 1703/10110 cut-off events. [2025-03-15 02:28:55,660 INFO L125 PetriNetUnfolderBase]: For 96939/97484 co-relation queries the response was YES. [2025-03-15 02:28:55,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37003 conditions, 10110 events. 1703/10110 cut-off events. For 96939/97484 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 105772 event pairs, 356 based on Foata normal form. 0/8791 useless extension candidates. Maximal degree in co-relation 9600. Up to 1340 conditions per place. [2025-03-15 02:28:55,754 INFO L140 encePairwiseOnDemand]: 432/460 looper letters, 560 selfloop transitions, 140 changer transitions 44/1262 dead transitions. [2025-03-15 02:28:55,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 1262 transitions, 19792 flow [2025-03-15 02:28:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-15 02:28:55,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-15 02:28:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 7655 transitions. [2025-03-15 02:28:55,758 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7564229249011858 [2025-03-15 02:28:55,758 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 241 predicate places. [2025-03-15 02:28:55,758 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 1262 transitions, 19792 flow [2025-03-15 02:28:55,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 345.7307692307692) internal successors, (8989), 26 states have internal predecessors, (8989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:55,760 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:55,760 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:55,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:55,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-15 02:28:55,961 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:55,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1114042385, now seen corresponding path program 1 times [2025-03-15 02:28:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:55,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771720101] [2025-03-15 02:28:55,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:55,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:28:56,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:56,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771720101] [2025-03-15 02:28:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771720101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:56,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:28:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735601621] [2025-03-15 02:28:56,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:56,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:28:56,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:56,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:28:56,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:28:56,126 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 460 [2025-03-15 02:28:56,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 1262 transitions, 19792 flow. Second operand has 4 states, 4 states have (on average 414.75) internal successors, (1659), 4 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:56,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:56,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 460 [2025-03-15 02:28:56,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:58,661 INFO L124 PetriNetUnfolderBase]: 1908/11615 cut-off events. [2025-03-15 02:28:58,661 INFO L125 PetriNetUnfolderBase]: For 145574/146119 co-relation queries the response was YES. [2025-03-15 02:28:58,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44044 conditions, 11615 events. 1908/11615 cut-off events. For 145574/146119 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 127492 event pairs, 421 based on Foata normal form. 0/10096 useless extension candidates. Maximal degree in co-relation 9605. Up to 1495 conditions per place. [2025-03-15 02:28:58,772 INFO L140 encePairwiseOnDemand]: 452/460 looper letters, 80 selfloop transitions, 5 changer transitions 44/1282 dead transitions. [2025-03-15 02:28:58,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 1282 transitions, 20462 flow [2025-03-15 02:28:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:28:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:28:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1695 transitions. [2025-03-15 02:28:58,773 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9211956521739131 [2025-03-15 02:28:58,774 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 243 predicate places. [2025-03-15 02:28:58,774 INFO L471 AbstractCegarLoop]: Abstraction has has 682 places, 1282 transitions, 20462 flow [2025-03-15 02:28:58,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.75) internal successors, (1659), 4 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:58,774 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:58,774 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:58,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 02:28:58,774 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:28:58,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:58,775 INFO L85 PathProgramCache]: Analyzing trace with hash -175574382, now seen corresponding path program 1 times [2025-03-15 02:28:58,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:58,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861979255] [2025-03-15 02:28:58,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:58,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:29:00,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861979255] [2025-03-15 02:29:00,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861979255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:00,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104317379] [2025-03-15 02:29:00,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:00,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:00,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:00,349 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:29:00,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-15 02:29:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:00,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-15 02:29:00,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:00,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:29:00,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:29:00,901 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:29:00,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:29:00,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:29:01,132 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:29:01,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:29:01,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:29:01,390 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:29:01,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:29:01,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:29:01,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:29:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:29:01,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:01,675 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_461 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_461) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 9223372039002259456)) is different from false [2025-03-15 02:29:02,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int) (v_ArrVal_461 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~id_0~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)))) is different from false [2025-03-15 02:29:02,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:29:02,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-15 02:29:02,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:29:02,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-15 02:29:02,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-15 02:29:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-15 02:29:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104317379] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:03,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:03,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25, 25] total 59 [2025-03-15 02:29:03,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712481919] [2025-03-15 02:29:03,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:03,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-15 02:29:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:03,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-15 02:29:03,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2985, Unknown=26, NotChecked=226, Total=3540 [2025-03-15 02:29:03,038 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 460 [2025-03-15 02:29:03,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 1282 transitions, 20462 flow. Second operand has 60 states, 60 states have (on average 236.36666666666667) internal successors, (14182), 60 states have internal predecessors, (14182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:03,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:03,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 460 [2025-03-15 02:29:03,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:04,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~id_0~0 4))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int) (v_ArrVal_461 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| .cse0)) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)) (forall ((v_ArrVal_461 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) c_~get_2~0.base) (+ .cse0 c_~get_2~0.offset)) 9223372039002259456)))))) is different from false [2025-03-15 02:29:06,086 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_458 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int) (v_ArrVal_461 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_458) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) c_~get_2~0.base) .cse0) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)) (forall ((v_ArrVal_461 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) c_~get_2~0.base) .cse0) 9223372039002259456)))))) is different from false [2025-03-15 02:29:17,130 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_461 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_461) c_~get_2~0.base) .cse0) 9223372039002259456)) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_460) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) c_~get_2~0.base) .cse0) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)))))) is different from false [2025-03-15 02:29:17,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_460) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) c_~get_2~0.base) .cse0) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50|) 0)) (forall ((v_ArrVal_461 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_50| v_ArrVal_461) c_~get_2~0.base) .cse0) 9223372039002259456)))))) is different from false [2025-03-15 02:29:23,401 INFO L124 PetriNetUnfolderBase]: 3512/16518 cut-off events. [2025-03-15 02:29:23,401 INFO L125 PetriNetUnfolderBase]: For 236958/237852 co-relation queries the response was YES. [2025-03-15 02:29:23,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70716 conditions, 16518 events. 3512/16518 cut-off events. For 236958/237852 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 192894 event pairs, 758 based on Foata normal form. 0/14421 useless extension candidates. Maximal degree in co-relation 10906. Up to 2337 conditions per place. [2025-03-15 02:29:23,593 INFO L140 encePairwiseOnDemand]: 374/460 looper letters, 831 selfloop transitions, 286 changer transitions 75/1685 dead transitions. [2025-03-15 02:29:23,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 763 places, 1685 transitions, 28549 flow [2025-03-15 02:29:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-03-15 02:29:23,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2025-03-15 02:29:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 19503 transitions. [2025-03-15 02:29:23,603 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5170466595970308 [2025-03-15 02:29:23,603 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 324 predicate places. [2025-03-15 02:29:23,603 INFO L471 AbstractCegarLoop]: Abstraction has has 763 places, 1685 transitions, 28549 flow [2025-03-15 02:29:23,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 236.36666666666667) internal successors, (14182), 60 states have internal predecessors, (14182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:23,605 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:23,605 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:23,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-15 02:29:23,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-15 02:29:23,806 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:29:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash -243907991, now seen corresponding path program 1 times [2025-03-15 02:29:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200853844] [2025-03-15 02:29:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:25,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:29:25,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:25,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200853844] [2025-03-15 02:29:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200853844] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:25,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557318741] [2025-03-15 02:29:25,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:25,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:25,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:25,288 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:29:25,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-15 02:29:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:25,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-15 02:29:25,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:25,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:29:25,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:29:25,953 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:29:25,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:29:26,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:29:26,169 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:29:26,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:29:26,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:29:26,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:29:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:29:26,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:26,602 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_498 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_498) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 4294967296))) is different from false [2025-03-15 02:29:27,074 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| Int) (v_ArrVal_498 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58|) 0)) (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| v_ArrVal_498) |c_ULTIMATE.start_main_#t~ret28#1.base|) (+ (* c_~id_3~0 4) |c_ULTIMATE.start_main_#t~ret28#1.offset|)))))) is different from false [2025-03-15 02:29:27,100 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| Int) (v_ArrVal_498 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58|) 0)) (< 0 (+ (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| v_ArrVal_498) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* c_~id_3~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4294967296)))) is different from false [2025-03-15 02:29:27,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:29:27,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-15 02:29:27,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:29:27,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2025-03-15 02:29:27,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-15 02:29:27,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:29:27,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557318741] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:27,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:27,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 65 [2025-03-15 02:29:27,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866439879] [2025-03-15 02:29:27,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:27,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-15 02:29:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:27,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-15 02:29:27,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=3549, Unknown=13, NotChecked=372, Total=4290 [2025-03-15 02:29:27,840 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 460 [2025-03-15 02:29:27,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 1685 transitions, 28549 flow. Second operand has 66 states, 66 states have (on average 235.8030303030303) internal successors, (15563), 66 states have internal predecessors, (15563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:27,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:27,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 460 [2025-03-15 02:29:27,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:31,344 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((v_ArrVal_498 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_498) c_~get_5~0.base) .cse0) 4294967296))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| Int) (v_ArrVal_498 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58|) 0)) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_497) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| v_ArrVal_498) c_~get_5~0.base) .cse0))))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58|) 0)) (forall ((v_ArrVal_498 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_58| v_ArrVal_498) c_~get_5~0.base) .cse0) 4294967296))))))) is different from false [2025-03-15 02:29:36,512 INFO L124 PetriNetUnfolderBase]: 3452/15919 cut-off events. [2025-03-15 02:29:36,513 INFO L125 PetriNetUnfolderBase]: For 256143/257211 co-relation queries the response was YES. [2025-03-15 02:29:36,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75125 conditions, 15919 events. 3452/15919 cut-off events. For 256143/257211 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 186174 event pairs, 642 based on Foata normal form. 0/13979 useless extension candidates. Maximal degree in co-relation 11903. Up to 2313 conditions per place. [2025-03-15 02:29:36,657 INFO L140 encePairwiseOnDemand]: 407/460 looper letters, 844 selfloop transitions, 321 changer transitions 75/1732 dead transitions. [2025-03-15 02:29:36,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 820 places, 1732 transitions, 32164 flow [2025-03-15 02:29:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-15 02:29:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-15 02:29:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 13990 transitions. [2025-03-15 02:29:36,665 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5154753131908621 [2025-03-15 02:29:36,666 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 381 predicate places. [2025-03-15 02:29:36,666 INFO L471 AbstractCegarLoop]: Abstraction has has 820 places, 1732 transitions, 32164 flow [2025-03-15 02:29:36,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 235.8030303030303) internal successors, (15563), 66 states have internal predecessors, (15563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:36,668 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:36,668 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:36,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-15 02:29:36,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:36,869 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:29:36,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1028787996, now seen corresponding path program 1 times [2025-03-15 02:29:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921053077] [2025-03-15 02:29:36,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:36,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:36,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:29:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921053077] [2025-03-15 02:29:37,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921053077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:37,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:29:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996604006] [2025-03-15 02:29:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:37,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:29:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:37,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:29:37,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:29:37,058 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 460 [2025-03-15 02:29:37,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 820 places, 1732 transitions, 32164 flow. Second operand has 4 states, 4 states have (on average 415.5) internal successors, (1662), 4 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:37,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:37,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 460 [2025-03-15 02:29:37,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:41,638 INFO L124 PetriNetUnfolderBase]: 3400/15855 cut-off events. [2025-03-15 02:29:41,638 INFO L125 PetriNetUnfolderBase]: For 266108/267176 co-relation queries the response was YES. [2025-03-15 02:29:41,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77302 conditions, 15855 events. 3400/15855 cut-off events. For 266108/267176 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 185921 event pairs, 642 based on Foata normal form. 0/13972 useless extension candidates. Maximal degree in co-relation 12090. Up to 2309 conditions per place. [2025-03-15 02:29:41,774 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 184 selfloop transitions, 12 changer transitions 75/1747 dead transitions. [2025-03-15 02:29:41,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 823 places, 1747 transitions, 33498 flow [2025-03-15 02:29:41,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:29:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:29:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1691 transitions. [2025-03-15 02:29:41,775 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9190217391304348 [2025-03-15 02:29:41,776 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 384 predicate places. [2025-03-15 02:29:41,776 INFO L471 AbstractCegarLoop]: Abstraction has has 823 places, 1747 transitions, 33498 flow [2025-03-15 02:29:41,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 415.5) internal successors, (1662), 4 states have internal predecessors, (1662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:41,776 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:41,776 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:41,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 02:29:41,776 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:29:41,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1066149403, now seen corresponding path program 1 times [2025-03-15 02:29:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:41,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129870166] [2025-03-15 02:29:41,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:29:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129870166] [2025-03-15 02:29:41,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129870166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:41,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:29:41,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:29:41,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570794339] [2025-03-15 02:29:41,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:41,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:29:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:41,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:29:41,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:29:41,838 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 460 [2025-03-15 02:29:41,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 823 places, 1747 transitions, 33498 flow. Second operand has 4 states, 4 states have (on average 415.75) internal successors, (1663), 4 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:41,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:41,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 460 [2025-03-15 02:29:41,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:46,634 INFO L124 PetriNetUnfolderBase]: 3544/16347 cut-off events. [2025-03-15 02:29:46,635 INFO L125 PetriNetUnfolderBase]: For 304280/305348 co-relation queries the response was YES. [2025-03-15 02:29:46,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83742 conditions, 16347 events. 3544/16347 cut-off events. For 304280/305348 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 193507 event pairs, 642 based on Foata normal form. 57/14440 useless extension candidates. Maximal degree in co-relation 12424. Up to 2417 conditions per place. [2025-03-15 02:29:46,807 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 209 selfloop transitions, 11 changer transitions 75/1755 dead transitions. [2025-03-15 02:29:46,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 1755 transitions, 34761 flow [2025-03-15 02:29:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:29:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:29:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1688 transitions. [2025-03-15 02:29:46,809 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9173913043478261 [2025-03-15 02:29:46,809 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 386 predicate places. [2025-03-15 02:29:46,809 INFO L471 AbstractCegarLoop]: Abstraction has has 825 places, 1755 transitions, 34761 flow [2025-03-15 02:29:46,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 415.75) internal successors, (1663), 4 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:46,809 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:46,809 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:46,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 02:29:46,810 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:29:46,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:46,810 INFO L85 PathProgramCache]: Analyzing trace with hash 975888894, now seen corresponding path program 2 times [2025-03-15 02:29:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738135395] [2025-03-15 02:29:46,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:29:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:46,822 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:29:46,822 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:29:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-15 02:29:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738135395] [2025-03-15 02:29:46,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738135395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:46,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587337378] [2025-03-15 02:29:46,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:29:46,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:46,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:46,878 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:29:46,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-15 02:29:46,972 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:29:46,972 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:29:46,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:29:46,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-15 02:29:47,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:47,225 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-15 02:29:47,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587337378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:47,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:47,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:29:47,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848854274] [2025-03-15 02:29:47,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:47,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:29:47,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:47,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:29:47,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:29:47,227 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 460 [2025-03-15 02:29:47,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 1755 transitions, 34761 flow. Second operand has 7 states, 7 states have (on average 386.2857142857143) internal successors, (2704), 7 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:47,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:47,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 460 [2025-03-15 02:29:47,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:51,871 INFO L124 PetriNetUnfolderBase]: 3544/16344 cut-off events. [2025-03-15 02:29:51,871 INFO L125 PetriNetUnfolderBase]: For 331750/332836 co-relation queries the response was YES. [2025-03-15 02:29:51,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86118 conditions, 16344 events. 3544/16344 cut-off events. For 331750/332836 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 193231 event pairs, 642 based on Foata normal form. 0/14383 useless extension candidates. Maximal degree in co-relation 12791. Up to 2417 conditions per place. [2025-03-15 02:29:52,079 INFO L140 encePairwiseOnDemand]: 442/460 looper letters, 477 selfloop transitions, 98 changer transitions 75/1753 dead transitions. [2025-03-15 02:29:52,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 834 places, 1753 transitions, 35899 flow [2025-03-15 02:29:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:29:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:29:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4241 transitions. [2025-03-15 02:29:52,082 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8381422924901186 [2025-03-15 02:29:52,083 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 395 predicate places. [2025-03-15 02:29:52,083 INFO L471 AbstractCegarLoop]: Abstraction has has 834 places, 1753 transitions, 35899 flow [2025-03-15 02:29:52,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 386.2857142857143) internal successors, (2704), 7 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:52,083 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:52,083 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:52,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-15 02:29:52,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-15 02:29:52,287 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:29:52,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:52,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1372944807, now seen corresponding path program 1 times [2025-03-15 02:29:52,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:52,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607735372] [2025-03-15 02:29:52,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:29:53,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607735372] [2025-03-15 02:29:53,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607735372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:53,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956193550] [2025-03-15 02:29:53,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:53,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:53,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:53,810 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:29:53,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-15 02:29:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:53,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-15 02:29:53,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:53,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:29:54,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:29:54,430 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:29:54,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:29:54,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:29:54,682 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 02:29:54,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-15 02:29:54,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:29:55,145 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-15 02:29:55,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-15 02:29:55,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:29:55,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:29:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:29:55,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:29:55,586 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_622 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_622) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-03-15 02:29:57,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:29:57,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2025-03-15 02:29:57,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:29:57,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 163 [2025-03-15 02:29:57,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2025-03-15 02:29:57,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 116 [2025-03-15 02:29:57,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2025-03-15 02:29:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-15 02:29:58,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956193550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:29:58,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:29:58,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 27] total 77 [2025-03-15 02:29:58,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226825444] [2025-03-15 02:29:58,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:29:58,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2025-03-15 02:29:58,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:58,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2025-03-15 02:29:58,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=5381, Unknown=31, NotChecked=150, Total=6006 [2025-03-15 02:29:58,419 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 460 [2025-03-15 02:29:58,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 834 places, 1753 transitions, 35899 flow. Second operand has 78 states, 78 states have (on average 224.47435897435898) internal successors, (17509), 78 states have internal predecessors, (17509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:58,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:58,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 460 [2025-03-15 02:29:58,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:01,757 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~id_0~0 4))) (and (forall ((v_ArrVal_622 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71| v_ArrVal_618))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71|) 0)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71| v_ArrVal_619) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77| v_ArrVal_621) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| v_ArrVal_622) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4294967296)) (not (= (select .cse1 |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77|) 0)) (not (= (select (store .cse1 |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77| 1) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73|) 0))))) (forall ((v_ArrVal_622 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| Int) (v_ArrVal_618 Int) (v_ArrVal_619 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77| Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71| Int) (v_ArrVal_621 (Array Int Int))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71| v_ArrVal_618))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71|) 0)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc35#1.base_71| v_ArrVal_619) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77| v_ArrVal_621) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| v_ArrVal_622) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| .cse0)) 4294967296)) (not (= (select .cse2 |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77|) 0)) (not (= (select (store .cse2 |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_77| 1) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73|) 0))))))) is different from false [2025-03-15 02:30:06,338 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_622 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| Int) (v_ArrVal_621 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_621) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| v_ArrVal_622) c_~get_2~0.base) .cse0) 4294967296)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73|) 0)) (forall ((v_ArrVal_622 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| v_ArrVal_622) c_~get_2~0.base) .cse0)))))))) is different from false [2025-03-15 02:30:07,271 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_622 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| Int) (v_ArrVal_621 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73|) 0)) (< 0 (+ 4294967296 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_621) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| v_ArrVal_622) c_~get_2~0.base) .cse0))))) (forall ((v_ArrVal_622 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_622) c_~get_2~0.base) .cse0) 4294967296))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73|) 0)) (forall ((v_ArrVal_622 (Array Int Int))) (< 0 (+ 4294967296 (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_73| v_ArrVal_622) c_~get_2~0.base) .cse0)))))))) is different from false [2025-03-15 02:30:13,912 INFO L124 PetriNetUnfolderBase]: 3523/16293 cut-off events. [2025-03-15 02:30:13,912 INFO L125 PetriNetUnfolderBase]: For 354976/356380 co-relation queries the response was YES. [2025-03-15 02:30:14,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92100 conditions, 16293 events. 3523/16293 cut-off events. For 354976/356380 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 192684 event pairs, 585 based on Foata normal form. 54/14416 useless extension candidates. Maximal degree in co-relation 13737. Up to 2573 conditions per place. [2025-03-15 02:30:14,503 INFO L140 encePairwiseOnDemand]: 368/460 looper letters, 1126 selfloop transitions, 297 changer transitions 75/1869 dead transitions. [2025-03-15 02:30:14,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 1869 transitions, 42041 flow [2025-03-15 02:30:14,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-15 02:30:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-15 02:30:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 19413 transitions. [2025-03-15 02:30:14,512 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49072295247724973 [2025-03-15 02:30:14,512 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 480 predicate places. [2025-03-15 02:30:14,513 INFO L471 AbstractCegarLoop]: Abstraction has has 919 places, 1869 transitions, 42041 flow [2025-03-15 02:30:14,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 224.47435897435898) internal successors, (17509), 78 states have internal predecessors, (17509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:14,515 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:14,515 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:14,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-15 02:30:14,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-15 02:30:14,716 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:30:14,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1303395103, now seen corresponding path program 1 times [2025-03-15 02:30:14,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:14,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891613250] [2025-03-15 02:30:14,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:30:16,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:16,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891613250] [2025-03-15 02:30:16,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891613250] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:30:16,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371142087] [2025-03-15 02:30:16,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:16,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:30:16,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:30:16,166 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:30:16,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-15 02:30:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:16,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-15 02:30:16,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:30:16,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:30:16,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:30:16,722 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:30:16,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:30:16,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:30:16,973 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:30:16,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:30:17,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:30:17,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:30:17,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:30:17,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:30:17,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:30:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:30:17,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:30:17,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_662 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_662) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-03-15 02:30:19,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:30:19,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-03-15 02:30:19,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:30:19,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2025-03-15 02:30:19,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2025-03-15 02:30:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-15 02:30:19,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371142087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:30:19,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:30:19,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 30] total 67 [2025-03-15 02:30:19,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318798812] [2025-03-15 02:30:19,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:30:19,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-15 02:30:19,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:19,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-15 02:30:19,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=4004, Unknown=35, NotChecked=130, Total=4556 [2025-03-15 02:30:19,528 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 460 [2025-03-15 02:30:19,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 919 places, 1869 transitions, 42041 flow. Second operand has 68 states, 68 states have (on average 225.02941176470588) internal successors, (15302), 68 states have internal predecessors, (15302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:19,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:19,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 460 [2025-03-15 02:30:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:21,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~id_0~0 4))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| Int) (v_ArrVal_662 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81|) 0)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| v_ArrVal_662) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| Int) (v_ArrVal_662 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81|) 0)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| v_ArrVal_662) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| .cse0)))))))) is different from false [2025-03-15 02:30:38,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81|) 0)) (forall ((v_ArrVal_662 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| v_ArrVal_662) c_~get_2~0.base) .cse0) 2147483649))))) (forall ((v_ArrVal_662 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_662) c_~get_2~0.base) .cse0)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| Int) (v_ArrVal_661 (Array Int Int)) (v_ArrVal_662 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81|) 0)) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_661) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_81| v_ArrVal_662) c_~get_2~0.base) .cse0))))))) is different from false [2025-03-15 02:30:45,853 INFO L124 PetriNetUnfolderBase]: 3830/17054 cut-off events. [2025-03-15 02:30:45,853 INFO L125 PetriNetUnfolderBase]: For 407431/408865 co-relation queries the response was YES. [2025-03-15 02:30:46,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103276 conditions, 17054 events. 3830/17054 cut-off events. For 407431/408865 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 202314 event pairs, 602 based on Foata normal form. 0/15107 useless extension candidates. Maximal degree in co-relation 14884. Up to 2805 conditions per place. [2025-03-15 02:30:46,142 INFO L140 encePairwiseOnDemand]: 348/460 looper letters, 1322 selfloop transitions, 342 changer transitions 73/2226 dead transitions. [2025-03-15 02:30:46,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 2226 transitions, 53763 flow [2025-03-15 02:30:46,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-03-15 02:30:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2025-03-15 02:30:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 25972 transitions. [2025-03-15 02:30:46,156 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4909640831758034 [2025-03-15 02:30:46,157 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 594 predicate places. [2025-03-15 02:30:46,157 INFO L471 AbstractCegarLoop]: Abstraction has has 1033 places, 2226 transitions, 53763 flow [2025-03-15 02:30:46,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 225.02941176470588) internal successors, (15302), 68 states have internal predecessors, (15302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:46,160 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:46,160 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:46,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-15 02:30:46,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-15 02:30:46,361 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:30:46,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:46,362 INFO L85 PathProgramCache]: Analyzing trace with hash 388385145, now seen corresponding path program 1 times [2025-03-15 02:30:46,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:46,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564511089] [2025-03-15 02:30:46,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:46,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:46,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:30:46,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:46,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564511089] [2025-03-15 02:30:46,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564511089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:46,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:46,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:30:46,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755553417] [2025-03-15 02:30:46,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:46,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:30:46,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:46,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:30:46,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:30:46,433 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 460 [2025-03-15 02:30:46,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 2226 transitions, 53763 flow. Second operand has 4 states, 4 states have (on average 415.75) internal successors, (1663), 4 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:46,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:46,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 460 [2025-03-15 02:30:46,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:52,398 INFO L124 PetriNetUnfolderBase]: 3776/16970 cut-off events. [2025-03-15 02:30:52,398 INFO L125 PetriNetUnfolderBase]: For 418620/420054 co-relation queries the response was YES. [2025-03-15 02:30:52,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105568 conditions, 16970 events. 3776/16970 cut-off events. For 418620/420054 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 201636 event pairs, 581 based on Foata normal form. 0/15086 useless extension candidates. Maximal degree in co-relation 15179. Up to 2805 conditions per place. [2025-03-15 02:30:52,595 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 268 selfloop transitions, 12 changer transitions 73/2241 dead transitions. [2025-03-15 02:30:52,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1036 places, 2241 transitions, 55445 flow [2025-03-15 02:30:52,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:30:52,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:30:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1692 transitions. [2025-03-15 02:30:52,597 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9195652173913044 [2025-03-15 02:30:52,597 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 597 predicate places. [2025-03-15 02:30:52,598 INFO L471 AbstractCegarLoop]: Abstraction has has 1036 places, 2241 transitions, 55445 flow [2025-03-15 02:30:52,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 415.75) internal successors, (1663), 4 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:52,598 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:52,598 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:52,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 02:30:52,598 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:30:52,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1750541392, now seen corresponding path program 1 times [2025-03-15 02:30:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:52,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746801260] [2025-03-15 02:30:52,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:30:53,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746801260] [2025-03-15 02:30:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746801260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:30:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543432591] [2025-03-15 02:30:53,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:30:53,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:30:53,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:30:54,000 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:30:54,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-15 02:30:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:30:54,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-15 02:30:54,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:30:54,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:30:54,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:30:54,611 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:30:54,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:30:54,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:30:54,985 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:30:54,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:30:55,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:30:55,246 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:30:55,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:30:55,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:30:55,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:30:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:30:55,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:30:55,739 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_718 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_718) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 2147483648)) is different from false [2025-03-15 02:30:56,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:30:56,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-15 02:30:56,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:30:56,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2025-03-15 02:30:56,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-15 02:30:57,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-03-15 02:30:57,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543432591] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:30:57,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:30:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 29] total 72 [2025-03-15 02:30:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072352189] [2025-03-15 02:30:57,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:30:57,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-15 02:30:57,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:57,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-15 02:30:57,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=4653, Unknown=35, NotChecked=140, Total=5256 [2025-03-15 02:30:57,310 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 460 [2025-03-15 02:30:57,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 2241 transitions, 55445 flow. Second operand has 73 states, 73 states have (on average 225.4794520547945) internal successors, (16460), 73 states have internal predecessors, (16460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:57,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:57,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 460 [2025-03-15 02:30:57,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:18,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_717 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| Int) (v_ArrVal_718 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_717) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| v_ArrVal_718) c_~get_2~0.base) .cse0) 2147483648))) (forall ((v_ArrVal_718 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_718) c_~get_2~0.base) .cse0) 2147483648)) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| v_ArrVal_718) c_~get_2~0.base) .cse0) 2147483648)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89|) 0)))))) is different from false [2025-03-15 02:31:18,393 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((v_ArrVal_717 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| Int) (v_ArrVal_718 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_717) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| v_ArrVal_718) c_~get_2~0.base) .cse0) 2147483648))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| Int)) (or (forall ((v_ArrVal_718 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89| v_ArrVal_718) c_~get_2~0.base) .cse0) 2147483648)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_89|) 0)))))) is different from false [2025-03-15 02:31:28,784 INFO L124 PetriNetUnfolderBase]: 4094/17234 cut-off events. [2025-03-15 02:31:28,784 INFO L125 PetriNetUnfolderBase]: For 473592/475230 co-relation queries the response was YES. [2025-03-15 02:31:28,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116500 conditions, 17234 events. 4094/17234 cut-off events. For 473592/475230 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 202526 event pairs, 581 based on Foata normal form. 0/15404 useless extension candidates. Maximal degree in co-relation 17166. Up to 2985 conditions per place. [2025-03-15 02:31:29,008 INFO L140 encePairwiseOnDemand]: 347/460 looper letters, 1678 selfloop transitions, 346 changer transitions 73/2595 dead transitions. [2025-03-15 02:31:29,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1150 places, 2595 transitions, 69657 flow [2025-03-15 02:31:29,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2025-03-15 02:31:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2025-03-15 02:31:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 25965 transitions. [2025-03-15 02:31:29,017 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49083175803402646 [2025-03-15 02:31:29,017 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 711 predicate places. [2025-03-15 02:31:29,017 INFO L471 AbstractCegarLoop]: Abstraction has has 1150 places, 2595 transitions, 69657 flow [2025-03-15 02:31:29,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 225.4794520547945) internal successors, (16460), 73 states have internal predecessors, (16460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:29,020 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:29,020 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:31:29,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-15 02:31:29,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:29,220 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:31:29,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash -868838166, now seen corresponding path program 1 times [2025-03-15 02:31:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563317519] [2025-03-15 02:31:29,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:29,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:31:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:29,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563317519] [2025-03-15 02:31:29,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563317519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:29,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:31:29,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:31:29,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629407087] [2025-03-15 02:31:29,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:31:29,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:29,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:31:29,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:31:29,321 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 460 [2025-03-15 02:31:29,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1150 places, 2595 transitions, 69657 flow. Second operand has 6 states, 6 states have (on average 403.0) internal successors, (2418), 6 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:29,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:29,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 460 [2025-03-15 02:31:29,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:38,375 INFO L124 PetriNetUnfolderBase]: 4232/17315 cut-off events. [2025-03-15 02:31:38,375 INFO L125 PetriNetUnfolderBase]: For 580377/582015 co-relation queries the response was YES. [2025-03-15 02:31:38,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126055 conditions, 17315 events. 4232/17315 cut-off events. For 580377/582015 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 203370 event pairs, 581 based on Foata normal form. 0/15542 useless extension candidates. Maximal degree in co-relation 18899. Up to 3054 conditions per place. [2025-03-15 02:31:38,778 INFO L140 encePairwiseOnDemand]: 451/460 looper letters, 442 selfloop transitions, 40 changer transitions 73/2633 dead transitions. [2025-03-15 02:31:38,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1156 places, 2633 transitions, 72990 flow [2025-03-15 02:31:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:31:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:31:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2856 transitions. [2025-03-15 02:31:38,781 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8869565217391304 [2025-03-15 02:31:38,781 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 717 predicate places. [2025-03-15 02:31:38,781 INFO L471 AbstractCegarLoop]: Abstraction has has 1156 places, 2633 transitions, 72990 flow [2025-03-15 02:31:38,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.0) internal successors, (2418), 6 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:38,782 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:38,782 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:31:38,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 02:31:38,782 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:31:38,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:38,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1062678251, now seen corresponding path program 1 times [2025-03-15 02:31:38,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:38,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307504475] [2025-03-15 02:31:38,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:38,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:31:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307504475] [2025-03-15 02:31:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307504475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:38,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:31:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:31:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285889544] [2025-03-15 02:31:38,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:31:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:38,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:31:38,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:31:38,869 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 460 [2025-03-15 02:31:38,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1156 places, 2633 transitions, 72990 flow. Second operand has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:38,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:38,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 460 [2025-03-15 02:31:38,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:47,406 INFO L124 PetriNetUnfolderBase]: 4334/17684 cut-off events. [2025-03-15 02:31:47,407 INFO L125 PetriNetUnfolderBase]: For 642236/643874 co-relation queries the response was YES. [2025-03-15 02:31:47,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132772 conditions, 17684 events. 4334/17684 cut-off events. For 642236/643874 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 209068 event pairs, 581 based on Foata normal form. 63/15908 useless extension candidates. Maximal degree in co-relation 19235. Up to 3078 conditions per place. [2025-03-15 02:31:47,723 INFO L140 encePairwiseOnDemand]: 455/460 looper letters, 364 selfloop transitions, 11 changer transitions 82/2634 dead transitions. [2025-03-15 02:31:47,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1157 places, 2634 transitions, 74512 flow [2025-03-15 02:31:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:31:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:31:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1689 transitions. [2025-03-15 02:31:47,725 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9179347826086957 [2025-03-15 02:31:47,725 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 718 predicate places. [2025-03-15 02:31:47,725 INFO L471 AbstractCegarLoop]: Abstraction has has 1157 places, 2634 transitions, 74512 flow [2025-03-15 02:31:47,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 416.0) internal successors, (1664), 4 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:47,725 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:47,725 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:31:47,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 02:31:47,725 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:31:47,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:47,727 INFO L85 PathProgramCache]: Analyzing trace with hash 760930653, now seen corresponding path program 1 times [2025-03-15 02:31:47,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:47,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560035483] [2025-03-15 02:31:47,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:31:47,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:47,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560035483] [2025-03-15 02:31:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560035483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:31:47,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:31:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:31:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871491740] [2025-03-15 02:31:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:31:47,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:31:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:31:47,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:31:47,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:31:47,837 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 460 [2025-03-15 02:31:47,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1157 places, 2634 transitions, 74512 flow. Second operand has 6 states, 6 states have (on average 403.1666666666667) internal successors, (2419), 6 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:47,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:31:47,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 460 [2025-03-15 02:31:47,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:58,168 INFO L124 PetriNetUnfolderBase]: 4292/17585 cut-off events. [2025-03-15 02:31:58,169 INFO L125 PetriNetUnfolderBase]: For 655520/657158 co-relation queries the response was YES. [2025-03-15 02:31:58,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136312 conditions, 17585 events. 4292/17585 cut-off events. For 655520/657158 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 207895 event pairs, 581 based on Foata normal form. 0/15803 useless extension candidates. Maximal degree in co-relation 19957. Up to 3152 conditions per place. [2025-03-15 02:31:58,440 INFO L140 encePairwiseOnDemand]: 450/460 looper letters, 485 selfloop transitions, 44 changer transitions 82/2670 dead transitions. [2025-03-15 02:31:58,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1163 places, 2670 transitions, 78072 flow [2025-03-15 02:31:58,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:31:58,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:31:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2849 transitions. [2025-03-15 02:31:58,442 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8847826086956522 [2025-03-15 02:31:58,442 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 724 predicate places. [2025-03-15 02:31:58,443 INFO L471 AbstractCegarLoop]: Abstraction has has 1163 places, 2670 transitions, 78072 flow [2025-03-15 02:31:58,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.1666666666667) internal successors, (2419), 6 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:58,443 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:31:58,443 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:31:58,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 02:31:58,443 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:31:58,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:31:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash -973444514, now seen corresponding path program 1 times [2025-03-15 02:31:58,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:31:58,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508800139] [2025-03-15 02:31:58,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:58,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:31:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:31:59,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:31:59,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508800139] [2025-03-15 02:31:59,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508800139] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:31:59,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156410322] [2025-03-15 02:31:59,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:31:59,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:31:59,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:31:59,667 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:31:59,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-15 02:31:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:31:59,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-15 02:31:59,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:31:59,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:31:59,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:32:00,274 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 02:32:00,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-15 02:32:00,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:32:00,777 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-15 02:32:00,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-15 02:32:00,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:32:00,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:32:01,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:32:01,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:32:02,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:32:02,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-03-15 02:32:02,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:32:02,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 158 [2025-03-15 02:32:02,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2025-03-15 02:32:02,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-03-15 02:32:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:32:02,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156410322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:32:02,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:32:02,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 58 [2025-03-15 02:32:02,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512903118] [2025-03-15 02:32:02,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:32:02,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-15 02:32:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:02,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-15 02:32:02,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=3078, Unknown=26, NotChecked=0, Total=3422 [2025-03-15 02:32:02,852 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 460 [2025-03-15 02:32:02,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1163 places, 2670 transitions, 78072 flow. Second operand has 59 states, 59 states have (on average 230.94915254237287) internal successors, (13626), 59 states have internal predecessors, (13626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:32:02,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:02,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 460 [2025-03-15 02:32:02,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:05,671 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~id_3~0 4))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101| 1) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97|) 0)) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101| v_ArrVal_802) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| v_ArrVal_803) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101|) 0)))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101| Int) (v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101| 1) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97|) 0)) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101| v_ArrVal_802) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| v_ArrVal_803) |c_ULTIMATE.start_main_#t~ret28#1.base|) (+ .cse0 |c_ULTIMATE.start_main_#t~ret28#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_101|) 0)))))) is different from false [2025-03-15 02:32:07,759 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((v_ArrVal_803 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_803) c_~get_5~0.base) .cse0)))) (forall ((v_ArrVal_803 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_803) c_~get_5~0.base) .cse0)))) (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97|) 0)) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_802) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| v_ArrVal_803) c_~get_5~0.base) .cse0))))) (forall ((v_ArrVal_803 (Array Int Int)) (v_ArrVal_802 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| Int)) (or (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_802) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97| v_ArrVal_803) c_~get_5~0.base) .cse0))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_97|) 0)))))) is different from false [2025-03-15 02:32:21,203 INFO L124 PetriNetUnfolderBase]: 4532/17804 cut-off events. [2025-03-15 02:32:21,204 INFO L125 PetriNetUnfolderBase]: For 727401/728689 co-relation queries the response was YES. [2025-03-15 02:32:21,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146943 conditions, 17804 events. 4532/17804 cut-off events. For 727401/728689 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 207141 event pairs, 424 based on Foata normal form. 6/16111 useless extension candidates. Maximal degree in co-relation 20334. Up to 3233 conditions per place. [2025-03-15 02:32:21,550 INFO L140 encePairwiseOnDemand]: 402/460 looper letters, 1959 selfloop transitions, 425 changer transitions 89/3110 dead transitions. [2025-03-15 02:32:21,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1237 places, 3110 transitions, 94635 flow [2025-03-15 02:32:21,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-15 02:32:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2025-03-15 02:32:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 17518 transitions. [2025-03-15 02:32:21,556 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.507768115942029 [2025-03-15 02:32:21,557 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 798 predicate places. [2025-03-15 02:32:21,557 INFO L471 AbstractCegarLoop]: Abstraction has has 1237 places, 3110 transitions, 94635 flow [2025-03-15 02:32:21,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 230.94915254237287) internal successors, (13626), 59 states have internal predecessors, (13626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:32:21,559 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:21,559 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:32:21,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-15 02:32:21,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:32:21,760 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:32:21,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:21,761 INFO L85 PathProgramCache]: Analyzing trace with hash -112007648, now seen corresponding path program 1 times [2025-03-15 02:32:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:21,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639073542] [2025-03-15 02:32:21,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:21,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:32:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639073542] [2025-03-15 02:32:23,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639073542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:32:23,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238559770] [2025-03-15 02:32:23,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:32:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:32:23,007 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:32:23,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-15 02:32:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:23,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-15 02:32:23,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:32:23,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:32:23,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:32:23,690 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:32:23,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:32:23,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:32:24,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:32:24,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:32:24,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:32:24,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-15 02:32:24,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:32:24,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:32:24,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_840) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 2147483648)) is different from false [2025-03-15 02:32:24,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_840) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 2147483648)) is different from false [2025-03-15 02:32:25,507 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| Int) (v_ArrVal_840 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| v_ArrVal_840) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* c_~id_3~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105|) 0)))) is different from false [2025-03-15 02:32:25,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:32:25,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-15 02:32:25,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:32:25,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 34 [2025-03-15 02:32:25,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2025-03-15 02:32:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-03-15 02:32:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238559770] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:32:26,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:32:26,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 27] total 66 [2025-03-15 02:32:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945899191] [2025-03-15 02:32:26,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:32:26,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-15 02:32:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:26,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-15 02:32:26,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3663, Unknown=12, NotChecked=378, Total=4422 [2025-03-15 02:32:26,108 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 460 [2025-03-15 02:32:26,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1237 places, 3110 transitions, 94635 flow. Second operand has 67 states, 67 states have (on average 224.9402985074627) internal successors, (15071), 67 states have internal predecessors, (15071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:32:26,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:26,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 460 [2025-03-15 02:32:26,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:32:28,742 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* c_~id_3~0 4))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| Int) (v_ArrVal_840 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105|) 0)) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| v_ArrVal_840) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 2147483648))) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| Int) (v_ArrVal_840 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| v_ArrVal_840) |c_ULTIMATE.start_main_#t~ret28#1.base|) (+ .cse0 |c_ULTIMATE.start_main_#t~ret28#1.offset|)) 2147483648) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105|) 0)))))) is different from false [2025-03-15 02:32:32,800 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_3~0 4) c_~get_5~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105|) 0)) (forall ((v_ArrVal_840 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| v_ArrVal_840) c_~get_5~0.base) .cse0) 2147483648)))) (forall ((v_ArrVal_840 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_840) c_~get_5~0.base) .cse0) 2147483648)) (forall ((|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| Int) (v_ArrVal_839 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_839) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_105| v_ArrVal_840) c_~get_5~0.base) .cse0) 2147483648))))) is different from false [2025-03-15 02:32:46,751 INFO L124 PetriNetUnfolderBase]: 4822/17982 cut-off events. [2025-03-15 02:32:46,752 INFO L125 PetriNetUnfolderBase]: For 805360/806818 co-relation queries the response was YES. [2025-03-15 02:32:46,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158707 conditions, 17982 events. 4822/17982 cut-off events. For 805360/806818 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 206869 event pairs, 436 based on Foata normal form. 6/16401 useless extension candidates. Maximal degree in co-relation 22366. Up to 3303 conditions per place. [2025-03-15 02:32:47,054 INFO L140 encePairwiseOnDemand]: 385/460 looper letters, 2293 selfloop transitions, 446 changer transitions 112/3476 dead transitions. [2025-03-15 02:32:47,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1314 places, 3476 transitions, 112805 flow [2025-03-15 02:32:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-03-15 02:32:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2025-03-15 02:32:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 17717 transitions. [2025-03-15 02:32:47,062 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.49378483835005577 [2025-03-15 02:32:47,062 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 875 predicate places. [2025-03-15 02:32:47,062 INFO L471 AbstractCegarLoop]: Abstraction has has 1314 places, 3476 transitions, 112805 flow [2025-03-15 02:32:47,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 224.9402985074627) internal successors, (15071), 67 states have internal predecessors, (15071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:32:47,064 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:32:47,065 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:32:47,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-15 02:32:47,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-15 02:32:47,265 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:32:47,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:32:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1804061946, now seen corresponding path program 1 times [2025-03-15 02:32:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:32:47,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861335906] [2025-03-15 02:32:47,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:32:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:32:47,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:32:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:32:47,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:32:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861335906] [2025-03-15 02:32:47,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861335906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:32:47,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:32:47,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:32:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904827137] [2025-03-15 02:32:47,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:32:47,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:32:47,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:32:47,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:32:47,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:32:47,406 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 460 [2025-03-15 02:32:47,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1314 places, 3476 transitions, 112805 flow. Second operand has 6 states, 6 states have (on average 403.1666666666667) internal successors, (2419), 6 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:32:47,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:32:47,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 460 [2025-03-15 02:32:47,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:03,270 INFO L124 PetriNetUnfolderBase]: 4960/18054 cut-off events. [2025-03-15 02:33:03,270 INFO L125 PetriNetUnfolderBase]: For 958545/959991 co-relation queries the response was YES. [2025-03-15 02:33:03,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169623 conditions, 18054 events. 4960/18054 cut-off events. For 958545/959991 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 207854 event pairs, 436 based on Foata normal form. 0/16533 useless extension candidates. Maximal degree in co-relation 22923. Up to 3352 conditions per place. [2025-03-15 02:33:03,569 INFO L140 encePairwiseOnDemand]: 451/460 looper letters, 509 selfloop transitions, 40 changer transitions 180/3524 dead transitions. [2025-03-15 02:33:03,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1320 places, 3524 transitions, 117340 flow [2025-03-15 02:33:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:33:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:33:03,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2857 transitions. [2025-03-15 02:33:03,574 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8872670807453417 [2025-03-15 02:33:03,574 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 881 predicate places. [2025-03-15 02:33:03,574 INFO L471 AbstractCegarLoop]: Abstraction has has 1320 places, 3524 transitions, 117340 flow [2025-03-15 02:33:03,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.1666666666667) internal successors, (2419), 6 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:33:03,575 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:03,575 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:33:03,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 02:33:03,575 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:33:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2016455578, now seen corresponding path program 1 times [2025-03-15 02:33:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306260996] [2025-03-15 02:33:03,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:33:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:33:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-15 02:33:03,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:03,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306260996] [2025-03-15 02:33:03,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306260996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:33:03,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:33:03,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:33:03,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164913589] [2025-03-15 02:33:03,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:33:03,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:33:03,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:03,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:33:03,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:33:03,862 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 460 [2025-03-15 02:33:03,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1320 places, 3524 transitions, 117340 flow. Second operand has 6 states, 6 states have (on average 403.3333333333333) internal successors, (2420), 6 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:33:03,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:03,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 460 [2025-03-15 02:33:03,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:33:20,055 INFO L124 PetriNetUnfolderBase]: 4918/17946 cut-off events. [2025-03-15 02:33:20,055 INFO L125 PetriNetUnfolderBase]: For 977627/979073 co-relation queries the response was YES. [2025-03-15 02:33:20,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173753 conditions, 17946 events. 4918/17946 cut-off events. For 977627/979073 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 206279 event pairs, 436 based on Foata normal form. 0/16491 useless extension candidates. Maximal degree in co-relation 23489. Up to 3676 conditions per place. [2025-03-15 02:33:20,279 INFO L140 encePairwiseOnDemand]: 450/460 looper letters, 274 selfloop transitions, 28 changer transitions 1670/3564 dead transitions. [2025-03-15 02:33:20,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1326 places, 3564 transitions, 121812 flow [2025-03-15 02:33:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:33:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:33:20,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2850 transitions. [2025-03-15 02:33:20,281 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8850931677018633 [2025-03-15 02:33:20,282 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 887 predicate places. [2025-03-15 02:33:20,282 INFO L471 AbstractCegarLoop]: Abstraction has has 1326 places, 3564 transitions, 121812 flow [2025-03-15 02:33:20,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 403.3333333333333) internal successors, (2420), 6 states have internal predecessors, (2420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:33:20,282 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:33:20,283 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:33:20,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 02:33:20,283 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:33:20,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:33:20,284 INFO L85 PathProgramCache]: Analyzing trace with hash -890922946, now seen corresponding path program 2 times [2025-03-15 02:33:20,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:33:20,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106300363] [2025-03-15 02:33:20,284 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:33:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:33:20,326 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:33:20,326 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:33:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:33:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:33:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106300363] [2025-03-15 02:33:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106300363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:33:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838030465] [2025-03-15 02:33:23,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:33:23,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:33:23,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:33:23,409 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:33:23,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-15 02:33:23,571 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:33:23,571 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:33:23,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-15 02:33:23,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:33:23,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:33:24,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:33:24,612 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:33:24,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:33:24,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:33:25,124 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 02:33:25,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-15 02:33:25,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:33:25,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:33:26,222 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-15 02:33:26,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-15 02:33:26,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2025-03-15 02:33:26,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-15 02:33:26,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-03-15 02:33:27,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:33:27,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 32 [2025-03-15 02:33:27,155 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:33:27,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:33:27,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_920 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_113| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_920))) (store .cse0 |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_113| (store (select .cse0 |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_113|) 0 1))) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 9223372039002259456) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_113|) 0)))) is different from false [2025-03-15 02:33:31,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:33:31,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2025-03-15 02:33:31,060 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 02:33:31,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:33:31,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1013 treesize of output 991 [2025-03-15 02:33:31,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 294 [2025-03-15 02:33:31,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 350 treesize of output 314 [2025-03-15 02:33:31,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:33:31,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 50 [2025-03-15 02:33:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-03-15 02:33:34,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838030465] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:33:34,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:33:34,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37, 35] total 108 [2025-03-15 02:33:34,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510020289] [2025-03-15 02:33:34,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:33:34,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2025-03-15 02:33:34,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:33:34,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2025-03-15 02:33:34,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=10910, Unknown=14, NotChecked=212, Total=11772 [2025-03-15 02:33:34,332 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 460 [2025-03-15 02:33:34,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1326 places, 3564 transitions, 121812 flow. Second operand has 109 states, 109 states have (on average 203.0) internal successors, (22127), 109 states have internal predecessors, (22127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:33:34,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:33:34,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 460 [2025-03-15 02:33:34,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:34:04,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:35:07,505 INFO L124 PetriNetUnfolderBase]: 12442/45372 cut-off events. [2025-03-15 02:35:07,506 INFO L125 PetriNetUnfolderBase]: For 2638921/2643085 co-relation queries the response was YES. [2025-03-15 02:35:08,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453794 conditions, 45372 events. 12442/45372 cut-off events. For 2638921/2643085 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 606560 event pairs, 1070 based on Foata normal form. 0/41481 useless extension candidates. Maximal degree in co-relation 40254. Up to 11156 conditions per place. [2025-03-15 02:35:08,614 INFO L140 encePairwiseOnDemand]: 347/460 looper letters, 4247 selfloop transitions, 491 changer transitions 2911/8000 dead transitions. [2025-03-15 02:35:08,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1531 places, 8000 transitions, 301456 flow [2025-03-15 02:35:08,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-03-15 02:35:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2025-03-15 02:35:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 41984 transitions. [2025-03-15 02:35:08,631 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4430561418319966 [2025-03-15 02:35:08,632 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 1092 predicate places. [2025-03-15 02:35:08,632 INFO L471 AbstractCegarLoop]: Abstraction has has 1531 places, 8000 transitions, 301456 flow [2025-03-15 02:35:08,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 203.0) internal successors, (22127), 109 states have internal predecessors, (22127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:08,635 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:08,635 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:08,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-15 02:35:08,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-15 02:35:08,836 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:35:08,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash 577166324, now seen corresponding path program 3 times [2025-03-15 02:35:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:08,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942752919] [2025-03-15 02:35:08,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 02:35:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:08,879 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-15 02:35:08,879 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:35:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-15 02:35:09,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:09,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942752919] [2025-03-15 02:35:09,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942752919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:35:09,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009874358] [2025-03-15 02:35:09,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 02:35:09,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:35:09,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:35:09,281 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:35:09,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-15 02:35:09,409 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-15 02:35:09,409 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:35:09,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:35:09,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:35:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-15 02:35:09,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:35:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-15 02:35:10,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009874358] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:35:10,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:35:10,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2025-03-15 02:35:10,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150934252] [2025-03-15 02:35:10,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:35:10,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-15 02:35:10,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:10,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-15 02:35:10,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-03-15 02:35:10,152 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 460 [2025-03-15 02:35:10,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1531 places, 8000 transitions, 301456 flow. Second operand has 29 states, 29 states have (on average 331.0) internal successors, (9599), 29 states have internal predecessors, (9599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:10,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:10,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 460 [2025-03-15 02:35:10,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:57,097 INFO L124 PetriNetUnfolderBase]: 7525/27839 cut-off events. [2025-03-15 02:35:57,098 INFO L125 PetriNetUnfolderBase]: For 1732007/1734947 co-relation queries the response was YES. [2025-03-15 02:35:57,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289363 conditions, 27839 events. 7525/27839 cut-off events. For 1732007/1734947 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 333348 event pairs, 718 based on Foata normal form. 0/25437 useless extension candidates. Maximal degree in co-relation 32868. Up to 6926 conditions per place. [2025-03-15 02:35:57,685 INFO L140 encePairwiseOnDemand]: 419/460 looper letters, 2463 selfloop transitions, 267 changer transitions 1888/5463 dead transitions. [2025-03-15 02:35:57,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1557 places, 5463 transitions, 206374 flow [2025-03-15 02:35:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-15 02:35:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-15 02:35:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 19501 transitions. [2025-03-15 02:35:57,695 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7185335298452469 [2025-03-15 02:35:57,696 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 1118 predicate places. [2025-03-15 02:35:57,696 INFO L471 AbstractCegarLoop]: Abstraction has has 1557 places, 5463 transitions, 206374 flow [2025-03-15 02:35:57,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 331.0) internal successors, (9599), 29 states have internal predecessors, (9599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:57,698 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:57,698 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:57,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-15 02:35:57,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-15 02:35:57,903 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:35:57,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 554483717, now seen corresponding path program 2 times [2025-03-15 02:35:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179439777] [2025-03-15 02:35:57,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:35:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:58,013 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:35:58,013 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:36:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:01,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:01,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179439777] [2025-03-15 02:36:01,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179439777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:36:01,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41861311] [2025-03-15 02:36:01,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:36:01,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:01,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:01,232 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:36:01,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-15 02:36:01,381 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:36:01,381 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:36:01,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-15 02:36:01,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:36:01,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:36:01,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:36:02,510 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:36:02,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:36:02,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:36:03,128 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:36:03,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:36:03,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-15 02:36:03,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-15 02:36:04,056 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:36:04,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:36:04,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2025-03-15 02:36:04,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 43 [2025-03-15 02:36:04,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2025-03-15 02:36:05,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:36:05,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 34 [2025-03-15 02:36:05,022 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:05,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:36:09,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:36:09,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 68 [2025-03-15 02:36:09,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:36:09,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16663 treesize of output 16391 [2025-03-15 02:36:10,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3150 treesize of output 2910 [2025-03-15 02:36:17,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:36:17,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6604 treesize of output 6144 [2025-03-15 02:36:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:22,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41861311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:36:22,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:36:22,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 34, 36] total 106 [2025-03-15 02:36:22,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611892851] [2025-03-15 02:36:22,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:36:22,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2025-03-15 02:36:22,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:22,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2025-03-15 02:36:22,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=10700, Unknown=12, NotChecked=0, Total=11342 [2025-03-15 02:36:22,411 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 460 [2025-03-15 02:36:22,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1557 places, 5463 transitions, 206374 flow. Second operand has 107 states, 107 states have (on average 208.92523364485982) internal successors, (22355), 107 states have internal predecessors, (22355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:22,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:22,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 460 [2025-03-15 02:36:22,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:25,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:36:51,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:36:54,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:37:10,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 02:37:54,852 INFO L124 PetriNetUnfolderBase]: 7498/27707 cut-off events. [2025-03-15 02:37:54,852 INFO L125 PetriNetUnfolderBase]: For 1853034/1856334 co-relation queries the response was YES. [2025-03-15 02:37:55,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300300 conditions, 27707 events. 7498/27707 cut-off events. For 1853034/1856334 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 331044 event pairs, 718 based on Foata normal form. 36/25381 useless extension candidates. Maximal degree in co-relation 34679. Up to 6870 conditions per place. [2025-03-15 02:37:55,354 INFO L140 encePairwiseOnDemand]: 364/460 looper letters, 2819 selfloop transitions, 384 changer transitions 1944/5484 dead transitions. [2025-03-15 02:37:55,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1747 places, 5484 transitions, 217315 flow [2025-03-15 02:37:55,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2025-03-15 02:37:55,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2025-03-15 02:37:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 40105 transitions. [2025-03-15 02:37:55,374 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.45646483041201913 [2025-03-15 02:37:55,374 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 1308 predicate places. [2025-03-15 02:37:55,375 INFO L471 AbstractCegarLoop]: Abstraction has has 1747 places, 5484 transitions, 217315 flow [2025-03-15 02:37:55,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 208.92523364485982) internal successors, (22355), 107 states have internal predecessors, (22355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:37:55,378 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:55,378 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:55,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-03-15 02:37:55,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:55,579 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:37:55,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash -622634404, now seen corresponding path program 2 times [2025-03-15 02:37:55,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:55,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538602718] [2025-03-15 02:37:55,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:37:55,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:55,608 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:37:55,608 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:37:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:57,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538602718] [2025-03-15 02:37:57,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538602718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:37:57,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988863292] [2025-03-15 02:37:57,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:37:57,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:57,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:37:57,982 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:37:57,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-15 02:37:58,106 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:37:58,106 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:37:58,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-15 02:37:58,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:37:58,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:37:58,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:37:59,098 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:37:59,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:37:59,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:37:59,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:37:59,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:37:59,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:38:00,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-15 02:38:00,630 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-15 02:38:00,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 57 [2025-03-15 02:38:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 02:38:00,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2025-03-15 02:38:00,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 02:38:00,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 02:38:00,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2025-03-15 02:38:00,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 38 [2025-03-15 02:38:00,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 02:38:02,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:38:02,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 134 treesize of output 190 [2025-03-15 02:38:02,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-15 02:38:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:03,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:38:05,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:38:05,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-15 02:38:05,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:38:05,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 141 [2025-03-15 02:38:05,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-03-15 02:38:05,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-15 02:38:07,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 02:38:07,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988863292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:38:07,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:38:07,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 38, 33] total 105 [2025-03-15 02:38:07,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616594436] [2025-03-15 02:38:07,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:38:07,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2025-03-15 02:38:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:07,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2025-03-15 02:38:07,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=10619, Unknown=20, NotChecked=0, Total=11130 [2025-03-15 02:38:07,198 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 460 [2025-03-15 02:38:07,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1747 places, 5484 transitions, 217315 flow. Second operand has 106 states, 106 states have (on average 198.14150943396226) internal successors, (21003), 106 states have internal predecessors, (21003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:38:07,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:07,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 460 [2025-03-15 02:38:07,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:19,008 INFO L124 PetriNetUnfolderBase]: 7451/27426 cut-off events. [2025-03-15 02:39:19,008 INFO L125 PetriNetUnfolderBase]: For 1947520/1951012 co-relation queries the response was YES. [2025-03-15 02:39:19,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310356 conditions, 27426 events. 7451/27426 cut-off events. For 1947520/1951012 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 328246 event pairs, 704 based on Foata normal form. 0/25144 useless extension candidates. Maximal degree in co-relation 36869. Up to 6782 conditions per place. [2025-03-15 02:39:19,527 INFO L140 encePairwiseOnDemand]: 341/460 looper letters, 2621 selfloop transitions, 363 changer transitions 2556/5936 dead transitions. [2025-03-15 02:39:19,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1947 places, 5936 transitions, 242128 flow [2025-03-15 02:39:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2025-03-15 02:39:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2025-03-15 02:39:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 39870 transitions. [2025-03-15 02:39:19,548 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43121349772874756 [2025-03-15 02:39:19,549 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 1508 predicate places. [2025-03-15 02:39:19,549 INFO L471 AbstractCegarLoop]: Abstraction has has 1947 places, 5936 transitions, 242128 flow [2025-03-15 02:39:19,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 198.14150943396226) internal successors, (21003), 106 states have internal predecessors, (21003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:39:19,552 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:19,552 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:39:19,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-15 02:39:19,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:19,753 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:39:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash 883072137, now seen corresponding path program 4 times [2025-03-15 02:39:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011394709] [2025-03-15 02:39:19,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 02:39:19,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:19,772 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 02:39:19,772 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:39:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:39:20,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011394709] [2025-03-15 02:39:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011394709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:20,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137137443] [2025-03-15 02:39:20,018 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 02:39:20,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:20,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:20,021 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:39:20,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-15 02:39:20,146 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 02:39:20,146 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:39:20,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 02:39:20,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:39:20,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:39:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 33 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:39:21,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137137443] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:39:21,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:39:21,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 36 [2025-03-15 02:39:21,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414767242] [2025-03-15 02:39:21,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:39:21,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-15 02:39:21,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:21,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-15 02:39:21,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2025-03-15 02:39:21,025 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 460 [2025-03-15 02:39:21,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1947 places, 5936 transitions, 242128 flow. Second operand has 36 states, 36 states have (on average 345.55555555555554) internal successors, (12440), 36 states have internal predecessors, (12440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:39:21,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:21,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 460 [2025-03-15 02:39:21,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:39:46,248 INFO L124 PetriNetUnfolderBase]: 7448/27366 cut-off events. [2025-03-15 02:39:46,248 INFO L125 PetriNetUnfolderBase]: For 2055627/2059238 co-relation queries the response was YES. [2025-03-15 02:39:46,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315082 conditions, 27366 events. 7448/27366 cut-off events. For 2055627/2059238 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 322844 event pairs, 704 based on Foata normal form. 0/25091 useless extension candidates. Maximal degree in co-relation 37193. Up to 6740 conditions per place. [2025-03-15 02:39:46,869 INFO L140 encePairwiseOnDemand]: 435/460 looper letters, 1591 selfloop transitions, 188 changer transitions 2552/5892 dead transitions. [2025-03-15 02:39:46,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1977 places, 5892 transitions, 247010 flow [2025-03-15 02:39:46,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 02:39:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 02:39:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 10765 transitions. [2025-03-15 02:39:46,873 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7549088359046283 [2025-03-15 02:39:46,873 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 1538 predicate places. [2025-03-15 02:39:46,873 INFO L471 AbstractCegarLoop]: Abstraction has has 1977 places, 5892 transitions, 247010 flow [2025-03-15 02:39:46,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 345.55555555555554) internal successors, (12440), 36 states have internal predecessors, (12440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:39:46,874 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:39:46,875 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:39:46,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-15 02:39:47,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-15 02:39:47,075 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:39:47,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:39:47,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2093227303, now seen corresponding path program 2 times [2025-03-15 02:39:47,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:39:47,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076784050] [2025-03-15 02:39:47,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:39:47,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:39:47,107 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:39:47,108 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:39:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-15 02:39:49,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:39:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076784050] [2025-03-15 02:39:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076784050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:39:49,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394431383] [2025-03-15 02:39:49,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:39:49,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:39:49,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:39:49,931 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:39:49,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-15 02:39:50,065 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:39:50,065 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:39:50,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-15 02:39:50,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:39:50,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:39:50,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-15 02:39:50,770 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-15 02:39:50,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-15 02:39:50,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:39:50,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:39:51,029 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-15 02:39:51,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-15 02:39:51,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:39:51,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:39:51,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-15 02:39:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-15 02:39:51,268 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:39:51,420 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1159) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 9223372039002259456)) is different from false [2025-03-15 02:39:51,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1159 (Array Int Int)) (v_ArrVal_1157 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_153| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_153|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1157) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_153| v_ArrVal_1159) c_~get_5~0.base) (+ (* c_~id_3~0 4) c_~get_5~0.offset)) 9223372039002259456))) is different from false [2025-03-15 02:39:52,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:39:52,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-03-15 02:39:52,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:39:52,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 142 [2025-03-15 02:39:52,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2025-03-15 02:39:52,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-03-15 02:39:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 16 not checked. [2025-03-15 02:39:53,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394431383] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:39:53,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:39:53,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 22, 23] total 82 [2025-03-15 02:39:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327106397] [2025-03-15 02:39:53,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:39:53,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2025-03-15 02:39:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:39:53,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2025-03-15 02:39:53,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=6125, Unknown=20, NotChecked=318, Total=6806 [2025-03-15 02:39:53,237 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 460 [2025-03-15 02:39:53,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1977 places, 5892 transitions, 247010 flow. Second operand has 83 states, 83 states have (on average 196.90361445783134) internal successors, (16343), 83 states have internal predecessors, (16343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:39:53,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:39:53,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 460 [2025-03-15 02:39:53,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:40:44,355 INFO L124 PetriNetUnfolderBase]: 8255/30229 cut-off events. [2025-03-15 02:40:44,355 INFO L125 PetriNetUnfolderBase]: For 2426490/2430943 co-relation queries the response was YES. [2025-03-15 02:40:44,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359593 conditions, 30229 events. 8255/30229 cut-off events. For 2426490/2430943 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 365198 event pairs, 762 based on Foata normal form. 0/27733 useless extension candidates. Maximal degree in co-relation 40703. Up to 7765 conditions per place. [2025-03-15 02:40:45,093 INFO L140 encePairwiseOnDemand]: 389/460 looper letters, 2829 selfloop transitions, 492 changer transitions 2575/6342 dead transitions. [2025-03-15 02:40:45,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2075 places, 6342 transitions, 279394 flow [2025-03-15 02:40:45,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-15 02:40:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2025-03-15 02:40:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 19850 transitions. [2025-03-15 02:40:45,101 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4272492466637968 [2025-03-15 02:40:45,101 INFO L298 CegarLoopForPetriNet]: 439 programPoint places, 1636 predicate places. [2025-03-15 02:40:45,101 INFO L471 AbstractCegarLoop]: Abstraction has has 2075 places, 6342 transitions, 279394 flow [2025-03-15 02:40:45,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 196.90361445783134) internal successors, (16343), 83 states have internal predecessors, (16343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:40:45,103 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:40:45,104 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:40:45,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-15 02:40:45,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-03-15 02:40:45,304 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-03-15 02:40:45,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:40:45,306 INFO L85 PathProgramCache]: Analyzing trace with hash -538205334, now seen corresponding path program 5 times [2025-03-15 02:40:45,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:40:45,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272189433] [2025-03-15 02:40:45,306 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 02:40:45,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:40:45,364 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-15 02:40:45,365 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:40:47,439 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-15 02:40:47,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:40:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272189433] [2025-03-15 02:40:47,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272189433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:40:47,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139986223] [2025-03-15 02:40:47,439 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 02:40:47,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:40:47,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:40:47,442 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:40:47,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-15 02:40:47,600 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-15 02:40:47,600 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:40:47,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-15 02:40:47,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:40:47,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-15 02:40:47,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-03-15 02:40:48,253 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-15 02:40:48,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-15 02:40:48,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:40:48,676 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-15 02:40:48,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-15 02:40:48,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:40:49,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:40:49,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:40:49,326 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-15 02:40:49,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-15 02:40:49,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-15 02:40:49,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2025-03-15 02:40:49,595 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-15 02:40:49,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:40:49,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base| v_ArrVal_1217) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 9223372039002259456)) is different from false [2025-03-15 02:40:50,026 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1216 (Array Int Int)) (|v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_161| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_161|) 0)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_bool_array_~arr~1#1.base| v_ArrVal_1216) |v_ULTIMATE.start_create_fresh_bool_array_#t~malloc38#1.base_161| v_ArrVal_1217) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 9223372039002259456))) is different from false [2025-03-15 02:40:51,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:40:51,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2025-03-15 02:40:51,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 02:40:51,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 617 treesize of output 585 [2025-03-15 02:40:51,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 53 [2025-03-15 02:40:51,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2025-03-15 02:40:51,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2025-03-15 02:40:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 30 trivial. 15 not checked. [2025-03-15 02:40:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139986223] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:40:53,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:40:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29, 26] total 73 [2025-03-15 02:40:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230054130] [2025-03-15 02:40:53,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:40:53,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2025-03-15 02:40:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:40:53,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2025-03-15 02:40:53,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=359, Invalid=4738, Unknown=23, NotChecked=282, Total=5402 [2025-03-15 02:40:53,692 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 460 [2025-03-15 02:40:53,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2075 places, 6342 transitions, 279394 flow. Second operand has 74 states, 74 states have (on average 228.85135135135135) internal successors, (16935), 74 states have internal predecessors, (16935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:40:53,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:40:53,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 460 [2025-03-15 02:40:53,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 02:41:26,696 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 02:41:26,696 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 02:41:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-15 02:41:26,814 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 44 remaining) [2025-03-15 02:41:26,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-15 02:41:27,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:41:27,015 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). [2025-03-15 02:41:27,017 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 44 remaining) [2025-03-15 02:41:27,017 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 44 remaining) [2025-03-15 02:41:27,018 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 44 remaining) [2025-03-15 02:41:27,019 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 44 remaining) [2025-03-15 02:41:27,021 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:41:27,034 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:41:27,034 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:41:27,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:41:27 BasicIcfg [2025-03-15 02:41:27,040 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:41:27,040 INFO L158 Benchmark]: Toolchain (without parser) took 785199.30ms. Allocated memory was 71.3MB in the beginning and 2.9GB in the end (delta: 2.9GB). Free memory was 44.0MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 02:41:27,040 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:41:27,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.56ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 31.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 02:41:27,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.13ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 28.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 02:41:27,041 INFO L158 Benchmark]: Boogie Preprocessor took 44.08ms. Allocated memory is still 71.3MB. Free memory was 28.7MB in the beginning and 26.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:41:27,041 INFO L158 Benchmark]: RCFGBuilder took 615.02ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 22.3MB in the end (delta: 4.4MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2025-03-15 02:41:27,041 INFO L158 Benchmark]: TraceAbstraction took 784200.95ms. Allocated memory was 71.3MB in the beginning and 2.9GB in the end (delta: 2.9GB). Free memory was 21.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 02:41:27,042 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.18ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.56ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 31.2MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.13ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 28.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.08ms. Allocated memory is still 71.3MB. Free memory was 28.7MB in the beginning and 26.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 615.02ms. Allocated memory is still 71.3MB. Free memory was 26.7MB in the beginning and 22.3MB in the end (delta: 4.4MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * TraceAbstraction took 784200.95ms. Allocated memory was 71.3MB in the beginning and 2.9GB in the end (delta: 2.9GB). Free memory was 21.3MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 123]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (74states, 223/460 universal loopers) in iteration 45,while PetriNetUnfolder was constructing finite prefix that currently has 245099 conditions, 19341 events (5194/19340 cut-off events. For 1758850/1763384 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 232392 event pairs, 502 based on Foata normal form. 72/18470 useless extension candidates. Maximal degree in co-relation 41186. Up to 4329 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 579 locations, 44 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: 784.1s, OverallIterations: 45, TraceHistogramMax: 11, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 664.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1640 mSolverCounterUnknown, 21898 SdHoareTripleChecker+Valid, 143.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21898 mSDsluCounter, 118241 SdHoareTripleChecker+Invalid, 133.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9794 IncrementalHoareTripleChecker+Unchecked, 114150 mSDsCounter, 1593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 123057 IncrementalHoareTripleChecker+Invalid, 136084 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1593 mSolverCounterUnsat, 4091 mSDtfsCounter, 123057 mSolverCounterSat, 0.7s SdHoareTripleChecker+Time, 1640 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15226 GetRequests, 12403 SyntacticMatches, 94 SemanticMatches, 2729 ConstructedPredicates, 35 IntricatePredicates, 1 DeprecatedPredicates, 140861 ImplicationChecksByTransitivity, 167.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301456occurred in iteration=39, InterpolantAutomatonStates: 1756, 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.6s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 109.0s InterpolantComputationTime, 16892 NumberOfCodeBlocks, 16214 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 23293 ConstructedInterpolants, 1807 QuantifiedInterpolants, 191207 SizeOfPredicates, 562 NumberOfNonLiveVariables, 11470 ConjunctsInSsa, 939 ConjunctsInUnsatCore, 98 InterpolantComputations, 21 PerfectInterpolantSequences, 2739/4135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown