./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-collitem-trans.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-collitem-trans.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 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:24:10,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:24:10,295 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:10,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:24:10,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:24:10,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:24:10,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:24:10,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:24:10,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:24:10,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:24:10,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:24:10,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:24:10,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:24:10,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:24:10,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:24:10,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:24:10,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:10,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:24:10,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:24:10,326 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 -> 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab [2025-03-04 15:24:10,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:24:10,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:24:10,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:24:10,544 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:24:10,544 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:24:10,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-03-04 15:24:11,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5032827b/926911a190394dceabd2bc1ad70113c1/FLAG5c904d386 [2025-03-04 15:24:11,907 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:24:11,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-03-04 15:24:11,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5032827b/926911a190394dceabd2bc1ad70113c1/FLAG5c904d386 [2025-03-04 15:24:12,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5032827b/926911a190394dceabd2bc1ad70113c1 [2025-03-04 15:24:12,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:24:12,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:24:12,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:12,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:24:12,229 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:24:12,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:12" (1/1) ... [2025-03-04 15:24:12,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fce6171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:12, skipping insertion in model container [2025-03-04 15:24:12,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:12" (1/1) ... [2025-03-04 15:24:12,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:24:12,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:12,361 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:24:12,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:12,399 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:24:12,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:12 WrapperNode [2025-03-04 15:24:12,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:12,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:12,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:24:12,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:24:12,406 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:12" (1/1) ... [2025-03-04 15:24:12,414 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:12" (1/1) ... [2025-03-04 15:24:12,453 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 515 [2025-03-04 15:24:12,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:12,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:24:12,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:24:12,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:24:12,462 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:12" (1/1) ... [2025-03-04 15:24:12,462 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:12" (1/1) ... [2025-03-04 15:24:12,469 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:12" (1/1) ... [2025-03-04 15:24:12,493 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:12,497 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:12" (1/1) ... [2025-03-04 15:24:12,498 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:12" (1/1) ... [2025-03-04 15:24:12,507 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:12" (1/1) ... [2025-03-04 15:24:12,512 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:12" (1/1) ... [2025-03-04 15:24:12,513 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:12" (1/1) ... [2025-03-04 15:24:12,519 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:12" (1/1) ... [2025-03-04 15:24:12,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:24:12,526 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:24:12,526 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:24:12,526 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:24:12,527 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:12" (1/1) ... [2025-03-04 15:24:12,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:12,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:12,561 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:12,564 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:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:24:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:24:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:24:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:24:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:24:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:24:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:24:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:24:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:24:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:24:12,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:24:12,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:24:12,584 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:12,663 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:24:12,664 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:24:13,267 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:24:13,268 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:24:14,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:24:14,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:24:14,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:14 BoogieIcfgContainer [2025-03-04 15:24:14,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:24:14,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:24:14,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:24:14,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:24:14,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:24:12" (1/3) ... [2025-03-04 15:24:14,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784ea589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:14, skipping insertion in model container [2025-03-04 15:24:14,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:12" (2/3) ... [2025-03-04 15:24:14,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784ea589 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:14, skipping insertion in model container [2025-03-04 15:24:14,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:14" (3/3) ... [2025-03-04 15:24:14,429 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2025-03-04 15:24:14,441 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:24:14,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-trans.wvr.c that has 4 procedures, 96 locations, 1 initial locations, 0 loop locations, and 72 error locations. [2025-03-04 15:24:14,442 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:24:15,209 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:24:15,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 95 transitions, 211 flow [2025-03-04 15:24:15,362 INFO L124 PetriNetUnfolderBase]: 0/92 cut-off events. [2025-03-04 15:24:15,365 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:24:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 0/92 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 488 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 15:24:15,367 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 95 transitions, 211 flow [2025-03-04 15:24:15,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 195 flow [2025-03-04 15:24:15,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:24:15,390 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;@694cf75d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:24:15,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-03-04 15:24:15,393 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:24:15,394 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 15:24:15,394 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:24:15,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:15,395 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:15,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:15,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 56757978, now seen corresponding path program 1 times [2025-03-04 15:24:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:15,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987124149] [2025-03-04 15:24:15,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:15,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:15,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:15,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:15,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:15,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:15,570 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:15,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:15,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987124149] [2025-03-04 15:24:15,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987124149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:15,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:15,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749073771] [2025-03-04 15:24:15,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:15,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 15:24:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:15,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:24:15,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:24:15,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:15,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:15,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:15,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:15,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:29,661 INFO L124 PetriNetUnfolderBase]: 34236/49456 cut-off events. [2025-03-04 15:24:29,661 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-03-04 15:24:29,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99698 conditions, 49456 events. 34236/49456 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 11172. Compared 430907 event pairs, 34236 based on Foata normal form. 0/12567 useless extension candidates. Maximal degree in co-relation 97143. Up to 49096 conditions per place. [2025-03-04 15:24:29,889 INFO L140 encePairwiseOnDemand]: 71/95 looper letters, 63 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2025-03-04 15:24:29,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 273 flow [2025-03-04 15:24:29,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:24:29,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 15:24:29,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2025-03-04 15:24:29,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2025-03-04 15:24:29,902 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 195 flow. Second operand 2 states and 99 transitions. [2025-03-04 15:24:29,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 273 flow [2025-03-04 15:24:30,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:30,183 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 138 flow [2025-03-04 15:24:30,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2025-03-04 15:24:30,187 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-03-04 15:24:30,187 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 138 flow [2025-03-04 15:24:30,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:30,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:30,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:30,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:24:30,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 56757979, now seen corresponding path program 1 times [2025-03-04 15:24:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609439151] [2025-03-04 15:24:30,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:30,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:30,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:30,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:30,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:30,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:30,283 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:30,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:30,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609439151] [2025-03-04 15:24:30,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609439151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:30,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:30,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:30,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770658101] [2025-03-04 15:24:30,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:30,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:30,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:30,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:30,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:30,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:30,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:30,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:41,813 INFO L124 PetriNetUnfolderBase]: 30688/44370 cut-off events. [2025-03-04 15:24:41,814 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 15:24:41,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89086 conditions, 44370 events. 30688/44370 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9960. Compared 382153 event pairs, 30688 based on Foata normal form. 0/11459 useless extension candidates. Maximal degree in co-relation 89083. Up to 44046 conditions per place. [2025-03-04 15:24:42,008 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-03-04 15:24:42,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 256 flow [2025-03-04 15:24:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:42,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-04 15:24:42,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28421052631578947 [2025-03-04 15:24:42,011 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 138 flow. Second operand 3 states and 81 transitions. [2025-03-04 15:24:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 256 flow [2025-03-04 15:24:42,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:42,013 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 136 flow [2025-03-04 15:24:42,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-03-04 15:24:42,013 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-03-04 15:24:42,013 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 136 flow [2025-03-04 15:24:42,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:42,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:42,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:42,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:24:42,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:42,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 56757980, now seen corresponding path program 1 times [2025-03-04 15:24:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:42,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167359968] [2025-03-04 15:24:42,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:42,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:42,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:42,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:42,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:42,108 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:42,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167359968] [2025-03-04 15:24:42,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167359968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:42,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:42,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:42,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506696240] [2025-03-04 15:24:42,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:42,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:42,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:42,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:42,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:42,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:42,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:42,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:42,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:51,626 INFO L124 PetriNetUnfolderBase]: 27334/39560 cut-off events. [2025-03-04 15:24:51,626 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 15:24:51,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79432 conditions, 39560 events. 27334/39560 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 8818. Compared 336855 event pairs, 27334 based on Foata normal form. 0/10401 useless extension candidates. Maximal degree in co-relation 79428. Up to 39271 conditions per place. [2025-03-04 15:24:51,778 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 58 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-03-04 15:24:51,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 250 flow [2025-03-04 15:24:51,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-04 15:24:51,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2771929824561403 [2025-03-04 15:24:51,779 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 136 flow. Second operand 3 states and 79 transitions. [2025-03-04 15:24:51,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 250 flow [2025-03-04 15:24:51,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:51,780 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 133 flow [2025-03-04 15:24:51,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2025-03-04 15:24:51,781 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -29 predicate places. [2025-03-04 15:24:51,781 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 133 flow [2025-03-04 15:24:51,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:51,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:51,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:51,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:24:51,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:51,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash 56757982, now seen corresponding path program 1 times [2025-03-04 15:24:51,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:51,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929127646] [2025-03-04 15:24:51,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:51,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:51,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:51,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:51,894 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:51,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:51,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929127646] [2025-03-04 15:24:51,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929127646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:51,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:51,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:51,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3299625] [2025-03-04 15:24:51,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:51,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:51,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:51,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:51,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:51,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:51,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:51,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:51,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:51,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:00,524 INFO L124 PetriNetUnfolderBase]: 24395/35360 cut-off events. [2025-03-04 15:25:00,524 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 15:25:00,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71015 conditions, 35360 events. 24395/35360 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 7805. Compared 297712 event pairs, 24395 based on Foata normal form. 0/9470 useless extension candidates. Maximal degree in co-relation 71011. Up to 35088 conditions per place. [2025-03-04 15:25:00,649 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 56 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-03-04 15:25:00,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 243 flow [2025-03-04 15:25:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:00,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 15:25:00,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27017543859649124 [2025-03-04 15:25:00,653 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 3 states and 77 transitions. [2025-03-04 15:25:00,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 243 flow [2025-03-04 15:25:00,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:00,656 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 130 flow [2025-03-04 15:25:00,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-03-04 15:25:00,657 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -30 predicate places. [2025-03-04 15:25:00,657 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 130 flow [2025-03-04 15:25:00,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,658 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:00,658 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:00,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:25:00,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:00,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash 56757983, now seen corresponding path program 1 times [2025-03-04 15:25:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256372043] [2025-03-04 15:25:00,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:00,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:00,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:00,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:00,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:00,750 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,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:00,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256372043] [2025-03-04 15:25:00,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256372043] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:00,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:00,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041867425] [2025-03-04 15:25:00,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:00,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:00,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:00,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:00,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:00,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:00,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:00,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:00,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:08,484 INFO L124 PetriNetUnfolderBase]: 21622/31394 cut-off events. [2025-03-04 15:25:08,484 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 15:25:08,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63066 conditions, 31394 events. 21622/31394 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6854. Compared 261521 event pairs, 21622 based on Foata normal form. 0/8581 useless extension candidates. Maximal degree in co-relation 63062. Up to 31139 conditions per place. [2025-03-04 15:25:08,578 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 54 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-03-04 15:25:08,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 236 flow [2025-03-04 15:25:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-04 15:25:08,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2025-03-04 15:25:08,580 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 130 flow. Second operand 3 states and 75 transitions. [2025-03-04 15:25:08,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 236 flow [2025-03-04 15:25:08,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 58 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:08,580 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 127 flow [2025-03-04 15:25:08,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-03-04 15:25:08,581 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -31 predicate places. [2025-03-04 15:25:08,581 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 127 flow [2025-03-04 15:25:08,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:08,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:08,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:25:08,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:08,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash 56757985, now seen corresponding path program 1 times [2025-03-04 15:25:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:08,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264001629] [2025-03-04 15:25:08,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:08,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:08,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:08,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:08,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:08,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:08,637 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:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:08,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264001629] [2025-03-04 15:25:08,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264001629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:08,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:08,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290960454] [2025-03-04 15:25:08,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:08,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:08,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:08,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:08,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:08,639 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:08,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:08,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:08,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:08,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:15,605 INFO L124 PetriNetUnfolderBase]: 18962/27568 cut-off events. [2025-03-04 15:25:15,606 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 15:25:15,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55383 conditions, 27568 events. 18962/27568 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 5966. Compared 227666 event pairs, 18962 based on Foata normal form. 0/7703 useless extension candidates. Maximal degree in co-relation 55379. Up to 27344 conditions per place. [2025-03-04 15:25:15,715 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 52 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2025-03-04 15:25:15,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 229 flow [2025-03-04 15:25:15,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:15,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 15:25:15,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.256140350877193 [2025-03-04 15:25:15,717 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 127 flow. Second operand 3 states and 73 transitions. [2025-03-04 15:25:15,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 229 flow [2025-03-04 15:25:15,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:15,718 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 124 flow [2025-03-04 15:25:15,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-03-04 15:25:15,718 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -32 predicate places. [2025-03-04 15:25:15,718 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 124 flow [2025-03-04 15:25:15,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:15,719 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:15,719 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:15,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:15,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash 56757986, now seen corresponding path program 1 times [2025-03-04 15:25:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959392792] [2025-03-04 15:25:15,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:15,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:15,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:15,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:15,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:15,763 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:15,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:15,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959392792] [2025-03-04 15:25:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959392792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:15,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437147865] [2025-03-04 15:25:15,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:15,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:15,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:15,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:15,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:15,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:15,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:15,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:15,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:22,120 INFO L124 PetriNetUnfolderBase]: 16476/23990 cut-off events. [2025-03-04 15:25:22,121 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 15:25:22,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48198 conditions, 23990 events. 16476/23990 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 5140. Compared 195455 event pairs, 16476 based on Foata normal form. 0/6871 useless extension candidates. Maximal degree in co-relation 48194. Up to 23795 conditions per place. [2025-03-04 15:25:22,211 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 50 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-03-04 15:25:22,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 222 flow [2025-03-04 15:25:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:22,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 15:25:22,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24912280701754386 [2025-03-04 15:25:22,212 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 124 flow. Second operand 3 states and 71 transitions. [2025-03-04 15:25:22,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 222 flow [2025-03-04 15:25:22,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 54 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:22,213 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 121 flow [2025-03-04 15:25:22,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-03-04 15:25:22,214 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -33 predicate places. [2025-03-04 15:25:22,214 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 121 flow [2025-03-04 15:25:22,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:22,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:22,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:22,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:25:22,214 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:22,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:22,215 INFO L85 PathProgramCache]: Analyzing trace with hash 56757988, now seen corresponding path program 1 times [2025-03-04 15:25:22,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:22,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456051919] [2025-03-04 15:25:22,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:22,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:22,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:22,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:22,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:22,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:22,274 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:22,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:22,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456051919] [2025-03-04 15:25:22,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456051919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:22,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:22,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:22,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642496875] [2025-03-04 15:25:22,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:22,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:22,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:22,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:22,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:22,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:22,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:22,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:22,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:22,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:27,936 INFO L124 PetriNetUnfolderBase]: 14329/20910 cut-off events. [2025-03-04 15:25:27,936 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 15:25:27,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42023 conditions, 20910 events. 14329/20910 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4419. Compared 167953 event pairs, 14329 based on Foata normal form. 0/6146 useless extension candidates. Maximal degree in co-relation 42019. Up to 20730 conditions per place. [2025-03-04 15:25:28,014 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 48 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-04 15:25:28,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 215 flow [2025-03-04 15:25:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:28,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-04 15:25:28,015 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24210526315789474 [2025-03-04 15:25:28,015 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 121 flow. Second operand 3 states and 69 transitions. [2025-03-04 15:25:28,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 215 flow [2025-03-04 15:25:28,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:28,016 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 118 flow [2025-03-04 15:25:28,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-03-04 15:25:28,017 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2025-03-04 15:25:28,017 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 118 flow [2025-03-04 15:25:28,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:28,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:28,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:28,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:28,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash 56757989, now seen corresponding path program 1 times [2025-03-04 15:25:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039257725] [2025-03-04 15:25:28,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:28,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:28,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:28,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:28,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:28,078 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:28,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:28,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039257725] [2025-03-04 15:25:28,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039257725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:28,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:28,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:28,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559991203] [2025-03-04 15:25:28,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:28,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:28,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:28,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:28,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:28,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:28,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:28,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:28,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:28,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:33,159 INFO L124 PetriNetUnfolderBase]: 12328/18036 cut-off events. [2025-03-04 15:25:33,159 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 15:25:33,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36260 conditions, 18036 events. 12328/18036 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 3752. Compared 142693 event pairs, 12328 based on Foata normal form. 0/5459 useless extension candidates. Maximal degree in co-relation 36256. Up to 17871 conditions per place. [2025-03-04 15:25:33,220 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 46 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-03-04 15:25:33,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 50 transitions, 208 flow [2025-03-04 15:25:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-04 15:25:33,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23508771929824562 [2025-03-04 15:25:33,221 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 118 flow. Second operand 3 states and 67 transitions. [2025-03-04 15:25:33,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 50 transitions, 208 flow [2025-03-04 15:25:33,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 50 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:33,222 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 115 flow [2025-03-04 15:25:33,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-03-04 15:25:33,223 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2025-03-04 15:25:33,223 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 115 flow [2025-03-04 15:25:33,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:33,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:33,224 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:33,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:25:33,224 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:33,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash 56757991, now seen corresponding path program 1 times [2025-03-04 15:25:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:33,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-03-04 15:25:33,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:33,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:33,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:33,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:33,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:33,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:33,262 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:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:33,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83329312] [2025-03-04 15:25:33,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83329312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:33,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:33,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896472388] [2025-03-04 15:25:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:33,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:33,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:33,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:33,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:33,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:33,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:33,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:33,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:37,610 INFO L124 PetriNetUnfolderBase]: 10436/15302 cut-off events. [2025-03-04 15:25:37,611 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 15:25:37,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30767 conditions, 15302 events. 10436/15302 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 3140. Compared 119419 event pairs, 10436 based on Foata normal form. 0/4787 useless extension candidates. Maximal degree in co-relation 30763. Up to 15162 conditions per place. [2025-03-04 15:25:37,671 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 44 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-03-04 15:25:37,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 48 transitions, 201 flow [2025-03-04 15:25:37,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-04 15:25:37,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2025-03-04 15:25:37,672 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 115 flow. Second operand 3 states and 65 transitions. [2025-03-04 15:25:37,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 48 transitions, 201 flow [2025-03-04 15:25:37,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:37,673 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 112 flow [2025-03-04 15:25:37,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-03-04 15:25:37,674 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2025-03-04 15:25:37,674 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 112 flow [2025-03-04 15:25:37,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:37,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:37,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:37,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:25:37,674 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:37,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 56757992, now seen corresponding path program 1 times [2025-03-04 15:25:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274491777] [2025-03-04 15:25:37,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:37,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:37,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:37,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,742 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:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274491777] [2025-03-04 15:25:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274491777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:37,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:37,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58168114] [2025-03-04 15:25:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:37,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:37,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:37,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:37,744 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:37,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:37,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:37,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:37,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:41,407 INFO L124 PetriNetUnfolderBase]: 8698/12788 cut-off events. [2025-03-04 15:25:41,407 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 15:25:41,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25716 conditions, 12788 events. 8698/12788 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 2582. Compared 97905 event pairs, 8698 based on Foata normal form. 0/4157 useless extension candidates. Maximal degree in co-relation 25712. Up to 12671 conditions per place. [2025-03-04 15:25:41,447 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 42 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2025-03-04 15:25:41,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 194 flow [2025-03-04 15:25:41,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-04 15:25:41,448 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22105263157894736 [2025-03-04 15:25:41,449 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 112 flow. Second operand 3 states and 63 transitions. [2025-03-04 15:25:41,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 194 flow [2025-03-04 15:25:41,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:41,449 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 109 flow [2025-03-04 15:25:41,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-03-04 15:25:41,450 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2025-03-04 15:25:41,450 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 109 flow [2025-03-04 15:25:41,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:41,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:41,450 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:41,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:25:41,451 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:41,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:41,451 INFO L85 PathProgramCache]: Analyzing trace with hash 56757994, now seen corresponding path program 1 times [2025-03-04 15:25:41,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:41,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671005683] [2025-03-04 15:25:41,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:41,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:41,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:41,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:41,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:41,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:41,520 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:41,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:41,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671005683] [2025-03-04 15:25:41,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671005683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:41,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:41,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:41,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94299245] [2025-03-04 15:25:41,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:41,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:41,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:41,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:41,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:41,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:41,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:41,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:41,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:44,533 INFO L124 PetriNetUnfolderBase]: 7223/10660 cut-off events. [2025-03-04 15:25:44,534 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 15:25:44,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21447 conditions, 10660 events. 7223/10660 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 2105. Compared 80070 event pairs, 7223 based on Foata normal form. 0/3614 useless extension candidates. Maximal degree in co-relation 21443. Up to 10556 conditions per place. [2025-03-04 15:25:44,564 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 40 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-03-04 15:25:44,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 44 transitions, 187 flow [2025-03-04 15:25:44,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-04 15:25:44,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21403508771929824 [2025-03-04 15:25:44,565 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 109 flow. Second operand 3 states and 61 transitions. [2025-03-04 15:25:44,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 44 transitions, 187 flow [2025-03-04 15:25:44,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 44 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:44,566 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 106 flow [2025-03-04 15:25:44,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-03-04 15:25:44,566 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2025-03-04 15:25:44,566 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 106 flow [2025-03-04 15:25:44,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:44,566 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:44,566 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:44,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:25:44,567 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:44,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:44,567 INFO L85 PathProgramCache]: Analyzing trace with hash 56757995, now seen corresponding path program 1 times [2025-03-04 15:25:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382054117] [2025-03-04 15:25:44,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:44,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:44,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:44,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:44,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:44,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:44,616 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:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382054117] [2025-03-04 15:25:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382054117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195657004] [2025-03-04 15:25:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:44,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:44,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:44,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:44,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:44,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:44,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:44,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:47,180 INFO L124 PetriNetUnfolderBase]: 5874/8710 cut-off events. [2025-03-04 15:25:47,180 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 15:25:47,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17534 conditions, 8710 events. 5874/8710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 64414 event pairs, 5874 based on Foata normal form. 0/3105 useless extension candidates. Maximal degree in co-relation 17530. Up to 8619 conditions per place. [2025-03-04 15:25:47,202 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 38 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-03-04 15:25:47,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 42 transitions, 180 flow [2025-03-04 15:25:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:47,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-04 15:25:47,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20701754385964913 [2025-03-04 15:25:47,203 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 106 flow. Second operand 3 states and 59 transitions. [2025-03-04 15:25:47,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 42 transitions, 180 flow [2025-03-04 15:25:47,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:47,204 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 103 flow [2025-03-04 15:25:47,204 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-03-04 15:25:47,204 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -39 predicate places. [2025-03-04 15:25:47,204 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 103 flow [2025-03-04 15:25:47,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:47,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:47,204 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:47,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:25:47,205 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:47,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 56757997, now seen corresponding path program 1 times [2025-03-04 15:25:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897501750] [2025-03-04 15:25:47,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:47,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:47,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:47,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:47,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:47,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:47,236 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:47,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:47,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897501750] [2025-03-04 15:25:47,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897501750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:47,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:47,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:47,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727617683] [2025-03-04 15:25:47,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:47,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:47,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:47,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:47,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:47,237 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:47,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:47,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:47,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:47,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:49,150 INFO L124 PetriNetUnfolderBase]: 4630/6900 cut-off events. [2025-03-04 15:25:49,150 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 15:25:49,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13895 conditions, 6900 events. 4630/6900 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1290. Compared 49978 event pairs, 4630 based on Foata normal form. 0/2615 useless extension candidates. Maximal degree in co-relation 13891. Up to 6828 conditions per place. [2025-03-04 15:25:49,166 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 36 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-03-04 15:25:49,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 40 transitions, 173 flow [2025-03-04 15:25:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:49,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-04 15:25:49,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2 [2025-03-04 15:25:49,167 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 103 flow. Second operand 3 states and 57 transitions. [2025-03-04 15:25:49,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 40 transitions, 173 flow [2025-03-04 15:25:49,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:49,168 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 100 flow [2025-03-04 15:25:49,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-03-04 15:25:49,168 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2025-03-04 15:25:49,169 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 100 flow [2025-03-04 15:25:49,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:49,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:49,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:49,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:25:49,169 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:49,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:49,169 INFO L85 PathProgramCache]: Analyzing trace with hash 56757998, now seen corresponding path program 1 times [2025-03-04 15:25:49,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:49,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534795465] [2025-03-04 15:25:49,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:49,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:49,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:49,202 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:49,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:49,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534795465] [2025-03-04 15:25:49,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534795465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:49,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:49,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:49,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341635084] [2025-03-04 15:25:49,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:49,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:49,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:49,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:49,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:49,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:49,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:49,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:49,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:49,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:50,646 INFO L124 PetriNetUnfolderBase]: 3520/5282 cut-off events. [2025-03-04 15:25:50,646 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 15:25:50,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10642 conditions, 5282 events. 3520/5282 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 952. Compared 37124 event pairs, 3520 based on Foata normal form. 0/2163 useless extension candidates. Maximal degree in co-relation 10638. Up to 5227 conditions per place. [2025-03-04 15:25:50,662 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 34 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-03-04 15:25:50,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 38 transitions, 166 flow [2025-03-04 15:25:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:50,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 15:25:50,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19298245614035087 [2025-03-04 15:25:50,663 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 100 flow. Second operand 3 states and 55 transitions. [2025-03-04 15:25:50,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 38 transitions, 166 flow [2025-03-04 15:25:50,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 38 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:50,664 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 97 flow [2025-03-04 15:25:50,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-03-04 15:25:50,664 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2025-03-04 15:25:50,664 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 97 flow [2025-03-04 15:25:50,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:50,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:50,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:50,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:25:50,665 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:50,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash 56758000, now seen corresponding path program 1 times [2025-03-04 15:25:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:50,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629477503] [2025-03-04 15:25:50,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:50,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:50,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:50,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:50,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:50,731 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:50,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629477503] [2025-03-04 15:25:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629477503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:50,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:50,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:50,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382793244] [2025-03-04 15:25:50,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:50,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:50,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:50,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:50,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:50,735 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:50,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:50,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:50,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:50,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand