./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-exp-term-subst.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-exp-term-subst.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 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:24:21,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:24:21,475 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:21,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:24:21,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:24:21,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:24:21,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:24:21,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:24:21,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:24:21,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:24:21,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:24:21,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:24:21,500 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:24:21,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:24:21,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:21,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:24:21,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:24:21,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:24:21,504 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 -> 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 [2025-03-04 15:24:21,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:24:21,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:24:21,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:24:21,741 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:24:21,742 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:24:21,743 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2025-03-04 15:24:22,879 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d6caf99/9cd4d153d0fe4b96a0a7bd98925cebf4/FLAG5814fdc2d [2025-03-04 15:24:23,100 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:24:23,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2025-03-04 15:24:23,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d6caf99/9cd4d153d0fe4b96a0a7bd98925cebf4/FLAG5814fdc2d [2025-03-04 15:24:23,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d6caf99/9cd4d153d0fe4b96a0a7bd98925cebf4 [2025-03-04 15:24:23,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:24:23,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:24:23,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:23,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:24:23,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:24:23,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:23" (1/1) ... [2025-03-04 15:24:23,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a133c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:23, skipping insertion in model container [2025-03-04 15:24:23,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:23" (1/1) ... [2025-03-04 15:24:23,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:24:23,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:23,602 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:24:23,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:23,639 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:24:23,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:23 WrapperNode [2025-03-04 15:24:23,640 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:23,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:23,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:24:23,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:24:23,645 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:23" (1/1) ... [2025-03-04 15:24:23,651 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:23" (1/1) ... [2025-03-04 15:24:23,677 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 213 [2025-03-04 15:24:23,677 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:23,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:24:23,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:24:23,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:24:23,684 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:23" (1/1) ... [2025-03-04 15:24:23,684 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:23" (1/1) ... [2025-03-04 15:24:23,686 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:23" (1/1) ... [2025-03-04 15:24:23,696 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:23,697 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:23" (1/1) ... [2025-03-04 15:24:23,697 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:23" (1/1) ... [2025-03-04 15:24:23,709 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:23" (1/1) ... [2025-03-04 15:24:23,710 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:23" (1/1) ... [2025-03-04 15:24:23,710 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:23" (1/1) ... [2025-03-04 15:24:23,711 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:23" (1/1) ... [2025-03-04 15:24:23,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:24:23,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:24:23,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:24:23,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:24:23,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:23" (1/1) ... [2025-03-04 15:24:23,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:23,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:23,746 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:23,748 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:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:24:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:24:23,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:24:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:24:23,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:24:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:24:23,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:24:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:24:23,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:24:23,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:24:23,768 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:23,838 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:24:23,839 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:24:24,217 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:24:24,217 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:24:24,396 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:24:24,396 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:24:24,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:24 BoogieIcfgContainer [2025-03-04 15:24:24,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:24:24,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:24:24,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:24:24,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:24:24,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:24:23" (1/3) ... [2025-03-04 15:24:24,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6201b079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:24, skipping insertion in model container [2025-03-04 15:24:24,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:23" (2/3) ... [2025-03-04 15:24:24,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6201b079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:24, skipping insertion in model container [2025-03-04 15:24:24,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:24" (3/3) ... [2025-03-04 15:24:24,407 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2025-03-04 15:24:24,420 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:24:24,421 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-exp-term-subst.wvr.c that has 4 procedures, 84 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-03-04 15:24:24,421 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:24:24,516 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:24:24,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 98 transitions, 217 flow [2025-03-04 15:24:24,589 INFO L124 PetriNetUnfolderBase]: 15/95 cut-off events. [2025-03-04 15:24:24,594 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:24:24,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 95 events. 15/95 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 370 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2025-03-04 15:24:24,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 98 transitions, 217 flow [2025-03-04 15:24:24,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 93 transitions, 201 flow [2025-03-04 15:24:24,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:24:24,620 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;@47bf08c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:24:24,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-04 15:24:24,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:24:24,630 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2025-03-04 15:24:24,630 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:24:24,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:24,631 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:24,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1095399709, now seen corresponding path program 1 times [2025-03-04 15:24:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:24,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268664334] [2025-03-04 15:24:24,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:24,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:24,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:24:24,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:24:24,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:24,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:24,897 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:24,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:24,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268664334] [2025-03-04 15:24:24,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268664334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:24,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:24,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037043003] [2025-03-04 15:24:24,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:24,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:24,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:24,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:24,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:24,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 98 [2025-03-04 15:24:24,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 93 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:24,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:24,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 98 [2025-03-04 15:24:24,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:26,155 INFO L124 PetriNetUnfolderBase]: 6867/11745 cut-off events. [2025-03-04 15:24:26,155 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2025-03-04 15:24:26,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21122 conditions, 11745 events. 6867/11745 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 95488 event pairs, 2280 based on Foata normal form. 444/9744 useless extension candidates. Maximal degree in co-relation 20277. Up to 4832 conditions per place. [2025-03-04 15:24:26,262 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 63 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-03-04 15:24:26,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 116 transitions, 385 flow [2025-03-04 15:24:26,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:26,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2025-03-04 15:24:26,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2025-03-04 15:24:26,274 INFO L175 Difference]: Start difference. First operand has 88 places, 93 transitions, 201 flow. Second operand 4 states and 280 transitions. [2025-03-04 15:24:26,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 116 transitions, 385 flow [2025-03-04 15:24:26,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 116 transitions, 373 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:26,285 INFO L231 Difference]: Finished difference. Result has 84 places, 91 transitions, 194 flow [2025-03-04 15:24:26,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=84, PETRI_TRANSITIONS=91} [2025-03-04 15:24:26,290 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -4 predicate places. [2025-03-04 15:24:26,290 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 91 transitions, 194 flow [2025-03-04 15:24:26,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 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:26,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:26,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:26,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:24:26,291 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:26,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:26,292 INFO L85 PathProgramCache]: Analyzing trace with hash 402347965, now seen corresponding path program 1 times [2025-03-04 15:24:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750593078] [2025-03-04 15:24:26,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:26,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:26,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:24:26,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:24:26,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:26,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:26,396 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:26,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:26,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750593078] [2025-03-04 15:24:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750593078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:26,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161288682] [2025-03-04 15:24:26,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:26,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:26,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:26,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:26,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:26,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 98 [2025-03-04 15:24:26,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 91 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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:26,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:26,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 98 [2025-03-04 15:24:26,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:27,046 INFO L124 PetriNetUnfolderBase]: 5615/10251 cut-off events. [2025-03-04 15:24:27,047 INFO L125 PetriNetUnfolderBase]: For 452/452 co-relation queries the response was YES. [2025-03-04 15:24:27,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18192 conditions, 10251 events. 5615/10251 cut-off events. For 452/452 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 86874 event pairs, 2240 based on Foata normal form. 0/8533 useless extension candidates. Maximal degree in co-relation 8963. Up to 4208 conditions per place. [2025-03-04 15:24:27,113 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 61 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2025-03-04 15:24:27,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 115 transitions, 373 flow [2025-03-04 15:24:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:27,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:27,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2025-03-04 15:24:27,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7168367346938775 [2025-03-04 15:24:27,118 INFO L175 Difference]: Start difference. First operand has 84 places, 91 transitions, 194 flow. Second operand 4 states and 281 transitions. [2025-03-04 15:24:27,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 115 transitions, 373 flow [2025-03-04 15:24:27,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 115 transitions, 367 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:27,122 INFO L231 Difference]: Finished difference. Result has 83 places, 90 transitions, 192 flow [2025-03-04 15:24:27,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=83, PETRI_TRANSITIONS=90} [2025-03-04 15:24:27,123 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -5 predicate places. [2025-03-04 15:24:27,123 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 90 transitions, 192 flow [2025-03-04 15:24:27,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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:27,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:27,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:27,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:24:27,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:27,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:27,124 INFO L85 PathProgramCache]: Analyzing trace with hash -497809865, now seen corresponding path program 1 times [2025-03-04 15:24:27,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:27,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525073300] [2025-03-04 15:24:27,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:27,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:27,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:24:27,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:24:27,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:27,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:27,214 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:27,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:27,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525073300] [2025-03-04 15:24:27,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525073300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:27,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:27,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236734919] [2025-03-04 15:24:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:27,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:27,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:27,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:27,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:27,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 98 [2025-03-04 15:24:27,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 90 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:27,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:27,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 98 [2025-03-04 15:24:27,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:28,442 INFO L124 PetriNetUnfolderBase]: 11294/18048 cut-off events. [2025-03-04 15:24:28,443 INFO L125 PetriNetUnfolderBase]: For 823/823 co-relation queries the response was YES. [2025-03-04 15:24:28,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34005 conditions, 18048 events. 11294/18048 cut-off events. For 823/823 co-relation queries the response was YES. Maximal size of possible extension queue 1118. Compared 144063 event pairs, 3987 based on Foata normal form. 460/15500 useless extension candidates. Maximal degree in co-relation 16010. Up to 7687 conditions per place. [2025-03-04 15:24:28,554 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 91 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2025-03-04 15:24:28,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 141 transitions, 500 flow [2025-03-04 15:24:28,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-03-04 15:24:28,557 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7729591836734694 [2025-03-04 15:24:28,557 INFO L175 Difference]: Start difference. First operand has 83 places, 90 transitions, 192 flow. Second operand 4 states and 303 transitions. [2025-03-04 15:24:28,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 141 transitions, 500 flow [2025-03-04 15:24:28,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 141 transitions, 486 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:28,563 INFO L231 Difference]: Finished difference. Result has 85 places, 92 transitions, 220 flow [2025-03-04 15:24:28,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=85, PETRI_TRANSITIONS=92} [2025-03-04 15:24:28,564 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -3 predicate places. [2025-03-04 15:24:28,565 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 92 transitions, 220 flow [2025-03-04 15:24:28,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:28,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:28,565 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:28,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:24:28,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:28,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1747763973, now seen corresponding path program 1 times [2025-03-04 15:24:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:28,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819641595] [2025-03-04 15:24:28,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:28,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:24:28,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:24:28,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:28,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:28,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:28,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819641595] [2025-03-04 15:24:28,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819641595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:28,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:28,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:28,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18872305] [2025-03-04 15:24:28,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:28,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:28,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:28,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 98 [2025-03-04 15:24:28,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 92 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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:28,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:28,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 98 [2025-03-04 15:24:28,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:29,479 INFO L124 PetriNetUnfolderBase]: 8345/15114 cut-off events. [2025-03-04 15:24:29,479 INFO L125 PetriNetUnfolderBase]: For 3013/3033 co-relation queries the response was YES. [2025-03-04 15:24:29,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29444 conditions, 15114 events. 8345/15114 cut-off events. For 3013/3033 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 133923 event pairs, 2269 based on Foata normal form. 20/13058 useless extension candidates. Maximal degree in co-relation 16273. Up to 6426 conditions per place. [2025-03-04 15:24:29,568 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 62 selfloop transitions, 4 changer transitions 0/115 dead transitions. [2025-03-04 15:24:29,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 115 transitions, 401 flow [2025-03-04 15:24:29,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 281 transitions. [2025-03-04 15:24:29,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7168367346938775 [2025-03-04 15:24:29,571 INFO L175 Difference]: Start difference. First operand has 85 places, 92 transitions, 220 flow. Second operand 4 states and 281 transitions. [2025-03-04 15:24:29,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 115 transitions, 401 flow [2025-03-04 15:24:29,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 115 transitions, 401 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:29,621 INFO L231 Difference]: Finished difference. Result has 87 places, 91 transitions, 226 flow [2025-03-04 15:24:29,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=87, PETRI_TRANSITIONS=91} [2025-03-04 15:24:29,622 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, -1 predicate places. [2025-03-04 15:24:29,622 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 91 transitions, 226 flow [2025-03-04 15:24:29,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 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:29,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:29,623 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:29,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:24:29,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:29,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:29,624 INFO L85 PathProgramCache]: Analyzing trace with hash 108401983, now seen corresponding path program 1 times [2025-03-04 15:24:29,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:29,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876633714] [2025-03-04 15:24:29,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:29,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:24:29,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:24:29,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:29,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:29,695 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:29,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:29,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876633714] [2025-03-04 15:24:29,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876633714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:29,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:29,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:29,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27619115] [2025-03-04 15:24:29,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:29,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:29,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:29,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:29,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:29,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 98 [2025-03-04 15:24:29,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 91 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 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:29,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:29,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 98 [2025-03-04 15:24:29,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:30,482 INFO L124 PetriNetUnfolderBase]: 10270/16640 cut-off events. [2025-03-04 15:24:30,482 INFO L125 PetriNetUnfolderBase]: For 5828/6377 co-relation queries the response was YES. [2025-03-04 15:24:30,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34226 conditions, 16640 events. 10270/16640 cut-off events. For 5828/6377 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 133907 event pairs, 2750 based on Foata normal form. 277/14520 useless extension candidates. Maximal degree in co-relation 20090. Up to 5572 conditions per place. [2025-03-04 15:24:30,650 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 95 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2025-03-04 15:24:30,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 145 transitions, 588 flow [2025-03-04 15:24:30,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 355 transitions. [2025-03-04 15:24:30,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2025-03-04 15:24:30,653 INFO L175 Difference]: Start difference. First operand has 87 places, 91 transitions, 226 flow. Second operand 5 states and 355 transitions. [2025-03-04 15:24:30,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 145 transitions, 588 flow [2025-03-04 15:24:30,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 145 transitions, 568 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:30,664 INFO L231 Difference]: Finished difference. Result has 88 places, 91 transitions, 233 flow [2025-03-04 15:24:30,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=88, PETRI_TRANSITIONS=91} [2025-03-04 15:24:30,666 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 0 predicate places. [2025-03-04 15:24:30,666 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 91 transitions, 233 flow [2025-03-04 15:24:30,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.4) internal successors, (267), 5 states have internal predecessors, (267), 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,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:30,667 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:30,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:24:30,667 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:30,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:30,668 INFO L85 PathProgramCache]: Analyzing trace with hash 108402976, now seen corresponding path program 1 times [2025-03-04 15:24:30,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:30,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784512912] [2025-03-04 15:24:30,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:30,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:24:30,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:24:30,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:30,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:30,740 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,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:30,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784512912] [2025-03-04 15:24:30,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784512912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:30,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:30,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:30,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144280290] [2025-03-04 15:24:30,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:30,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:30,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:30,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:30,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:30,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 98 [2025-03-04 15:24:30,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 91 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:30,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 98 [2025-03-04 15:24:30,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:31,968 INFO L124 PetriNetUnfolderBase]: 11237/19866 cut-off events. [2025-03-04 15:24:31,969 INFO L125 PetriNetUnfolderBase]: For 5294/5876 co-relation queries the response was YES. [2025-03-04 15:24:32,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40145 conditions, 19866 events. 11237/19866 cut-off events. For 5294/5876 co-relation queries the response was YES. Maximal size of possible extension queue 1162. Compared 177292 event pairs, 5070 based on Foata normal form. 295/17591 useless extension candidates. Maximal degree in co-relation 23907. Up to 9302 conditions per place. [2025-03-04 15:24:32,106 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 97 selfloop transitions, 5 changer transitions 0/148 dead transitions. [2025-03-04 15:24:32,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 148 transitions, 595 flow [2025-03-04 15:24:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 301 transitions. [2025-03-04 15:24:32,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7678571428571429 [2025-03-04 15:24:32,108 INFO L175 Difference]: Start difference. First operand has 88 places, 91 transitions, 233 flow. Second operand 4 states and 301 transitions. [2025-03-04 15:24:32,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 148 transitions, 595 flow [2025-03-04 15:24:32,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 586 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:32,121 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 253 flow [2025-03-04 15:24:32,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2025-03-04 15:24:32,122 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 2 predicate places. [2025-03-04 15:24:32,122 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 253 flow [2025-03-04 15:24:32,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.5) internal successors, (210), 4 states have internal predecessors, (210), 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:32,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:32,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:32,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:24:32,123 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:32,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1653921829, now seen corresponding path program 1 times [2025-03-04 15:24:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:32,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399143493] [2025-03-04 15:24:32,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:32,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:32,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:24:32,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:24:32,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:32,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:32,165 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:32,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:32,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399143493] [2025-03-04 15:24:32,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399143493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:32,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:32,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121511900] [2025-03-04 15:24:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:32,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:32,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:32,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:32,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 98 [2025-03-04 15:24:32,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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:32,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:32,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 98 [2025-03-04 15:24:32,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:32,956 INFO L124 PetriNetUnfolderBase]: 10160/18534 cut-off events. [2025-03-04 15:24:32,956 INFO L125 PetriNetUnfolderBase]: For 8932/9372 co-relation queries the response was YES. [2025-03-04 15:24:32,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39165 conditions, 18534 events. 10160/18534 cut-off events. For 8932/9372 co-relation queries the response was YES. Maximal size of possible extension queue 1113. Compared 168719 event pairs, 2742 based on Foata normal form. 552/16887 useless extension candidates. Maximal degree in co-relation 26873. Up to 8018 conditions per place. [2025-03-04 15:24:33,061 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 69 selfloop transitions, 4 changer transitions 0/119 dead transitions. [2025-03-04 15:24:33,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 119 transitions, 476 flow [2025-03-04 15:24:33,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:33,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 277 transitions. [2025-03-04 15:24:33,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066326530612245 [2025-03-04 15:24:33,062 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 253 flow. Second operand 4 states and 277 transitions. [2025-03-04 15:24:33,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 119 transitions, 476 flow [2025-03-04 15:24:33,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 119 transitions, 471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:33,135 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 254 flow [2025-03-04 15:24:33,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2025-03-04 15:24:33,136 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2025-03-04 15:24:33,136 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 254 flow [2025-03-04 15:24:33,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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:33,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:33,136 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:33,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:24:33,136 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:33,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:33,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1068370081, now seen corresponding path program 1 times [2025-03-04 15:24:33,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:33,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58886501] [2025-03-04 15:24:33,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:33,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:33,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:24:33,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:24:33,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:33,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:33,183 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:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58886501] [2025-03-04 15:24:33,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58886501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:33,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:33,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:33,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056529475] [2025-03-04 15:24:33,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:33,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:33,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:33,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:33,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:33,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 98 [2025-03-04 15:24:33,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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:33,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:33,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 98 [2025-03-04 15:24:33,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:33,999 INFO L124 PetriNetUnfolderBase]: 10186/18366 cut-off events. [2025-03-04 15:24:34,000 INFO L125 PetriNetUnfolderBase]: For 9542/10193 co-relation queries the response was YES. [2025-03-04 15:24:34,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38481 conditions, 18366 events. 10186/18366 cut-off events. For 9542/10193 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 166634 event pairs, 3710 based on Foata normal form. 1120/16662 useless extension candidates. Maximal degree in co-relation 26219. Up to 6848 conditions per place. [2025-03-04 15:24:34,097 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 71 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-03-04 15:24:34,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 118 transitions, 502 flow [2025-03-04 15:24:34,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2025-03-04 15:24:34,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7091836734693877 [2025-03-04 15:24:34,098 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 254 flow. Second operand 4 states and 278 transitions. [2025-03-04 15:24:34,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 118 transitions, 502 flow [2025-03-04 15:24:34,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 118 transitions, 488 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:34,130 INFO L231 Difference]: Finished difference. Result has 89 places, 90 transitions, 248 flow [2025-03-04 15:24:34,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=248, PETRI_PLACES=89, PETRI_TRANSITIONS=90} [2025-03-04 15:24:34,131 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2025-03-04 15:24:34,131 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 90 transitions, 248 flow [2025-03-04 15:24:34,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 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:34,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:34,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:34,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:24:34,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:34,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:34,132 INFO L85 PathProgramCache]: Analyzing trace with hash -934505238, now seen corresponding path program 1 times [2025-03-04 15:24:34,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:34,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866848486] [2025-03-04 15:24:34,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:34,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:24:34,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:24:34,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:34,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:34,210 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:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866848486] [2025-03-04 15:24:34,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866848486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:34,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:34,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477281488] [2025-03-04 15:24:34,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:34,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:34,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:34,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:24:34,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 98 [2025-03-04 15:24:34,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 90 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 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:34,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:34,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 98 [2025-03-04 15:24:34,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:35,243 INFO L124 PetriNetUnfolderBase]: 13504/21319 cut-off events. [2025-03-04 15:24:35,243 INFO L125 PetriNetUnfolderBase]: For 8847/9231 co-relation queries the response was YES. [2025-03-04 15:24:35,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47716 conditions, 21319 events. 13504/21319 cut-off events. For 8847/9231 co-relation queries the response was YES. Maximal size of possible extension queue 1265. Compared 171057 event pairs, 2731 based on Foata normal form. 916/20687 useless extension candidates. Maximal degree in co-relation 28798. Up to 5350 conditions per place. [2025-03-04 15:24:35,346 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 120 selfloop transitions, 9 changer transitions 0/171 dead transitions. [2025-03-04 15:24:35,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 171 transitions, 743 flow [2025-03-04 15:24:35,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:24:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:24:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 413 transitions. [2025-03-04 15:24:35,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7023809523809523 [2025-03-04 15:24:35,348 INFO L175 Difference]: Start difference. First operand has 89 places, 90 transitions, 248 flow. Second operand 6 states and 413 transitions. [2025-03-04 15:24:35,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 171 transitions, 743 flow [2025-03-04 15:24:35,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 171 transitions, 725 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:35,403 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 267 flow [2025-03-04 15:24:35,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=267, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2025-03-04 15:24:35,404 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 3 predicate places. [2025-03-04 15:24:35,404 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 267 flow [2025-03-04 15:24:35,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.166666666666664) internal successors, (301), 6 states have internal predecessors, (301), 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:35,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:35,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:35,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:24:35,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:35,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:35,405 INFO L85 PathProgramCache]: Analyzing trace with hash 268030471, now seen corresponding path program 1 times [2025-03-04 15:24:35,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:35,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378172874] [2025-03-04 15:24:35,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:35,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:35,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:24:35,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:24:35,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:35,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:35,456 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:35,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378172874] [2025-03-04 15:24:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378172874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059576097] [2025-03-04 15:24:35,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:35,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:35,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:35,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:35,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 98 [2025-03-04 15:24:35,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 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:35,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:35,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 98 [2025-03-04 15:24:35,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:36,734 INFO L124 PetriNetUnfolderBase]: 14017/21939 cut-off events. [2025-03-04 15:24:36,734 INFO L125 PetriNetUnfolderBase]: For 15519/17067 co-relation queries the response was YES. [2025-03-04 15:24:36,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52347 conditions, 21939 events. 14017/21939 cut-off events. For 15519/17067 co-relation queries the response was YES. Maximal size of possible extension queue 1274. Compared 173491 event pairs, 2663 based on Foata normal form. 1004/21272 useless extension candidates. Maximal degree in co-relation 34058. Up to 9796 conditions per place. [2025-03-04 15:24:36,871 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 99 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2025-03-04 15:24:36,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 145 transitions, 671 flow [2025-03-04 15:24:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 353 transitions. [2025-03-04 15:24:36,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7204081632653061 [2025-03-04 15:24:36,873 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 267 flow. Second operand 5 states and 353 transitions. [2025-03-04 15:24:36,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 145 transitions, 671 flow [2025-03-04 15:24:36,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 145 transitions, 640 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:24:36,948 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 264 flow [2025-03-04 15:24:36,948 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-03-04 15:24:36,948 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 2 predicate places. [2025-03-04 15:24:36,949 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 264 flow [2025-03-04 15:24:36,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 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:36,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:36,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:36,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:24:36,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:36,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:36,950 INFO L85 PathProgramCache]: Analyzing trace with hash 268031464, now seen corresponding path program 1 times [2025-03-04 15:24:36,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:36,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961056476] [2025-03-04 15:24:36,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:36,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:36,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:24:36,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:24:36,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:36,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:37,000 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:37,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961056476] [2025-03-04 15:24:37,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961056476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:37,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:37,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:37,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781069626] [2025-03-04 15:24:37,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:37,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:37,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:37,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:37,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:37,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 98 [2025-03-04 15:24:37,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:37,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:37,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 98 [2025-03-04 15:24:37,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:38,222 INFO L124 PetriNetUnfolderBase]: 11347/19399 cut-off events. [2025-03-04 15:24:38,223 INFO L125 PetriNetUnfolderBase]: For 13227/14341 co-relation queries the response was YES. [2025-03-04 15:24:38,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44530 conditions, 19399 events. 11347/19399 cut-off events. For 13227/14341 co-relation queries the response was YES. Maximal size of possible extension queue 1140. Compared 167332 event pairs, 5047 based on Foata normal form. 1056/18631 useless extension candidates. Maximal degree in co-relation 29778. Up to 9455 conditions per place. [2025-03-04 15:24:38,344 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 101 selfloop transitions, 4 changer transitions 0/145 dead transitions. [2025-03-04 15:24:38,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 145 transitions, 648 flow [2025-03-04 15:24:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 298 transitions. [2025-03-04 15:24:38,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7602040816326531 [2025-03-04 15:24:38,345 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 264 flow. Second operand 4 states and 298 transitions. [2025-03-04 15:24:38,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 145 transitions, 648 flow [2025-03-04 15:24:38,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 145 transitions, 636 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:24:38,432 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 254 flow [2025-03-04 15:24:38,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2025-03-04 15:24:38,432 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2025-03-04 15:24:38,432 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 254 flow [2025-03-04 15:24:38,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:38,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:38,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:38,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:24:38,433 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:38,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1240266489, now seen corresponding path program 1 times [2025-03-04 15:24:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648326859] [2025-03-04 15:24:38,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:38,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:24:38,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:24:38,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:38,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:38,490 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:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648326859] [2025-03-04 15:24:38,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648326859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:38,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:38,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:38,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403811859] [2025-03-04 15:24:38,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:38,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:38,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:38,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:38,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:38,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 98 [2025-03-04 15:24:38,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:38,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:38,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 98 [2025-03-04 15:24:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:39,197 INFO L124 PetriNetUnfolderBase]: 8444/16044 cut-off events. [2025-03-04 15:24:39,198 INFO L125 PetriNetUnfolderBase]: For 8572/9474 co-relation queries the response was YES. [2025-03-04 15:24:39,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33792 conditions, 16044 events. 8444/16044 cut-off events. For 8572/9474 co-relation queries the response was YES. Maximal size of possible extension queue 958. Compared 149860 event pairs, 3711 based on Foata normal form. 732/14834 useless extension candidates. Maximal degree in co-relation 22701. Up to 6850 conditions per place. [2025-03-04 15:24:39,283 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 71 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-03-04 15:24:39,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 116 transitions, 513 flow [2025-03-04 15:24:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2025-03-04 15:24:39,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7117346938775511 [2025-03-04 15:24:39,284 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 254 flow. Second operand 4 states and 279 transitions. [2025-03-04 15:24:39,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 116 transitions, 513 flow [2025-03-04 15:24:39,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 116 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:24:39,313 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 252 flow [2025-03-04 15:24:39,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2025-03-04 15:24:39,314 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2025-03-04 15:24:39,314 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 252 flow [2025-03-04 15:24:39,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 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:39,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:39,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:39,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:24:39,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:39,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:39,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2013798214, now seen corresponding path program 1 times [2025-03-04 15:24:39,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:39,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692164210] [2025-03-04 15:24:39,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:39,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:24:39,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:24:39,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:39,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:39,350 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:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:39,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692164210] [2025-03-04 15:24:39,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692164210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:39,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:39,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317474921] [2025-03-04 15:24:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:39,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:39,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:39,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:39,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 98 [2025-03-04 15:24:39,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:39,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:39,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 98 [2025-03-04 15:24:39,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:40,279 INFO L124 PetriNetUnfolderBase]: 13355/21018 cut-off events. [2025-03-04 15:24:40,279 INFO L125 PetriNetUnfolderBase]: For 12245/12843 co-relation queries the response was YES. [2025-03-04 15:24:40,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48315 conditions, 21018 events. 13355/21018 cut-off events. For 12245/12843 co-relation queries the response was YES. Maximal size of possible extension queue 1205. Compared 167459 event pairs, 4973 based on Foata normal form. 864/20294 useless extension candidates. Maximal degree in co-relation 29224. Up to 9406 conditions per place. [2025-03-04 15:24:40,404 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 97 selfloop transitions, 5 changer transitions 0/141 dead transitions. [2025-03-04 15:24:40,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 141 transitions, 614 flow [2025-03-04 15:24:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:40,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:40,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 298 transitions. [2025-03-04 15:24:40,405 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7602040816326531 [2025-03-04 15:24:40,405 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 252 flow. Second operand 4 states and 298 transitions. [2025-03-04 15:24:40,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 141 transitions, 614 flow [2025-03-04 15:24:40,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 141 transitions, 600 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:40,425 INFO L231 Difference]: Finished difference. Result has 89 places, 87 transitions, 260 flow [2025-03-04 15:24:40,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=260, PETRI_PLACES=89, PETRI_TRANSITIONS=87} [2025-03-04 15:24:40,426 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 1 predicate places. [2025-03-04 15:24:40,426 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 87 transitions, 260 flow [2025-03-04 15:24:40,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 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:40,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:40,427 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:40,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:24:40,427 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash -280989378, now seen corresponding path program 1 times [2025-03-04 15:24:40,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:40,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615275343] [2025-03-04 15:24:40,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:40,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:40,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:24:40,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:24:40,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:40,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:40,471 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:40,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:40,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615275343] [2025-03-04 15:24:40,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615275343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:40,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:40,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683340769] [2025-03-04 15:24:40,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:40,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:40,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:40,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:40,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:24:40,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 98 [2025-03-04 15:24:40,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 87 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 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:40,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:40,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 98 [2025-03-04 15:24:40,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:41,567 INFO L124 PetriNetUnfolderBase]: 14775/22853 cut-off events. [2025-03-04 15:24:41,567 INFO L125 PetriNetUnfolderBase]: For 18603/19627 co-relation queries the response was YES. [2025-03-04 15:24:41,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55899 conditions, 22853 events. 14775/22853 cut-off events. For 18603/19627 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 178969 event pairs, 2875 based on Foata normal form. 1616/22670 useless extension candidates. Maximal degree in co-relation 42633. Up to 5986 conditions per place. [2025-03-04 15:24:41,685 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 128 selfloop transitions, 9 changer transitions 0/174 dead transitions. [2025-03-04 15:24:41,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 174 transitions, 852 flow [2025-03-04 15:24:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:24:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:24:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 410 transitions. [2025-03-04 15:24:41,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6972789115646258 [2025-03-04 15:24:41,687 INFO L175 Difference]: Start difference. First operand has 89 places, 87 transitions, 260 flow. Second operand 6 states and 410 transitions. [2025-03-04 15:24:41,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 174 transitions, 852 flow [2025-03-04 15:24:41,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 174 transitions, 836 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:41,760 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 281 flow [2025-03-04 15:24:41,760 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2025-03-04 15:24:41,760 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 5 predicate places. [2025-03-04 15:24:41,760 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 281 flow [2025-03-04 15:24:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 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:41,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:41,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:41,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:24:41,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:41,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash 797953422, now seen corresponding path program 1 times [2025-03-04 15:24:41,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:41,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916664991] [2025-03-04 15:24:41,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:41,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:41,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:24:41,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:24:41,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:41,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:41,822 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:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916664991] [2025-03-04 15:24:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916664991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:41,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:24:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667402441] [2025-03-04 15:24:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:41,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:41,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:41,850 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 98 [2025-03-04 15:24:41,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 281 flow. Second operand has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:41,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:41,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 98 [2025-03-04 15:24:41,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:42,887 INFO L124 PetriNetUnfolderBase]: 14711/22145 cut-off events. [2025-03-04 15:24:42,887 INFO L125 PetriNetUnfolderBase]: For 21080/22060 co-relation queries the response was YES. [2025-03-04 15:24:42,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57531 conditions, 22145 events. 14711/22145 cut-off events. For 21080/22060 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 166472 event pairs, 5465 based on Foata normal form. 1276/21811 useless extension candidates. Maximal degree in co-relation 44167. Up to 10497 conditions per place. [2025-03-04 15:24:43,029 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 161 selfloop transitions, 8 changer transitions 0/204 dead transitions. [2025-03-04 15:24:43,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 204 transitions, 1029 flow [2025-03-04 15:24:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:24:43,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:24:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 439 transitions. [2025-03-04 15:24:43,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7465986394557823 [2025-03-04 15:24:43,031 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 281 flow. Second operand 6 states and 439 transitions. [2025-03-04 15:24:43,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 204 transitions, 1029 flow [2025-03-04 15:24:43,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 204 transitions, 1011 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:43,197 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 292 flow [2025-03-04 15:24:43,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=292, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2025-03-04 15:24:43,197 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 6 predicate places. [2025-03-04 15:24:43,197 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 292 flow [2025-03-04 15:24:43,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.0) internal successors, (255), 5 states have internal predecessors, (255), 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:43,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:43,197 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:43,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:24:43,198 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:43,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:43,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2105746309, now seen corresponding path program 1 times [2025-03-04 15:24:43,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:43,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287757701] [2025-03-04 15:24:43,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:43,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:43,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:24:43,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:24:43,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:43,256 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:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:43,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287757701] [2025-03-04 15:24:43,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287757701] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:43,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:43,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305028407] [2025-03-04 15:24:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:43,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:43,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:43,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:43,285 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 98 [2025-03-04 15:24:43,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 292 flow. Second operand has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 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:43,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:43,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 98 [2025-03-04 15:24:43,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:44,221 INFO L124 PetriNetUnfolderBase]: 13734/21225 cut-off events. [2025-03-04 15:24:44,222 INFO L125 PetriNetUnfolderBase]: For 31090/32909 co-relation queries the response was YES. [2025-03-04 15:24:44,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54878 conditions, 21225 events. 13734/21225 cut-off events. For 31090/32909 co-relation queries the response was YES. Maximal size of possible extension queue 1211. Compared 164368 event pairs, 4044 based on Foata normal form. 1819/21089 useless extension candidates. Maximal degree in co-relation 42388. Up to 7400 conditions per place. [2025-03-04 15:24:44,362 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 112 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2025-03-04 15:24:44,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 152 transitions, 822 flow [2025-03-04 15:24:44,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:24:44,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:24:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 351 transitions. [2025-03-04 15:24:44,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7163265306122449 [2025-03-04 15:24:44,363 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 292 flow. Second operand 5 states and 351 transitions. [2025-03-04 15:24:44,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 152 transitions, 822 flow [2025-03-04 15:24:44,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 152 transitions, 782 flow, removed 9 selfloop flow, removed 4 redundant places. [2025-03-04 15:24:44,409 INFO L231 Difference]: Finished difference. Result has 94 places, 88 transitions, 291 flow [2025-03-04 15:24:44,409 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=94, PETRI_TRANSITIONS=88} [2025-03-04 15:24:44,410 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 6 predicate places. [2025-03-04 15:24:44,410 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 88 transitions, 291 flow [2025-03-04 15:24:44,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 54.2) internal successors, (271), 5 states have internal predecessors, (271), 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:44,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:44,410 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:44,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:24:44,410 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:44,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2105745316, now seen corresponding path program 1 times [2025-03-04 15:24:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382981350] [2025-03-04 15:24:44,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:44,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:24:44,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:24:44,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:44,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:44,435 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:44,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:44,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382981350] [2025-03-04 15:24:44,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382981350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:44,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:44,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:44,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807762141] [2025-03-04 15:24:44,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:44,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:44,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:44,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:44,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:44,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 98 [2025-03-04 15:24:44,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 88 transitions, 291 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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:44,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:44,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 98 [2025-03-04 15:24:44,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:45,634 INFO L124 PetriNetUnfolderBase]: 14990/24905 cut-off events. [2025-03-04 15:24:45,634 INFO L125 PetriNetUnfolderBase]: For 27525/29450 co-relation queries the response was YES. [2025-03-04 15:24:45,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61429 conditions, 24905 events. 14990/24905 cut-off events. For 27525/29450 co-relation queries the response was YES. Maximal size of possible extension queue 1319. Compared 213975 event pairs, 7060 based on Foata normal form. 1925/24988 useless extension candidates. Maximal degree in co-relation 47629. Up to 12750 conditions per place. [2025-03-04 15:24:45,758 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 114 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2025-03-04 15:24:45,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 155 transitions, 809 flow [2025-03-04 15:24:45,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:45,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 297 transitions. [2025-03-04 15:24:45,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7576530612244898 [2025-03-04 15:24:45,759 INFO L175 Difference]: Start difference. First operand has 94 places, 88 transitions, 291 flow. Second operand 4 states and 297 transitions. [2025-03-04 15:24:45,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 155 transitions, 809 flow [2025-03-04 15:24:45,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 155 transitions, 800 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:24:45,805 INFO L231 Difference]: Finished difference. Result has 96 places, 90 transitions, 311 flow [2025-03-04 15:24:45,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=96, PETRI_TRANSITIONS=90} [2025-03-04 15:24:45,805 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 8 predicate places. [2025-03-04 15:24:45,805 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 90 transitions, 311 flow [2025-03-04 15:24:45,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 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:45,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:45,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:45,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:24:45,806 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:45,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:45,806 INFO L85 PathProgramCache]: Analyzing trace with hash -853625498, now seen corresponding path program 1 times [2025-03-04 15:24:45,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:45,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564540530] [2025-03-04 15:24:45,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:45,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:24:45,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:24:45,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:45,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:45,856 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:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564540530] [2025-03-04 15:24:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564540530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:45,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:24:45,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350297000] [2025-03-04 15:24:45,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:45,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:24:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:45,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:24:45,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:24:45,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 98 [2025-03-04 15:24:45,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 90 transitions, 311 flow. Second operand has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 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:45,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:45,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 98 [2025-03-04 15:24:45,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:47,249 INFO L124 PetriNetUnfolderBase]: 17783/27224 cut-off events. [2025-03-04 15:24:47,249 INFO L125 PetriNetUnfolderBase]: For 35967/38398 co-relation queries the response was YES. [2025-03-04 15:24:47,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72338 conditions, 27224 events. 17783/27224 cut-off events. For 35967/38398 co-relation queries the response was YES. Maximal size of possible extension queue 1428. Compared 213520 event pairs, 4044 based on Foata normal form. 3081/28815 useless extension candidates. Maximal degree in co-relation 56121. Up to 7725 conditions per place. [2025-03-04 15:24:47,440 INFO L140 encePairwiseOnDemand]: 90/98 looper letters, 142 selfloop transitions, 9 changer transitions 0/186 dead transitions. [2025-03-04 15:24:47,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 186 transitions, 1021 flow [2025-03-04 15:24:47,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:24:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:24:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 407 transitions. [2025-03-04 15:24:47,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6921768707482994 [2025-03-04 15:24:47,441 INFO L175 Difference]: Start difference. First operand has 96 places, 90 transitions, 311 flow. Second operand 6 states and 407 transitions. [2025-03-04 15:24:47,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 186 transitions, 1021 flow [2025-03-04 15:24:47,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 186 transitions, 1018 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:47,580 INFO L231 Difference]: Finished difference. Result has 100 places, 90 transitions, 333 flow [2025-03-04 15:24:47,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=100, PETRI_TRANSITIONS=90} [2025-03-04 15:24:47,580 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 12 predicate places. [2025-03-04 15:24:47,581 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 90 transitions, 333 flow [2025-03-04 15:24:47,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.833333333333336) internal successors, (305), 6 states have internal predecessors, (305), 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:47,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:47,581 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:47,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:24:47,581 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 36 more)] === [2025-03-04 15:24:47,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash 226102914, now seen corresponding path program 1 times [2025-03-04 15:24:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888823029] [2025-03-04 15:24:47,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:47,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:24:47,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:24:47,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:47,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:47,628 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:47,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:47,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888823029] [2025-03-04 15:24:47,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888823029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:47,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:47,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:24:47,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643587804] [2025-03-04 15:24:47,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:47,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:24:47,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:47,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:24:47,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:24:47,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 98 [2025-03-04 15:24:47,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 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:47,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:47,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 98 [2025-03-04 15:24:47,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:48,931 INFO L124 PetriNetUnfolderBase]: 17458/26076 cut-off events. [2025-03-04 15:24:48,932 INFO L125 PetriNetUnfolderBase]: For 38048/40432 co-relation queries the response was YES. [2025-03-04 15:24:49,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73883 conditions, 26076 events. 17458/26076 cut-off events. For 38048/40432 co-relation queries the response was YES. Maximal size of possible extension queue 1408. Compared 198327 event pairs, 7060 based on Foata normal form. 2709/27918 useless extension candidates. Maximal degree in co-relation 57380. Up to 13075 conditions per place. [2025-03-04 15:24:49,062 INFO L140 encePairwiseOnDemand]: 91/98 looper letters, 0 selfloop transitions, 0 changer transitions 218/218 dead transitions. [2025-03-04 15:24:49,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 218 transitions, 1243 flow [2025-03-04 15:24:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:24:49,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:24:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 435 transitions. [2025-03-04 15:24:49,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7397959183673469 [2025-03-04 15:24:49,063 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 333 flow. Second operand 6 states and 435 transitions. [2025-03-04 15:24:49,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 218 transitions, 1243 flow [2025-03-04 15:24:49,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 218 transitions, 1225 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:49,284 INFO L231 Difference]: Finished difference. Result has 99 places, 0 transitions, 0 flow [2025-03-04 15:24:49,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=99, PETRI_TRANSITIONS=0} [2025-03-04 15:24:49,285 INFO L279 CegarLoopForPetriNet]: 88 programPoint places, 11 predicate places. [2025-03-04 15:24:49,285 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 0 transitions, 0 flow [2025-03-04 15:24:49,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 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:49,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 39 remaining) [2025-03-04 15:24:49,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 39 remaining) [2025-03-04 15:24:49,290 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 39 remaining) [2025-03-04 15:24:49,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:24:49,290 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:49,295 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:24:49,296 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:24:49,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:24:49 BasicIcfg [2025-03-04 15:24:49,301 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:24:49,302 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:24:49,302 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:24:49,302 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:24:49,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:24" (3/4) ... [2025-03-04 15:24:49,304 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:24:49,306 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:24:49,306 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:24:49,306 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:24:49,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2025-03-04 15:24:49,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-03-04 15:24:49,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 15:24:49,310 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:24:49,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:24:49,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:24:49,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:24:49,370 INFO L158 Benchmark]: Toolchain (without parser) took 25913.44ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 115.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-04 15:24:49,370 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:24:49,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.90ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 103.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:24:49,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.57ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 101.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:24:49,371 INFO L158 Benchmark]: Boogie Preprocessor took 38.75ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:24:49,371 INFO L158 Benchmark]: IcfgBuilder took 680.53ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 52.6MB in the end (delta: 48.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 15:24:49,372 INFO L158 Benchmark]: TraceAbstraction took 24901.38ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 52.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-03-04 15:24:49,372 INFO L158 Benchmark]: Witness Printer took 67.56ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:24:49,373 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.90ms. Allocated memory is still 142.6MB. Free memory was 115.8MB in the beginning and 103.9MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.57ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 101.7MB in the end (delta: 2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.75ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 100.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 680.53ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 52.6MB in the end (delta: 48.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 24901.38ms. Allocated memory was 142.6MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 52.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 67.56ms. Allocated memory is still 2.5GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 88]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 159 locations, 39 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 24.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2109 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1803 mSDsluCounter, 223 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 101 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3990 IncrementalHoareTripleChecker+Invalid, 4091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 101 mSolverCounterUnsat, 89 mSDtfsCounter, 3990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=18, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 221 ConstructedInterpolants, 0 QuantifiedInterpolants, 738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:24:49,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE