./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-match-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-match-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:24:53,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:24:53,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:24:53,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:24:53,208 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:24:53,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:24:53,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:24:53,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:24:53,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:24:53,232 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:24:53,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:24:53,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:24:53,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:24:53,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:24:53,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:24:53,233 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:24:53,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:53,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:24:53,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:24:53,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:24:53,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:24:53,236 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f [2025-03-04 15:24:53,483 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:24:53,491 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:24:53,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:24:53,494 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:24:53,494 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:24:53,496 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2025-03-04 15:24:54,633 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbdf94304/d8ee4fa1885442f3b85a81294c62cc31/FLAG55c5a4552 [2025-03-04 15:24:54,975 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:24:54,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2025-03-04 15:24:54,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbdf94304/d8ee4fa1885442f3b85a81294c62cc31/FLAG55c5a4552 [2025-03-04 15:24:55,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbdf94304/d8ee4fa1885442f3b85a81294c62cc31 [2025-03-04 15:24:55,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:24:55,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:24:55,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:55,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:24:55,223 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:24:55,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b06b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55, skipping insertion in model container [2025-03-04 15:24:55,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:24:55,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:55,376 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:24:55,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:55,404 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:24:55,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55 WrapperNode [2025-03-04 15:24:55,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:55,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:55,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:24:55,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:24:55,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,438 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 201 [2025-03-04 15:24:55,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:55,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:24:55,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:24:55,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:24:55,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,472 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:24:55,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,472 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:24:55,486 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:24:55,486 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:24:55,486 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:24:55,486 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (1/1) ... [2025-03-04 15:24:55,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:55,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:55,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:24:55,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:24:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:24:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:24:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:24:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:24:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:24:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:24:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:24:55,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:24:55,539 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:24:55,604 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:24:55,606 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:24:55,984 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:24:55,984 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:24:56,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:24:56,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:24:56,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:56 BoogieIcfgContainer [2025-03-04 15:24:56,218 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:24:56,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:24:56,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:24:56,224 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:24:56,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:24:55" (1/3) ... [2025-03-04 15:24:56,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7085f9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:56, skipping insertion in model container [2025-03-04 15:24:56,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:55" (2/3) ... [2025-03-04 15:24:56,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7085f9eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:56, skipping insertion in model container [2025-03-04 15:24:56,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:56" (3/3) ... [2025-03-04 15:24:56,227 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2025-03-04 15:24:56,243 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:24:56,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-symm.wvr.c that has 3 procedures, 77 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-03-04 15:24:56,245 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:24:56,336 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:24:56,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 182 flow [2025-03-04 15:24:56,408 INFO L124 PetriNetUnfolderBase]: 8/82 cut-off events. [2025-03-04 15:24:56,410 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:24:56,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 82 events. 8/82 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 276 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2025-03-04 15:24:56,413 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 84 transitions, 182 flow [2025-03-04 15:24:56,417 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 80 transitions, 169 flow [2025-03-04 15:24:56,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:24:56,433 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=LoopHeads, 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;@461fb0fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:24:56,434 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 15:24:56,439 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:24:56,441 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-03-04 15:24:56,441 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:24:56,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:56,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:24:56,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 585866874, now seen corresponding path program 1 times [2025-03-04 15:24:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:56,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403419] [2025-03-04 15:24:56,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:56,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:56,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:24:56,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:24:56,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:56,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:56,619 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-04 15:24:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403419] [2025-03-04 15:24:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:56,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902196960] [2025-03-04 15:24:56,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:56,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:56,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:56,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:56,737 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-03-04 15:24:56,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-04 15:24:56,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:56,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-03-04 15:24:56,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:57,163 INFO L124 PetriNetUnfolderBase]: 1141/2594 cut-off events. [2025-03-04 15:24:57,163 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-04 15:24:57,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4413 conditions, 2594 events. 1141/2594 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 19326 event pairs, 271 based on Foata normal form. 104/2253 useless extension candidates. Maximal degree in co-relation 4346. Up to 872 conditions per place. [2025-03-04 15:24:57,185 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 64 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2025-03-04 15:24:57,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 114 transitions, 391 flow [2025-03-04 15:24:57,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:57,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2025-03-04 15:24:57,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-03-04 15:24:57,196 INFO L175 Difference]: Start difference. First operand has 79 places, 80 transitions, 169 flow. Second operand 4 states and 248 transitions. [2025-03-04 15:24:57,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 114 transitions, 391 flow [2025-03-04 15:24:57,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 114 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:57,202 INFO L231 Difference]: Finished difference. Result has 80 places, 84 transitions, 230 flow [2025-03-04 15:24:57,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=80, PETRI_TRANSITIONS=84} [2025-03-04 15:24:57,206 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2025-03-04 15:24:57,206 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 230 flow [2025-03-04 15:24:57,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.25) internal successors, (173), 4 states have internal predecessors, (173), 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-04 15:24:57,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:57,206 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:24:57,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:24:57,206 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:57,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash 982004484, now seen corresponding path program 1 times [2025-03-04 15:24:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:57,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045870488] [2025-03-04 15:24:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:57,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:24:57,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:24:57,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:57,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:57,279 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-04 15:24:57,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:57,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045870488] [2025-03-04 15:24:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045870488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:57,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:57,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:57,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103270786] [2025-03-04 15:24:57,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:57,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:57,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:57,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:57,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:57,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-03-04 15:24:57,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-04 15:24:57,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:57,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-03-04 15:24:57,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:57,562 INFO L124 PetriNetUnfolderBase]: 809/2245 cut-off events. [2025-03-04 15:24:57,562 INFO L125 PetriNetUnfolderBase]: For 544/574 co-relation queries the response was YES. [2025-03-04 15:24:57,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 2245 events. 809/2245 cut-off events. For 544/574 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18061 event pairs, 320 based on Foata normal form. 30/1880 useless extension candidates. Maximal degree in co-relation 3102. Up to 637 conditions per place. [2025-03-04 15:24:57,576 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 44 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2025-03-04 15:24:57,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 99 transitions, 366 flow [2025-03-04 15:24:57,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:57,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2025-03-04 15:24:57,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-04 15:24:57,579 INFO L175 Difference]: Start difference. First operand has 80 places, 84 transitions, 230 flow. Second operand 4 states and 240 transitions. [2025-03-04 15:24:57,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 99 transitions, 366 flow [2025-03-04 15:24:57,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 99 transitions, 366 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:57,583 INFO L231 Difference]: Finished difference. Result has 83 places, 84 transitions, 254 flow [2025-03-04 15:24:57,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=83, PETRI_TRANSITIONS=84} [2025-03-04 15:24:57,584 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-03-04 15:24:57,584 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 254 flow [2025-03-04 15:24:57,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.0) internal successors, (196), 4 states have internal predecessors, (196), 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-04 15:24:57,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:57,585 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:57,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:24:57,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:57,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 377337758, now seen corresponding path program 1 times [2025-03-04 15:24:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447733473] [2025-03-04 15:24:57,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:57,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:24:57,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:24:57,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:57,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:57,666 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-04 15:24:57,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:57,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447733473] [2025-03-04 15:24:57,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447733473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:57,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:57,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:57,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9089129] [2025-03-04 15:24:57,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:57,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:57,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:57,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:57,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:57,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-03-04 15:24:57,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 84 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-04 15:24:57,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:57,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-03-04 15:24:57,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:57,903 INFO L124 PetriNetUnfolderBase]: 914/2260 cut-off events. [2025-03-04 15:24:57,904 INFO L125 PetriNetUnfolderBase]: For 1314/1338 co-relation queries the response was YES. [2025-03-04 15:24:57,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4536 conditions, 2260 events. 914/2260 cut-off events. For 1314/1338 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 17207 event pairs, 322 based on Foata normal form. 50/1962 useless extension candidates. Maximal degree in co-relation 1932. Up to 704 conditions per place. [2025-03-04 15:24:57,917 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 46 selfloop transitions, 7 changer transitions 0/97 dead transitions. [2025-03-04 15:24:57,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 97 transitions, 386 flow [2025-03-04 15:24:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 231 transitions. [2025-03-04 15:24:57,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6875 [2025-03-04 15:24:57,919 INFO L175 Difference]: Start difference. First operand has 83 places, 84 transitions, 254 flow. Second operand 4 states and 231 transitions. [2025-03-04 15:24:57,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 97 transitions, 386 flow [2025-03-04 15:24:57,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 97 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:57,924 INFO L231 Difference]: Finished difference. Result has 83 places, 83 transitions, 256 flow [2025-03-04 15:24:57,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=83, PETRI_TRANSITIONS=83} [2025-03-04 15:24:57,924 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2025-03-04 15:24:57,924 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 83 transitions, 256 flow [2025-03-04 15:24:57,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-04 15:24:57,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:57,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:57,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:24:57,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:57,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash 367570215, now seen corresponding path program 1 times [2025-03-04 15:24:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:57,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145318819] [2025-03-04 15:24:57,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:57,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:57,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:24:57,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:24:57,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:57,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:57,999 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-04 15:24:57,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:57,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145318819] [2025-03-04 15:24:57,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145318819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:58,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:58,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:58,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624974662] [2025-03-04 15:24:58,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:58,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:58,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:58,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:58,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:58,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-03-04 15:24:58,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-04 15:24:58,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:58,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-03-04 15:24:58,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:58,437 INFO L124 PetriNetUnfolderBase]: 1639/3645 cut-off events. [2025-03-04 15:24:58,437 INFO L125 PetriNetUnfolderBase]: For 2654/2797 co-relation queries the response was YES. [2025-03-04 15:24:58,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7669 conditions, 3645 events. 1639/3645 cut-off events. For 2654/2797 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 29186 event pairs, 415 based on Foata normal form. 236/3287 useless extension candidates. Maximal degree in co-relation 3858. Up to 1186 conditions per place. [2025-03-04 15:24:58,456 INFO L140 encePairwiseOnDemand]: 69/84 looper letters, 77 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2025-03-04 15:24:58,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 125 transitions, 624 flow [2025-03-04 15:24:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2025-03-04 15:24:58,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2025-03-04 15:24:58,457 INFO L175 Difference]: Start difference. First operand has 83 places, 83 transitions, 256 flow. Second operand 4 states and 246 transitions. [2025-03-04 15:24:58,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 125 transitions, 624 flow [2025-03-04 15:24:58,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 125 transitions, 598 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:58,465 INFO L231 Difference]: Finished difference. Result has 84 places, 87 transitions, 308 flow [2025-03-04 15:24:58,465 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=308, PETRI_PLACES=84, PETRI_TRANSITIONS=87} [2025-03-04 15:24:58,465 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2025-03-04 15:24:58,465 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 87 transitions, 308 flow [2025-03-04 15:24:58,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 4 states have internal predecessors, (175), 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-04 15:24:58,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:58,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:58,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:24:58,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:58,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1187431802, now seen corresponding path program 1 times [2025-03-04 15:24:58,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666910555] [2025-03-04 15:24:58,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:58,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:24:58,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:24:58,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:58,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:58,569 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-04 15:24:58,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:58,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666910555] [2025-03-04 15:24:58,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666910555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:58,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:58,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:58,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181469692] [2025-03-04 15:24:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:58,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:58,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:58,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:58,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:58,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-03-04 15:24:58,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 87 transitions, 308 flow. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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-04 15:24:58,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:58,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-03-04 15:24:58,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:58,939 INFO L124 PetriNetUnfolderBase]: 1942/3873 cut-off events. [2025-03-04 15:24:58,939 INFO L125 PetriNetUnfolderBase]: For 2423/2639 co-relation queries the response was YES. [2025-03-04 15:24:58,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9293 conditions, 3873 events. 1942/3873 cut-off events. For 2423/2639 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 28699 event pairs, 502 based on Foata normal form. 114/3703 useless extension candidates. Maximal degree in co-relation 5121. Up to 1574 conditions per place. [2025-03-04 15:24:58,962 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 72 selfloop transitions, 12 changer transitions 0/124 dead transitions. [2025-03-04 15:24:58,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 124 transitions, 622 flow [2025-03-04 15:24:58,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:58,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 291 transitions. [2025-03-04 15:24:58,963 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6928571428571428 [2025-03-04 15:24:58,964 INFO L175 Difference]: Start difference. First operand has 84 places, 87 transitions, 308 flow. Second operand 5 states and 291 transitions. [2025-03-04 15:24:58,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 124 transitions, 622 flow [2025-03-04 15:24:58,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 124 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:58,973 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 354 flow [2025-03-04 15:24:58,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=354, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2025-03-04 15:24:58,975 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2025-03-04 15:24:58,975 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 354 flow [2025-03-04 15:24:58,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 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-04 15:24:58,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:58,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:58,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:24:58,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:58,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1187430809, now seen corresponding path program 1 times [2025-03-04 15:24:58,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:58,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876015065] [2025-03-04 15:24:58,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:58,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:24:58,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:24:58,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:58,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:59,017 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-04 15:24:59,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:59,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876015065] [2025-03-04 15:24:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876015065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:59,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:59,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607484284] [2025-03-04 15:24:59,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:59,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:59,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:59,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:59,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-03-04 15:24:59,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-04 15:24:59,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:59,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-03-04 15:24:59,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:59,316 INFO L124 PetriNetUnfolderBase]: 1466/3451 cut-off events. [2025-03-04 15:24:59,316 INFO L125 PetriNetUnfolderBase]: For 3960/4100 co-relation queries the response was YES. [2025-03-04 15:24:59,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8581 conditions, 3451 events. 1466/3451 cut-off events. For 3960/4100 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 27903 event pairs, 468 based on Foata normal form. 144/3301 useless extension candidates. Maximal degree in co-relation 5168. Up to 938 conditions per place. [2025-03-04 15:24:59,351 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 74 selfloop transitions, 9 changer transitions 0/123 dead transitions. [2025-03-04 15:24:59,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 123 transitions, 656 flow [2025-03-04 15:24:59,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:59,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:59,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2025-03-04 15:24:59,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-04 15:24:59,353 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 354 flow. Second operand 4 states and 240 transitions. [2025-03-04 15:24:59,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 123 transitions, 656 flow [2025-03-04 15:24:59,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 123 transitions, 646 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:59,360 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 350 flow [2025-03-04 15:24:59,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2025-03-04 15:24:59,361 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 11 predicate places. [2025-03-04 15:24:59,361 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 350 flow [2025-03-04 15:24:59,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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-04 15:24:59,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:59,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:59,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:24:59,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:59,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:59,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1490224612, now seen corresponding path program 1 times [2025-03-04 15:24:59,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:59,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416692943] [2025-03-04 15:24:59,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:59,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:59,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:24:59,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:24:59,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:59,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:59,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416692943] [2025-03-04 15:24:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416692943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:59,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013490328] [2025-03-04 15:24:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:59,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:59,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:59,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:59,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:59,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-03-04 15:24:59,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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-04 15:24:59,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:59,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-03-04 15:24:59,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:59,633 INFO L124 PetriNetUnfolderBase]: 1306/3383 cut-off events. [2025-03-04 15:24:59,633 INFO L125 PetriNetUnfolderBase]: For 4765/4907 co-relation queries the response was YES. [2025-03-04 15:24:59,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8194 conditions, 3383 events. 1306/3383 cut-off events. For 4765/4907 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 29071 event pairs, 447 based on Foata normal form. 85/3058 useless extension candidates. Maximal degree in co-relation 3028. Up to 981 conditions per place. [2025-03-04 15:24:59,654 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 53 selfloop transitions, 7 changer transitions 0/104 dead transitions. [2025-03-04 15:24:59,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 104 transitions, 595 flow [2025-03-04 15:24:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:59,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-03-04 15:24:59,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7113095238095238 [2025-03-04 15:24:59,656 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 350 flow. Second operand 4 states and 239 transitions. [2025-03-04 15:24:59,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 104 transitions, 595 flow [2025-03-04 15:24:59,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 583 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:59,665 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 367 flow [2025-03-04 15:24:59,665 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=367, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2025-03-04 15:24:59,666 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2025-03-04 15:24:59,666 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 367 flow [2025-03-04 15:24:59,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.5) internal successors, (198), 4 states have internal predecessors, (198), 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-04 15:24:59,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:59,666 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:59,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:24:59,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:24:59,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:59,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1844320385, now seen corresponding path program 1 times [2025-03-04 15:24:59,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:59,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501256021] [2025-03-04 15:24:59,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:59,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:59,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:24:59,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:24:59,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:59,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:59,749 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-04 15:24:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501256021] [2025-03-04 15:24:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501256021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:59,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574028910] [2025-03-04 15:24:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:59,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:59,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:59,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:59,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:24:59,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-03-04 15:24:59,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-04 15:24:59,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:59,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-03-04 15:24:59,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:00,261 INFO L124 PetriNetUnfolderBase]: 2074/4129 cut-off events. [2025-03-04 15:25:00,261 INFO L125 PetriNetUnfolderBase]: For 6118/6358 co-relation queries the response was YES. [2025-03-04 15:25:00,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11230 conditions, 4129 events. 2074/4129 cut-off events. For 6118/6358 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 31419 event pairs, 636 based on Foata normal form. 252/3989 useless extension candidates. Maximal degree in co-relation 4659. Up to 1331 conditions per place. [2025-03-04 15:25:00,281 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 133 selfloop transitions, 13 changer transitions 0/182 dead transitions. [2025-03-04 15:25:00,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 182 transitions, 1130 flow [2025-03-04 15:25:00,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:25:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:25:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 418 transitions. [2025-03-04 15:25:00,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6220238095238095 [2025-03-04 15:25:00,283 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 367 flow. Second operand 8 states and 418 transitions. [2025-03-04 15:25:00,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 182 transitions, 1130 flow [2025-03-04 15:25:00,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 182 transitions, 1097 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:00,296 INFO L231 Difference]: Finished difference. Result has 100 places, 87 transitions, 416 flow [2025-03-04 15:25:00,296 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=416, PETRI_PLACES=100, PETRI_TRANSITIONS=87} [2025-03-04 15:25:00,296 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2025-03-04 15:25:00,296 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 87 transitions, 416 flow [2025-03-04 15:25:00,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 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-04 15:25:00,297 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:00,297 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:00,297 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:00,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1047647147, now seen corresponding path program 1 times [2025-03-04 15:25:00,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:00,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363981561] [2025-03-04 15:25:00,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:00,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:00,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:00,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:00,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:00,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:00,349 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-04 15:25:00,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:00,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363981561] [2025-03-04 15:25:00,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363981561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:00,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:00,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:00,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139484070] [2025-03-04 15:25:00,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:00,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:00,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:00,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:00,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:00,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-03-04 15:25:00,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 87 transitions, 416 flow. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-04 15:25:00,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:00,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-03-04 15:25:00,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:00,617 INFO L124 PetriNetUnfolderBase]: 1376/3302 cut-off events. [2025-03-04 15:25:00,617 INFO L125 PetriNetUnfolderBase]: For 8941/9246 co-relation queries the response was YES. [2025-03-04 15:25:00,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9287 conditions, 3302 events. 1376/3302 cut-off events. For 8941/9246 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 27291 event pairs, 548 based on Foata normal form. 249/3118 useless extension candidates. Maximal degree in co-relation 8329. Up to 1169 conditions per place. [2025-03-04 15:25:00,634 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 59 selfloop transitions, 7 changer transitions 0/106 dead transitions. [2025-03-04 15:25:00,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 694 flow [2025-03-04 15:25:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 230 transitions. [2025-03-04 15:25:00,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6845238095238095 [2025-03-04 15:25:00,636 INFO L175 Difference]: Start difference. First operand has 100 places, 87 transitions, 416 flow. Second operand 4 states and 230 transitions. [2025-03-04 15:25:00,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 694 flow [2025-03-04 15:25:00,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 106 transitions, 675 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:00,646 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 415 flow [2025-03-04 15:25:00,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2025-03-04 15:25:00,646 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-03-04 15:25:00,647 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 415 flow [2025-03-04 15:25:00,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 4 states have internal predecessors, (191), 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-04 15:25:00,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:00,647 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:00,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:25:00,647 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:00,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2036920691, now seen corresponding path program 1 times [2025-03-04 15:25:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572675260] [2025-03-04 15:25:00,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:00,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:00,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:25:00,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:25:00,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:00,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:00,694 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-04 15:25:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572675260] [2025-03-04 15:25:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572675260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:25:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678772723] [2025-03-04 15:25:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:00,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:00,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:00,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:00,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:00,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-03-04 15:25:00,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 415 flow. Second operand has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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-04 15:25:00,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:00,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-03-04 15:25:00,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:01,098 INFO L124 PetriNetUnfolderBase]: 1840/3706 cut-off events. [2025-03-04 15:25:01,098 INFO L125 PetriNetUnfolderBase]: For 7055/7198 co-relation queries the response was YES. [2025-03-04 15:25:01,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11087 conditions, 3706 events. 1840/3706 cut-off events. For 7055/7198 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 27390 event pairs, 591 based on Foata normal form. 170/3692 useless extension candidates. Maximal degree in co-relation 10037. Up to 1244 conditions per place. [2025-03-04 15:25:01,116 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 114 selfloop transitions, 16 changer transitions 0/164 dead transitions. [2025-03-04 15:25:01,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 164 transitions, 1055 flow [2025-03-04 15:25:01,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 334 transitions. [2025-03-04 15:25:01,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626984126984127 [2025-03-04 15:25:01,117 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 415 flow. Second operand 6 states and 334 transitions. [2025-03-04 15:25:01,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 164 transitions, 1055 flow [2025-03-04 15:25:01,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 164 transitions, 1006 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:01,134 INFO L231 Difference]: Finished difference. Result has 100 places, 88 transitions, 447 flow [2025-03-04 15:25:01,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=100, PETRI_TRANSITIONS=88} [2025-03-04 15:25:01,135 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2025-03-04 15:25:01,135 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 88 transitions, 447 flow [2025-03-04 15:25:01,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.6) internal successors, (198), 5 states have internal predecessors, (198), 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-04 15:25:01,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:01,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:01,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:25:01,135 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:01,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1882677186, now seen corresponding path program 1 times [2025-03-04 15:25:01,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:01,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72478501] [2025-03-04 15:25:01,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:01,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:01,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:25:01,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:25:01,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:01,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:01,194 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-04 15:25:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72478501] [2025-03-04 15:25:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72478501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:01,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013953278] [2025-03-04 15:25:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:01,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:01,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:01,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:01,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-03-04 15:25:01,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 88 transitions, 447 flow. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-04 15:25:01,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:01,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-03-04 15:25:01,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:01,554 INFO L124 PetriNetUnfolderBase]: 2037/3944 cut-off events. [2025-03-04 15:25:01,554 INFO L125 PetriNetUnfolderBase]: For 14940/15332 co-relation queries the response was YES. [2025-03-04 15:25:01,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12831 conditions, 3944 events. 2037/3944 cut-off events. For 14940/15332 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 28740 event pairs, 498 based on Foata normal form. 310/4026 useless extension candidates. Maximal degree in co-relation 11596. Up to 1616 conditions per place. [2025-03-04 15:25:01,568 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 85 selfloop transitions, 12 changer transitions 0/133 dead transitions. [2025-03-04 15:25:01,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 133 transitions, 995 flow [2025-03-04 15:25:01,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:01,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 289 transitions. [2025-03-04 15:25:01,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6880952380952381 [2025-03-04 15:25:01,570 INFO L175 Difference]: Start difference. First operand has 100 places, 88 transitions, 447 flow. Second operand 5 states and 289 transitions. [2025-03-04 15:25:01,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 133 transitions, 995 flow [2025-03-04 15:25:01,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 133 transitions, 890 flow, removed 18 selfloop flow, removed 6 redundant places. [2025-03-04 15:25:01,579 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 452 flow [2025-03-04 15:25:01,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2025-03-04 15:25:01,580 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 20 predicate places. [2025-03-04 15:25:01,580 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 452 flow [2025-03-04 15:25:01,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 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-04 15:25:01,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:01,580 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:01,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:25:01,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:01,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:01,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1882676193, now seen corresponding path program 1 times [2025-03-04 15:25:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:01,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892655306] [2025-03-04 15:25:01,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:01,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:25:01,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:25:01,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:01,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:01,605 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-04 15:25:01,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:01,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892655306] [2025-03-04 15:25:01,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892655306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:01,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:01,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:01,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553877311] [2025-03-04 15:25:01,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:01,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:01,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:01,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:01,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:01,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 84 [2025-03-04 15:25:01,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 452 flow. Second operand has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-04 15:25:01,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:01,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 84 [2025-03-04 15:25:01,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:01,872 INFO L124 PetriNetUnfolderBase]: 1538/3421 cut-off events. [2025-03-04 15:25:01,873 INFO L125 PetriNetUnfolderBase]: For 9388/9671 co-relation queries the response was YES. [2025-03-04 15:25:01,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10423 conditions, 3421 events. 1538/3421 cut-off events. For 9388/9671 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 26969 event pairs, 498 based on Foata normal form. 296/3526 useless extension candidates. Maximal degree in co-relation 9397. Up to 1042 conditions per place. [2025-03-04 15:25:01,891 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 87 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2025-03-04 15:25:01,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 132 transitions, 924 flow [2025-03-04 15:25:01,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2025-03-04 15:25:01,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 15:25:01,893 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 452 flow. Second operand 4 states and 238 transitions. [2025-03-04 15:25:01,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 132 transitions, 924 flow [2025-03-04 15:25:01,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 132 transitions, 914 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:01,904 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 448 flow [2025-03-04 15:25:01,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=448, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2025-03-04 15:25:01,905 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2025-03-04 15:25:01,905 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 448 flow [2025-03-04 15:25:01,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.0) internal successors, (176), 4 states have internal predecessors, (176), 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-04 15:25:01,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:01,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:01,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:25:01,906 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1766549998, now seen corresponding path program 1 times [2025-03-04 15:25:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934918652] [2025-03-04 15:25:01,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:01,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:01,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:25:01,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:25:01,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:01,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:01,945 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-04 15:25:01,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934918652] [2025-03-04 15:25:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934918652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:01,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:01,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930030349] [2025-03-04 15:25:01,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:01,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:01,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:01,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:02,012 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-03-04 15:25:02,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 86 transitions, 448 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 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-04 15:25:02,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:02,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-03-04 15:25:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:02,394 INFO L124 PetriNetUnfolderBase]: 2060/3888 cut-off events. [2025-03-04 15:25:02,394 INFO L125 PetriNetUnfolderBase]: For 11946/12350 co-relation queries the response was YES. [2025-03-04 15:25:02,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12683 conditions, 3888 events. 2060/3888 cut-off events. For 11946/12350 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 27864 event pairs, 648 based on Foata normal form. 428/4132 useless extension candidates. Maximal degree in co-relation 11399. Up to 1355 conditions per place. [2025-03-04 15:25:02,413 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 152 selfloop transitions, 13 changer transitions 0/198 dead transitions. [2025-03-04 15:25:02,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 198 transitions, 1504 flow [2025-03-04 15:25:02,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:25:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:25:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 413 transitions. [2025-03-04 15:25:02,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-03-04 15:25:02,414 INFO L175 Difference]: Start difference. First operand has 100 places, 86 transitions, 448 flow. Second operand 8 states and 413 transitions. [2025-03-04 15:25:02,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 198 transitions, 1504 flow [2025-03-04 15:25:02,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 198 transitions, 1497 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:02,428 INFO L231 Difference]: Finished difference. Result has 109 places, 88 transitions, 498 flow [2025-03-04 15:25:02,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=498, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2025-03-04 15:25:02,428 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 30 predicate places. [2025-03-04 15:25:02,428 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 498 flow [2025-03-04 15:25:02,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 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-04 15:25:02,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:02,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:25:02,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:02,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:02,429 INFO L85 PathProgramCache]: Analyzing trace with hash -152835355, now seen corresponding path program 1 times [2025-03-04 15:25:02,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:02,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242292972] [2025-03-04 15:25:02,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:02,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:02,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:25:02,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:25:02,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:02,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:02,479 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-04 15:25:02,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:02,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242292972] [2025-03-04 15:25:02,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242292972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:02,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:02,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:25:02,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805888172] [2025-03-04 15:25:02,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:02,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:02,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:02,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:02,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:02,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-03-04 15:25:02,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 498 flow. Second operand has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-04 15:25:02,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:02,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-03-04 15:25:02,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:02,851 INFO L124 PetriNetUnfolderBase]: 1828/3443 cut-off events. [2025-03-04 15:25:02,851 INFO L125 PetriNetUnfolderBase]: For 12646/12991 co-relation queries the response was YES. [2025-03-04 15:25:02,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12283 conditions, 3443 events. 1828/3443 cut-off events. For 12646/12991 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 23914 event pairs, 598 based on Foata normal form. 346/3730 useless extension candidates. Maximal degree in co-relation 11161. Up to 1263 conditions per place. [2025-03-04 15:25:02,866 INFO L140 encePairwiseOnDemand]: 71/84 looper letters, 130 selfloop transitions, 16 changer transitions 0/178 dead transitions. [2025-03-04 15:25:02,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 178 transitions, 1370 flow [2025-03-04 15:25:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:02,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 330 transitions. [2025-03-04 15:25:02,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2025-03-04 15:25:02,868 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 498 flow. Second operand 6 states and 330 transitions. [2025-03-04 15:25:02,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 178 transitions, 1370 flow [2025-03-04 15:25:02,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 178 transitions, 1348 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:02,886 INFO L231 Difference]: Finished difference. Result has 110 places, 90 transitions, 533 flow [2025-03-04 15:25:02,886 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=533, PETRI_PLACES=110, PETRI_TRANSITIONS=90} [2025-03-04 15:25:02,886 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 31 predicate places. [2025-03-04 15:25:02,887 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 90 transitions, 533 flow [2025-03-04 15:25:02,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.0) internal successors, (200), 5 states have internal predecessors, (200), 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-04 15:25:02,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:02,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:02,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:25:02,887 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:02,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:02,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1367385653, now seen corresponding path program 1 times [2025-03-04 15:25:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:02,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41552648] [2025-03-04 15:25:02,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:02,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:02,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:25:02,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:25:02,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:02,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:02,916 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-04 15:25:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:02,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41552648] [2025-03-04 15:25:02,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41552648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:02,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:02,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105083637] [2025-03-04 15:25:02,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:02,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:02,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:02,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-03-04 15:25:02,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 90 transitions, 533 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-04 15:25:02,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:02,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-03-04 15:25:02,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:03,201 INFO L124 PetriNetUnfolderBase]: 1250/2778 cut-off events. [2025-03-04 15:25:03,202 INFO L125 PetriNetUnfolderBase]: For 12180/12430 co-relation queries the response was YES. [2025-03-04 15:25:03,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10374 conditions, 2778 events. 1250/2778 cut-off events. For 12180/12430 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 20853 event pairs, 389 based on Foata normal form. 204/2896 useless extension candidates. Maximal degree in co-relation 9426. Up to 1117 conditions per place. [2025-03-04 15:25:03,217 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 64 selfloop transitions, 7 changer transitions 0/113 dead transitions. [2025-03-04 15:25:03,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 113 transitions, 865 flow [2025-03-04 15:25:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2025-03-04 15:25:03,218 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7083333333333334 [2025-03-04 15:25:03,219 INFO L175 Difference]: Start difference. First operand has 110 places, 90 transitions, 533 flow. Second operand 4 states and 238 transitions. [2025-03-04 15:25:03,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 113 transitions, 865 flow [2025-03-04 15:25:03,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 113 transitions, 792 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 15:25:03,242 INFO L231 Difference]: Finished difference. Result has 107 places, 90 transitions, 526 flow [2025-03-04 15:25:03,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=526, PETRI_PLACES=107, PETRI_TRANSITIONS=90} [2025-03-04 15:25:03,242 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 28 predicate places. [2025-03-04 15:25:03,243 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 90 transitions, 526 flow [2025-03-04 15:25:03,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-04 15:25:03,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:03,243 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:03,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:25:03,243 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash 560687561, now seen corresponding path program 1 times [2025-03-04 15:25:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039542208] [2025-03-04 15:25:03,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:03,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:25:03,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:25:03,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:03,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:03,278 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-04 15:25:03,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:03,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039542208] [2025-03-04 15:25:03,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039542208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:03,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:03,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:03,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117937578] [2025-03-04 15:25:03,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:03,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:03,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:03,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:03,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:03,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-03-04 15:25:03,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 90 transitions, 526 flow. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-04 15:25:03,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:03,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-03-04 15:25:03,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:03,569 INFO L124 PetriNetUnfolderBase]: 1191/2719 cut-off events. [2025-03-04 15:25:03,570 INFO L125 PetriNetUnfolderBase]: For 10570/10784 co-relation queries the response was YES. [2025-03-04 15:25:03,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9807 conditions, 2719 events. 1191/2719 cut-off events. For 10570/10784 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 20659 event pairs, 491 based on Foata normal form. 216/2823 useless extension candidates. Maximal degree in co-relation 8878. Up to 1025 conditions per place. [2025-03-04 15:25:03,583 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 63 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-03-04 15:25:03,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 809 flow [2025-03-04 15:25:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2025-03-04 15:25:03,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6755952380952381 [2025-03-04 15:25:03,584 INFO L175 Difference]: Start difference. First operand has 107 places, 90 transitions, 526 flow. Second operand 4 states and 227 transitions. [2025-03-04 15:25:03,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 809 flow [2025-03-04 15:25:03,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 112 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:03,599 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 529 flow [2025-03-04 15:25:03,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=529, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2025-03-04 15:25:03,600 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 28 predicate places. [2025-03-04 15:25:03,601 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 529 flow [2025-03-04 15:25:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 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-04 15:25:03,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:03,601 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:03,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:25:03,601 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:03,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:03,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1057391811, now seen corresponding path program 1 times [2025-03-04 15:25:03,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:03,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668541743] [2025-03-04 15:25:03,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:03,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:03,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:03,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:03,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:03,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:03,639 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-04 15:25:03,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:03,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668541743] [2025-03-04 15:25:03,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668541743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:03,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:03,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:03,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276140338] [2025-03-04 15:25:03,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:03,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:03,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:03,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:03,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:03,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 84 [2025-03-04 15:25:03,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 529 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-04 15:25:03,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:03,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 84 [2025-03-04 15:25:03,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:03,863 INFO L124 PetriNetUnfolderBase]: 1313/2916 cut-off events. [2025-03-04 15:25:03,863 INFO L125 PetriNetUnfolderBase]: For 13125/13375 co-relation queries the response was YES. [2025-03-04 15:25:03,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10793 conditions, 2916 events. 1313/2916 cut-off events. For 13125/13375 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 22172 event pairs, 422 based on Foata normal form. 206/3019 useless extension candidates. Maximal degree in co-relation 9801. Up to 1152 conditions per place. [2025-03-04 15:25:03,872 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 65 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2025-03-04 15:25:03,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 867 flow [2025-03-04 15:25:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 237 transitions. [2025-03-04 15:25:03,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7053571428571429 [2025-03-04 15:25:03,873 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 529 flow. Second operand 4 states and 237 transitions. [2025-03-04 15:25:03,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 867 flow [2025-03-04 15:25:03,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 112 transitions, 841 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:03,886 INFO L231 Difference]: Finished difference. Result has 107 places, 89 transitions, 549 flow [2025-03-04 15:25:03,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=549, PETRI_PLACES=107, PETRI_TRANSITIONS=89} [2025-03-04 15:25:03,887 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 28 predicate places. [2025-03-04 15:25:03,887 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 89 transitions, 549 flow [2025-03-04 15:25:03,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-04 15:25:03,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:03,887 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:03,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:25:03,887 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:03,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 201444813, now seen corresponding path program 1 times [2025-03-04 15:25:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:03,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589383784] [2025-03-04 15:25:03,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:03,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:03,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:25:03,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:25:03,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:03,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:03,930 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-04 15:25:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589383784] [2025-03-04 15:25:03,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589383784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:03,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:03,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505500052] [2025-03-04 15:25:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:03,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:03,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:03,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:03,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-03-04 15:25:03,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 89 transitions, 549 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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-04 15:25:03,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:03,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-03-04 15:25:03,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:04,254 INFO L124 PetriNetUnfolderBase]: 1996/3674 cut-off events. [2025-03-04 15:25:04,254 INFO L125 PetriNetUnfolderBase]: For 16129/16472 co-relation queries the response was YES. [2025-03-04 15:25:04,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14154 conditions, 3674 events. 1996/3674 cut-off events. For 16129/16472 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25150 event pairs, 412 based on Foata normal form. 341/3955 useless extension candidates. Maximal degree in co-relation 13014. Up to 1700 conditions per place. [2025-03-04 15:25:04,270 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 93 selfloop transitions, 12 changer transitions 0/136 dead transitions. [2025-03-04 15:25:04,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 136 transitions, 1107 flow [2025-03-04 15:25:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 288 transitions. [2025-03-04 15:25:04,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2025-03-04 15:25:04,272 INFO L175 Difference]: Start difference. First operand has 107 places, 89 transitions, 549 flow. Second operand 5 states and 288 transitions. [2025-03-04 15:25:04,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 136 transitions, 1107 flow [2025-03-04 15:25:04,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 136 transitions, 1058 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:25:04,297 INFO L231 Difference]: Finished difference. Result has 105 places, 88 transitions, 532 flow [2025-03-04 15:25:04,297 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=105, PETRI_TRANSITIONS=88} [2025-03-04 15:25:04,298 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 26 predicate places. [2025-03-04 15:25:04,298 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 88 transitions, 532 flow [2025-03-04 15:25:04,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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-04 15:25:04,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:04,298 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:04,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:25:04,298 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:04,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1580622346, now seen corresponding path program 1 times [2025-03-04 15:25:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037020189] [2025-03-04 15:25:04,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:04,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:04,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:25:04,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:25:04,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:04,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:04,325 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-04 15:25:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:04,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037020189] [2025-03-04 15:25:04,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037020189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:04,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:04,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:04,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321319257] [2025-03-04 15:25:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:04,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:04,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:04,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:04,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:04,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 84 [2025-03-04 15:25:04,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 88 transitions, 532 flow. Second operand has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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-04 15:25:04,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:04,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 84 [2025-03-04 15:25:04,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:04,551 INFO L124 PetriNetUnfolderBase]: 1252/2798 cut-off events. [2025-03-04 15:25:04,551 INFO L125 PetriNetUnfolderBase]: For 12008/12222 co-relation queries the response was YES. [2025-03-04 15:25:04,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10264 conditions, 2798 events. 1252/2798 cut-off events. For 12008/12222 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 21125 event pairs, 528 based on Foata normal form. 235/2936 useless extension candidates. Maximal degree in co-relation 9418. Up to 1097 conditions per place. [2025-03-04 15:25:04,563 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 64 selfloop transitions, 7 changer transitions 0/110 dead transitions. [2025-03-04 15:25:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 836 flow [2025-03-04 15:25:04,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 226 transitions. [2025-03-04 15:25:04,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6726190476190477 [2025-03-04 15:25:04,565 INFO L175 Difference]: Start difference. First operand has 105 places, 88 transitions, 532 flow. Second operand 4 states and 226 transitions. [2025-03-04 15:25:04,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 836 flow [2025-03-04 15:25:04,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 817 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:04,580 INFO L231 Difference]: Finished difference. Result has 105 places, 87 transitions, 531 flow [2025-03-04 15:25:04,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=517, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=531, PETRI_PLACES=105, PETRI_TRANSITIONS=87} [2025-03-04 15:25:04,580 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 26 predicate places. [2025-03-04 15:25:04,580 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 87 transitions, 531 flow [2025-03-04 15:25:04,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 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-04 15:25:04,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:04,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:04,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:25:04,581 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:04,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1949822508, now seen corresponding path program 1 times [2025-03-04 15:25:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:04,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497624072] [2025-03-04 15:25:04,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:04,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:04,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:25:04,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:25:04,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:04,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:04,630 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-04 15:25:04,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:04,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497624072] [2025-03-04 15:25:04,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497624072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:04,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:04,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:04,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136026659] [2025-03-04 15:25:04,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:04,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:04,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:04,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:04,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:04,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-03-04 15:25:04,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 87 transitions, 531 flow. Second operand has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 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-04 15:25:04,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:04,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-03-04 15:25:04,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:04,999 INFO L124 PetriNetUnfolderBase]: 1624/3176 cut-off events. [2025-03-04 15:25:04,999 INFO L125 PetriNetUnfolderBase]: For 14850/15120 co-relation queries the response was YES. [2025-03-04 15:25:05,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12162 conditions, 3176 events. 1624/3176 cut-off events. For 14850/15120 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22198 event pairs, 520 based on Foata normal form. 292/3385 useless extension candidates. Maximal degree in co-relation 11386. Up to 1079 conditions per place. [2025-03-04 15:25:05,015 INFO L140 encePairwiseOnDemand]: 75/84 looper letters, 142 selfloop transitions, 14 changer transitions 18/206 dead transitions. [2025-03-04 15:25:05,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 206 transitions, 1805 flow [2025-03-04 15:25:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:25:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:25:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 410 transitions. [2025-03-04 15:25:05,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6101190476190477 [2025-03-04 15:25:05,017 INFO L175 Difference]: Start difference. First operand has 105 places, 87 transitions, 531 flow. Second operand 8 states and 410 transitions. [2025-03-04 15:25:05,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 206 transitions, 1805 flow [2025-03-04 15:25:05,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 206 transitions, 1729 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:05,034 INFO L231 Difference]: Finished difference. Result has 107 places, 83 transitions, 503 flow [2025-03-04 15:25:05,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=503, PETRI_PLACES=107, PETRI_TRANSITIONS=83} [2025-03-04 15:25:05,034 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 28 predicate places. [2025-03-04 15:25:05,034 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 83 transitions, 503 flow [2025-03-04 15:25:05,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.833333333333336) internal successors, (239), 6 states have internal predecessors, (239), 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-04 15:25:05,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:05,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:25:05,035 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:05,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1754652827, now seen corresponding path program 1 times [2025-03-04 15:25:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:05,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407409351] [2025-03-04 15:25:05,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:05,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:05,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:25:05,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:25:05,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:05,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:05,073 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-04 15:25:05,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407409351] [2025-03-04 15:25:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407409351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:05,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:05,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:05,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174266222] [2025-03-04 15:25:05,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:05,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:05,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:05,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:05,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 84 [2025-03-04 15:25:05,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 83 transitions, 503 flow. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-04 15:25:05,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:05,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 84 [2025-03-04 15:25:05,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:05,375 INFO L124 PetriNetUnfolderBase]: 1849/3394 cut-off events. [2025-03-04 15:25:05,375 INFO L125 PetriNetUnfolderBase]: For 14917/15196 co-relation queries the response was YES. [2025-03-04 15:25:05,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12800 conditions, 3394 events. 1849/3394 cut-off events. For 14917/15196 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 22946 event pairs, 369 based on Foata normal form. 315/3684 useless extension candidates. Maximal degree in co-relation 11343. Up to 1666 conditions per place. [2025-03-04 15:25:05,389 INFO L140 encePairwiseOnDemand]: 76/84 looper letters, 89 selfloop transitions, 9 changer transitions 2/128 dead transitions. [2025-03-04 15:25:05,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 1043 flow [2025-03-04 15:25:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 285 transitions. [2025-03-04 15:25:05,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2025-03-04 15:25:05,391 INFO L175 Difference]: Start difference. First operand has 107 places, 83 transitions, 503 flow. Second operand 5 states and 285 transitions. [2025-03-04 15:25:05,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 128 transitions, 1043 flow [2025-03-04 15:25:05,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 128 transitions, 918 flow, removed 3 selfloop flow, removed 12 redundant places. [2025-03-04 15:25:05,406 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 440 flow [2025-03-04 15:25:05,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=440, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2025-03-04 15:25:05,406 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2025-03-04 15:25:05,406 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 440 flow [2025-03-04 15:25:05,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 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-04 15:25:05,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:05,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:25:05,407 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 15:25:05,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1440337849, now seen corresponding path program 1 times [2025-03-04 15:25:05,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:05,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291315415] [2025-03-04 15:25:05,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:05,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:05,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:25:05,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:25:05,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:05,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:05,454 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-04 15:25:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:05,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291315415] [2025-03-04 15:25:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291315415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:05,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:05,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:05,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010620472] [2025-03-04 15:25:05,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:05,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:05,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:05,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:05,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:05,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 84 [2025-03-04 15:25:05,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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-04 15:25:05,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:05,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 84 [2025-03-04 15:25:05,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:05,810 INFO L124 PetriNetUnfolderBase]: 1361/2673 cut-off events. [2025-03-04 15:25:05,810 INFO L125 PetriNetUnfolderBase]: For 8280/8483 co-relation queries the response was YES. [2025-03-04 15:25:05,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9389 conditions, 2673 events. 1361/2673 cut-off events. For 8280/8483 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 18497 event pairs, 475 based on Foata normal form. 255/2877 useless extension candidates. Maximal degree in co-relation 9371. Up to 925 conditions per place. [2025-03-04 15:25:05,819 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 0 selfloop transitions, 0 changer transitions 194/194 dead transitions. [2025-03-04 15:25:05,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 194 transitions, 1499 flow [2025-03-04 15:25:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:25:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:25:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 402 transitions. [2025-03-04 15:25:05,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5982142857142857 [2025-03-04 15:25:05,822 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 440 flow. Second operand 8 states and 402 transitions. [2025-03-04 15:25:05,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 194 transitions, 1499 flow [2025-03-04 15:25:05,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 194 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:05,834 INFO L231 Difference]: Finished difference. Result has 101 places, 0 transitions, 0 flow [2025-03-04 15:25:05,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=101, PETRI_TRANSITIONS=0} [2025-03-04 15:25:05,835 INFO L279 CegarLoopForPetriNet]: 79 programPoint places, 22 predicate places. [2025-03-04 15:25:05,835 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 0 transitions, 0 flow [2025-03-04 15:25:05,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 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-04 15:25:05,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-03-04 15:25:05,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-03-04 15:25:05,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-03-04 15:25:05,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-03-04 15:25:05,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-03-04 15:25:05,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-03-04 15:25:05,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-03-04 15:25:05,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-03-04 15:25:05,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:25:05,843 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:05,848 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:25:05,848 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:25:05,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:25:05 BasicIcfg [2025-03-04 15:25:05,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:25:05,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:25:05,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:25:05,854 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:25:05,855 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:56" (3/4) ... [2025-03-04 15:25:05,856 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:25:05,858 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:25:05,858 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:25:05,861 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 57 nodes and edges [2025-03-04 15:25:05,861 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-04 15:25:05,861 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 15:25:05,862 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:25:05,921 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:25:05,921 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:25:05,921 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:25:05,922 INFO L158 Benchmark]: Toolchain (without parser) took 10702.16ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 111.1MB in the beginning and 208.6MB in the end (delta: -97.5MB). Peak memory consumption was 309.8MB. Max. memory is 16.1GB. [2025-03-04 15:25:05,922 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:05,922 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.30ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 100.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:25:05,922 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.96ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:25:05,922 INFO L158 Benchmark]: Boogie Preprocessor took 43.62ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:05,923 INFO L158 Benchmark]: IcfgBuilder took 731.94ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 44.1MB in the end (delta: 52.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 15:25:05,923 INFO L158 Benchmark]: TraceAbstraction took 9633.84ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 43.2MB in the beginning and 217.0MB in the end (delta: -173.8MB). Peak memory consumption was 242.7MB. Max. memory is 16.1GB. [2025-03-04 15:25:05,923 INFO L158 Benchmark]: Witness Printer took 67.51ms. Allocated memory is still 553.6MB. Free memory was 217.0MB in the beginning and 208.6MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:05,924 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.22ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.30ms. Allocated memory is still 142.6MB. Free memory was 111.1MB in the beginning and 100.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.96ms. Allocated memory is still 142.6MB. Free memory was 100.0MB in the beginning and 98.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.62ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 96.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 731.94ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 44.1MB in the end (delta: 52.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9633.84ms. Allocated memory was 142.6MB in the beginning and 553.6MB in the end (delta: 411.0MB). Free memory was 43.2MB in the beginning and 217.0MB in the end (delta: -173.8MB). Peak memory consumption was 242.7MB. Max. memory is 16.1GB. * Witness Printer took 67.51ms. Allocated memory is still 553.6MB. Free memory was 217.0MB in the beginning and 208.6MB in the end (delta: 8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 83]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 84]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 147 locations, 50 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: 9.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2666 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1998 mSDsluCounter, 556 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 282 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4195 IncrementalHoareTripleChecker+Invalid, 4477 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 282 mSolverCounterUnsat, 261 mSDtfsCounter, 4195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 104 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549occurred in iteration=17, InterpolantAutomatonStates: 112, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:25:05,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE