./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-100.i --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/pthread-theta/unwind3-100.i -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 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:32:12,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:32:12,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:32:12,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:32:12,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:32:12,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:32:12,726 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:32:12,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:32:12,727 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:32:12,727 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:32:12,727 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:32:12,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:32:12,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:32:12,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:32:12,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:32:12,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:32:12,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:32:12,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:32:12,732 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 -> 51e84781857cfc73ae131a38742d9d6222707e54f6a010e2853f82c7770f5a96 [2025-03-04 15:32:12,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:32:12,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:32:12,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:32:12,953 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:32:12,953 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:32:12,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-04 15:32:14,041 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd9fd453/88888f519fd047458fedf43db2e2c560/FLAG972a6be4f [2025-03-04 15:32:14,290 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:32:14,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-100.i [2025-03-04 15:32:14,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd9fd453/88888f519fd047458fedf43db2e2c560/FLAG972a6be4f [2025-03-04 15:32:14,613 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd9fd453/88888f519fd047458fedf43db2e2c560 [2025-03-04 15:32:14,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:32:14,616 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:32:14,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:32:14,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:32:14,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:32:14,620 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c92c80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14, skipping insertion in model container [2025-03-04 15:32:14,621 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:32:14,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:32:14,852 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:32:14,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:32:14,911 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:32:14,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14 WrapperNode [2025-03-04 15:32:14,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:32:14,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:32:14,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:32:14,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:32:14,916 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:32:14" (1/1) ... [2025-03-04 15:32:14,923 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:32:14" (1/1) ... [2025-03-04 15:32:14,934 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2025-03-04 15:32:14,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:32:14,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:32:14,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:32:14,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:32:14,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,948 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:32:14,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,951 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:32:14,956 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:32:14,956 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:32:14,956 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:32:14,957 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (1/1) ... [2025-03-04 15:32:14,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:32:14,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:14,979 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:32:14,981 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:32:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:32:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 15:32:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 15:32:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 15:32:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 15:32:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:32:14,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:32:14,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:32:14,997 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:32:15,086 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:32:15,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:32:15,194 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:32:15,195 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:32:15,278 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:32:15,279 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:32:15,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:32:15 BoogieIcfgContainer [2025-03-04 15:32:15,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:32:15,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:32:15,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:32:15,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:32:15,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:32:14" (1/3) ... [2025-03-04 15:32:15,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129478f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:32:15, skipping insertion in model container [2025-03-04 15:32:15,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:14" (2/3) ... [2025-03-04 15:32:15,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129478f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:32:15, skipping insertion in model container [2025-03-04 15:32:15,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:32:15" (3/3) ... [2025-03-04 15:32:15,289 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-100.i [2025-03-04 15:32:15,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:32:15,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-100.i that has 3 procedures, 32 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:32:15,305 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:32:15,335 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:32:15,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 74 flow [2025-03-04 15:32:15,390 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2025-03-04 15:32:15,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:15,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 132 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 29. Up to 4 conditions per place. [2025-03-04 15:32:15,394 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 74 flow [2025-03-04 15:32:15,397 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 71 flow [2025-03-04 15:32:15,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:15,417 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;@7063dd32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:15,418 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 15:32:15,422 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:15,422 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:32:15,423 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:15,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:15,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:15,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-04 15:32:15,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1462562630, now seen corresponding path program 1 times [2025-03-04 15:32:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:15,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335706515] [2025-03-04 15:32:15,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:15,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:15,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:15,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:15,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:15,659 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:32:15,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:15,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335706515] [2025-03-04 15:32:15,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335706515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:15,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:15,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:15,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524256168] [2025-03-04 15:32:15,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:15,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:15,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:15,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:15,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:15,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-03-04 15:32:15,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:32:15,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:15,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-03-04 15:32:15,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:15,835 INFO L124 PetriNetUnfolderBase]: 92/234 cut-off events. [2025-03-04 15:32:15,835 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 15:32:15,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 234 events. 92/234 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1032 event pairs, 11 based on Foata normal form. 27/238 useless extension candidates. Maximal degree in co-relation 371. Up to 140 conditions per place. [2025-03-04 15:32:15,842 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 26 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-03-04 15:32:15,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 150 flow [2025-03-04 15:32:15,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:32:15,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:32:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2025-03-04 15:32:15,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878787878787879 [2025-03-04 15:32:15,854 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 71 flow. Second operand 5 states and 97 transitions. [2025-03-04 15:32:15,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 150 flow [2025-03-04 15:32:15,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:15,859 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 72 flow [2025-03-04 15:32:15,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2025-03-04 15:32:15,864 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-03-04 15:32:15,864 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 72 flow [2025-03-04 15:32:15,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:32:15,864 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:15,864 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:15,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:32:15,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-04 15:32:15,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:15,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1462562687, now seen corresponding path program 1 times [2025-03-04 15:32:15,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:15,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466583136] [2025-03-04 15:32:15,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:15,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:15,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:15,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:15,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:15,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:15,914 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:32:15,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:15,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466583136] [2025-03-04 15:32:15,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466583136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:15,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:15,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:32:15,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009442088] [2025-03-04 15:32:15,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:15,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:15,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:15,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:15,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:15,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2025-03-04 15:32:15,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:32:15,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:15,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2025-03-04 15:32:15,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:15,994 INFO L124 PetriNetUnfolderBase]: 61/197 cut-off events. [2025-03-04 15:32:15,994 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-04 15:32:15,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 197 events. 61/197 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 925 event pairs, 18 based on Foata normal form. 4/183 useless extension candidates. Maximal degree in co-relation 290. Up to 114 conditions per place. [2025-03-04 15:32:15,997 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 19 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-04 15:32:15,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 124 flow [2025-03-04 15:32:15,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-04 15:32:16,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:32:16,000 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 72 flow. Second operand 3 states and 66 transitions. [2025-03-04 15:32:16,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 124 flow [2025-03-04 15:32:16,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 118 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:16,002 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 76 flow [2025-03-04 15:32:16,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-03-04 15:32:16,003 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2025-03-04 15:32:16,003 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 76 flow [2025-03-04 15:32:16,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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:32:16,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:32:16,004 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-04 15:32:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1905198891, now seen corresponding path program 1 times [2025-03-04 15:32:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422940196] [2025-03-04 15:32:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:16,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:16,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,072 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:32:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422940196] [2025-03-04 15:32:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422940196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049985922] [2025-03-04 15:32:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:16,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:16,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-03-04 15:32:16,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:32:16,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-03-04 15:32:16,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:16,176 INFO L124 PetriNetUnfolderBase]: 61/174 cut-off events. [2025-03-04 15:32:16,176 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-04 15:32:16,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 174 events. 61/174 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 680 event pairs, 6 based on Foata normal form. 13/183 useless extension candidates. Maximal degree in co-relation 284. Up to 60 conditions per place. [2025-03-04 15:32:16,177 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 31 selfloop transitions, 3 changer transitions 3/47 dead transitions. [2025-03-04 15:32:16,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 200 flow [2025-03-04 15:32:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:32:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:32:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-04 15:32:16,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-03-04 15:32:16,181 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 76 flow. Second operand 5 states and 105 transitions. [2025-03-04 15:32:16,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 200 flow [2025-03-04 15:32:16,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:16,182 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 73 flow [2025-03-04 15:32:16,182 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2025-03-04 15:32:16,183 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2025-03-04 15:32:16,183 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 73 flow [2025-03-04 15:32:16,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 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:32:16,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:32:16,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-04 15:32:16,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1906069814, now seen corresponding path program 1 times [2025-03-04 15:32:16,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-03-04 15:32:16,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:16,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:16,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,228 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:32:16,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349513331] [2025-03-04 15:32:16,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349513331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:16,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822698684] [2025-03-04 15:32:16,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:16,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:16,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-03-04 15:32:16,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 73 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:32:16,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-03-04 15:32:16,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:16,279 INFO L124 PetriNetUnfolderBase]: 46/143 cut-off events. [2025-03-04 15:32:16,280 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 15:32:16,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 143 events. 46/143 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 563 event pairs, 11 based on Foata normal form. 1/135 useless extension candidates. Maximal degree in co-relation 272. Up to 81 conditions per place. [2025-03-04 15:32:16,281 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 17 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2025-03-04 15:32:16,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 122 flow [2025-03-04 15:32:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-03-04 15:32:16,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2025-03-04 15:32:16,282 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 73 flow. Second operand 4 states and 69 transitions. [2025-03-04 15:32:16,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 122 flow [2025-03-04 15:32:16,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:16,283 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 68 flow [2025-03-04 15:32:16,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2025-03-04 15:32:16,284 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2025-03-04 15:32:16,284 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 68 flow [2025-03-04 15:32:16,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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:32:16,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:32:16,284 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-04 15:32:16,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1238343015, now seen corresponding path program 1 times [2025-03-04 15:32:16,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953710399] [2025-03-04 15:32:16,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:32:16,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:32:16,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:16,295 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:32:16,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:32:16,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:32:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:16,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:32:16,314 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:32:16,315 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-04 15:32:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-04 15:32:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-04 15:32:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 16 remaining) [2025-03-04 15:32:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-04 15:32:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-04 15:32:16,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-04 15:32:16,317 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-04 15:32:16,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-04 15:32:16,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:32:16,318 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:32:16,320 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:32:16,321 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:32:16,340 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:32:16,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 126 flow [2025-03-04 15:32:16,346 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2025-03-04 15:32:16,346 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:32:16,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 75 events. 3/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 255 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 86. Up to 6 conditions per place. [2025-03-04 15:32:16,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 126 flow [2025-03-04 15:32:16,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 40 transitions, 93 flow [2025-03-04 15:32:16,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:16,348 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;@7063dd32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:16,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 15:32:16,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:16,350 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:32:16,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:16,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,350 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:16,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash -101566366, now seen corresponding path program 1 times [2025-03-04 15:32:16,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587102723] [2025-03-04 15:32:16,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:16,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:16,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,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:32:16,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587102723] [2025-03-04 15:32:16,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587102723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:16,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937359880] [2025-03-04 15:32:16,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:16,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:16,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:16,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-03-04 15:32:16,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:32:16,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-03-04 15:32:16,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:16,631 INFO L124 PetriNetUnfolderBase]: 962/1773 cut-off events. [2025-03-04 15:32:16,631 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-04 15:32:16,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 1773 events. 962/1773 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10442 event pairs, 103 based on Foata normal form. 151/1765 useless extension candidates. Maximal degree in co-relation 2943. Up to 654 conditions per place. [2025-03-04 15:32:16,643 INFO L140 encePairwiseOnDemand]: 45/53 looper letters, 61 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-04 15:32:16,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 84 transitions, 331 flow [2025-03-04 15:32:16,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:16,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2025-03-04 15:32:16,646 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6477987421383647 [2025-03-04 15:32:16,646 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 93 flow. Second operand 6 states and 206 transitions. [2025-03-04 15:32:16,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 84 transitions, 331 flow [2025-03-04 15:32:16,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 84 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:16,648 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 135 flow [2025-03-04 15:32:16,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2025-03-04 15:32:16,648 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2025-03-04 15:32:16,648 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 135 flow [2025-03-04 15:32:16,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:32:16,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:32:16,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:16,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,651 INFO L85 PathProgramCache]: Analyzing trace with hash -101566423, now seen corresponding path program 1 times [2025-03-04 15:32:16,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316161894] [2025-03-04 15:32:16,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:16,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:16,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,685 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:32:16,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316161894] [2025-03-04 15:32:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316161894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:32:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409734785] [2025-03-04 15:32:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:16,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:16,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-03-04 15:32:16,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:32:16,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-03-04 15:32:16,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:16,821 INFO L124 PetriNetUnfolderBase]: 694/1616 cut-off events. [2025-03-04 15:32:16,821 INFO L125 PetriNetUnfolderBase]: For 512/512 co-relation queries the response was YES. [2025-03-04 15:32:16,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 1616 events. 694/1616 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11453 event pairs, 479 based on Foata normal form. 4/1420 useless extension candidates. Maximal degree in co-relation 2344. Up to 1137 conditions per place. [2025-03-04 15:32:16,829 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 30 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-03-04 15:32:16,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 50 transitions, 221 flow [2025-03-04 15:32:16,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:16,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-04 15:32:16,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2025-03-04 15:32:16,831 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 135 flow. Second operand 3 states and 107 transitions. [2025-03-04 15:32:16,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 50 transitions, 221 flow [2025-03-04 15:32:16,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:16,837 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 155 flow [2025-03-04 15:32:16,837 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2025-03-04 15:32:16,838 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 9 predicate places. [2025-03-04 15:32:16,838 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 155 flow [2025-03-04 15:32:16,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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:32:16,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:32:16,838 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:16,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1146410168, now seen corresponding path program 1 times [2025-03-04 15:32:16,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326464492] [2025-03-04 15:32:16,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:16,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:16,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,876 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:32:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326464492] [2025-03-04 15:32:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326464492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388331624] [2025-03-04 15:32:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:16,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:16,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-03-04 15:32:16,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:32:16,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-03-04 15:32:16,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,042 INFO L124 PetriNetUnfolderBase]: 718/1382 cut-off events. [2025-03-04 15:32:17,042 INFO L125 PetriNetUnfolderBase]: For 630/707 co-relation queries the response was YES. [2025-03-04 15:32:17,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3157 conditions, 1382 events. 718/1382 cut-off events. For 630/707 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7789 event pairs, 128 based on Foata normal form. 89/1432 useless extension candidates. Maximal degree in co-relation 3006. Up to 633 conditions per place. [2025-03-04 15:32:17,048 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 61 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-03-04 15:32:17,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 403 flow [2025-03-04 15:32:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 201 transitions. [2025-03-04 15:32:17,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6320754716981132 [2025-03-04 15:32:17,049 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 155 flow. Second operand 6 states and 201 transitions. [2025-03-04 15:32:17,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 403 flow [2025-03-04 15:32:17,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 83 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:17,051 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 171 flow [2025-03-04 15:32:17,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-03-04 15:32:17,052 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2025-03-04 15:32:17,052 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 171 flow [2025-03-04 15:32:17,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 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:32:17,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:32:17,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:17,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1147258251, now seen corresponding path program 1 times [2025-03-04 15:32:17,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529395423] [2025-03-04 15:32:17,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:17,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:17,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529395423] [2025-03-04 15:32:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529395423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:17,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975468440] [2025-03-04 15:32:17,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:17,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:17,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-03-04 15:32:17,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:32:17,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-03-04 15:32:17,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,205 INFO L124 PetriNetUnfolderBase]: 689/1540 cut-off events. [2025-03-04 15:32:17,205 INFO L125 PetriNetUnfolderBase]: For 1254/1254 co-relation queries the response was YES. [2025-03-04 15:32:17,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 1540 events. 689/1540 cut-off events. For 1254/1254 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10481 event pairs, 476 based on Foata normal form. 1/1396 useless extension candidates. Maximal degree in co-relation 2054. Up to 1122 conditions per place. [2025-03-04 15:32:17,213 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 31 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-03-04 15:32:17,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 49 transitions, 257 flow [2025-03-04 15:32:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:17,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2025-03-04 15:32:17,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5377358490566038 [2025-03-04 15:32:17,214 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 171 flow. Second operand 4 states and 114 transitions. [2025-03-04 15:32:17,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 49 transitions, 257 flow [2025-03-04 15:32:17,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 241 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:17,221 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 161 flow [2025-03-04 15:32:17,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2025-03-04 15:32:17,222 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 12 predicate places. [2025-03-04 15:32:17,223 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 161 flow [2025-03-04 15:32:17,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 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:32:17,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,223 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:32:17,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:17,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1297181330, now seen corresponding path program 1 times [2025-03-04 15:32:17,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815904798] [2025-03-04 15:32:17,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:17,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:17,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,257 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:32:17,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815904798] [2025-03-04 15:32:17,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815904798] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:17,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211558997] [2025-03-04 15:32:17,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:17,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:17,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:17,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-03-04 15:32:17,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:32:17,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-03-04 15:32:17,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,378 INFO L124 PetriNetUnfolderBase]: 654/1507 cut-off events. [2025-03-04 15:32:17,379 INFO L125 PetriNetUnfolderBase]: For 701/733 co-relation queries the response was YES. [2025-03-04 15:32:17,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3274 conditions, 1507 events. 654/1507 cut-off events. For 701/733 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 10442 event pairs, 206 based on Foata normal form. 42/1418 useless extension candidates. Maximal degree in co-relation 1911. Up to 765 conditions per place. [2025-03-04 15:32:17,383 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 41 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2025-03-04 15:32:17,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 59 transitions, 317 flow [2025-03-04 15:32:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-04 15:32:17,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6367924528301887 [2025-03-04 15:32:17,384 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 161 flow. Second operand 4 states and 135 transitions. [2025-03-04 15:32:17,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 59 transitions, 317 flow [2025-03-04 15:32:17,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 311 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:17,386 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 157 flow [2025-03-04 15:32:17,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2025-03-04 15:32:17,386 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 11 predicate places. [2025-03-04 15:32:17,386 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 157 flow [2025-03-04 15:32:17,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:32:17,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:32:17,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:17,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1297181611, now seen corresponding path program 1 times [2025-03-04 15:32:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-04 15:32:17,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:17,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:17,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,425 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:32:17,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143801541] [2025-03-04 15:32:17,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143801541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:17,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892596031] [2025-03-04 15:32:17,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:17,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:17,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:17,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-03-04 15:32:17,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 157 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:32:17,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-03-04 15:32:17,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,611 INFO L124 PetriNetUnfolderBase]: 914/1727 cut-off events. [2025-03-04 15:32:17,612 INFO L125 PetriNetUnfolderBase]: For 906/940 co-relation queries the response was YES. [2025-03-04 15:32:17,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4083 conditions, 1727 events. 914/1727 cut-off events. For 906/940 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10367 event pairs, 102 based on Foata normal form. 52/1767 useless extension candidates. Maximal degree in co-relation 2429. Up to 485 conditions per place. [2025-03-04 15:32:17,620 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 61 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2025-03-04 15:32:17,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 85 transitions, 427 flow [2025-03-04 15:32:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 198 transitions. [2025-03-04 15:32:17,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6226415094339622 [2025-03-04 15:32:17,621 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 157 flow. Second operand 6 states and 198 transitions. [2025-03-04 15:32:17,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 85 transitions, 427 flow [2025-03-04 15:32:17,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:17,625 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 214 flow [2025-03-04 15:32:17,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-03-04 15:32:17,626 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2025-03-04 15:32:17,626 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 214 flow [2025-03-04 15:32:17,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:32:17,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,627 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:32:17,627 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:17,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1557915751, now seen corresponding path program 1 times [2025-03-04 15:32:17,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563515533] [2025-03-04 15:32:17,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:17,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:17,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,653 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:32:17,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563515533] [2025-03-04 15:32:17,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563515533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:17,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696577404] [2025-03-04 15:32:17,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:17,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:17,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:17,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-03-04 15:32:17,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:32:17,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-03-04 15:32:17,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,772 INFO L124 PetriNetUnfolderBase]: 734/1651 cut-off events. [2025-03-04 15:32:17,772 INFO L125 PetriNetUnfolderBase]: For 2041/2141 co-relation queries the response was YES. [2025-03-04 15:32:17,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3915 conditions, 1651 events. 734/1651 cut-off events. For 2041/2141 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 11660 event pairs, 153 based on Foata normal form. 40/1618 useless extension candidates. Maximal degree in co-relation 2805. Up to 1060 conditions per place. [2025-03-04 15:32:17,779 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 47 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2025-03-04 15:32:17,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 437 flow [2025-03-04 15:32:17,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 15:32:17,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-03-04 15:32:17,780 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 214 flow. Second operand 4 states and 136 transitions. [2025-03-04 15:32:17,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 437 flow [2025-03-04 15:32:17,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 432 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:17,783 INFO L231 Difference]: Finished difference. Result has 67 places, 47 transitions, 225 flow [2025-03-04 15:32:17,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=225, PETRI_PLACES=67, PETRI_TRANSITIONS=47} [2025-03-04 15:32:17,784 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-04 15:32:17,784 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 47 transitions, 225 flow [2025-03-04 15:32:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 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:32:17,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:32:17,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1557924502, now seen corresponding path program 1 times [2025-03-04 15:32:17,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750390078] [2025-03-04 15:32:17,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:17,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:17,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,820 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:32:17,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750390078] [2025-03-04 15:32:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750390078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:17,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958999981] [2025-03-04 15:32:17,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:17,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:17,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-03-04 15:32:17,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 47 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:32:17,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-03-04 15:32:17,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,999 INFO L124 PetriNetUnfolderBase]: 828/1613 cut-off events. [2025-03-04 15:32:18,000 INFO L125 PetriNetUnfolderBase]: For 1883/1883 co-relation queries the response was YES. [2025-03-04 15:32:18,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 1613 events. 828/1613 cut-off events. For 1883/1883 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9788 event pairs, 180 based on Foata normal form. 52/1653 useless extension candidates. Maximal degree in co-relation 2817. Up to 764 conditions per place. [2025-03-04 15:32:18,006 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 61 selfloop transitions, 7 changer transitions 0/82 dead transitions. [2025-03-04 15:32:18,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 487 flow [2025-03-04 15:32:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-03-04 15:32:18,007 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2025-03-04 15:32:18,007 INFO L175 Difference]: Start difference. First operand has 67 places, 47 transitions, 225 flow. Second operand 6 states and 196 transitions. [2025-03-04 15:32:18,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 487 flow [2025-03-04 15:32:18,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 461 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:18,013 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 222 flow [2025-03-04 15:32:18,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=222, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2025-03-04 15:32:18,014 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2025-03-04 15:32:18,014 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 222 flow [2025-03-04 15:32:18,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 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:32:18,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:32:18,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:18,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1558735843, now seen corresponding path program 1 times [2025-03-04 15:32:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-03-04 15:32:18,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:18,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:18,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:18,044 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:32:18,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:18,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425311211] [2025-03-04 15:32:18,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425311211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:18,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783298662] [2025-03-04 15:32:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:18,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:18,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:18,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:18,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2025-03-04 15:32:18,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:32:18,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:18,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2025-03-04 15:32:18,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:18,244 INFO L124 PetriNetUnfolderBase]: 1364/2747 cut-off events. [2025-03-04 15:32:18,244 INFO L125 PetriNetUnfolderBase]: For 3483/3551 co-relation queries the response was YES. [2025-03-04 15:32:18,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6923 conditions, 2747 events. 1364/2747 cut-off events. For 3483/3551 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 19248 event pairs, 914 based on Foata normal form. 100/2745 useless extension candidates. Maximal degree in co-relation 4121. Up to 1602 conditions per place. [2025-03-04 15:32:18,261 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 62 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2025-03-04 15:32:18,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 79 transitions, 568 flow [2025-03-04 15:32:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-03-04 15:32:18,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6839622641509434 [2025-03-04 15:32:18,263 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 222 flow. Second operand 4 states and 145 transitions. [2025-03-04 15:32:18,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 79 transitions, 568 flow [2025-03-04 15:32:18,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 79 transitions, 539 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:18,271 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 229 flow [2025-03-04 15:32:18,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=229, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2025-03-04 15:32:18,273 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2025-03-04 15:32:18,273 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 229 flow [2025-03-04 15:32:18,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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:32:18,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,273 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:32:18,273 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:18,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1786541218, now seen corresponding path program 1 times [2025-03-04 15:32:18,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857443037] [2025-03-04 15:32:18,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:32:18,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:32:18,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:18,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:32:18,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:32:18,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:32:18,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:18,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:32:18,296 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-04 15:32:18,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-04 15:32:18,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-04 15:32:18,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-04 15:32:18,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-04 15:32:18,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:32:18,297 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,298 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:32:18,298 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:32:18,324 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:32:18,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 182 flow [2025-03-04 15:32:18,333 INFO L124 PetriNetUnfolderBase]: 4/103 cut-off events. [2025-03-04 15:32:18,333 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:32:18,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 103 events. 4/103 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 370 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 120. Up to 8 conditions per place. [2025-03-04 15:32:18,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 182 flow [2025-03-04 15:32:18,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 117 flow [2025-03-04 15:32:18,334 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:18,335 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;@7063dd32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:18,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 15:32:18,336 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:18,336 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:32:18,336 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:18,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,336 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:18,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1873663394, now seen corresponding path program 1 times [2025-03-04 15:32:18,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732055419] [2025-03-04 15:32:18,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:18,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:18,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:18,374 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:32:18,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:18,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732055419] [2025-03-04 15:32:18,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732055419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:18,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:18,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:18,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784853908] [2025-03-04 15:32:18,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:18,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:18,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:18,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:18,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:18,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:32:18,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:18,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:18,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:18,925 INFO L124 PetriNetUnfolderBase]: 6854/10448 cut-off events. [2025-03-04 15:32:18,926 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2025-03-04 15:32:18,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20682 conditions, 10448 events. 6854/10448 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 66414 event pairs, 914 based on Foata normal form. 690/10383 useless extension candidates. Maximal degree in co-relation 13215. Up to 3601 conditions per place. [2025-03-04 15:32:18,956 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 78 selfloop transitions, 9 changer transitions 0/107 dead transitions. [2025-03-04 15:32:18,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 107 transitions, 444 flow [2025-03-04 15:32:18,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 279 transitions. [2025-03-04 15:32:18,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636986301369863 [2025-03-04 15:32:18,958 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 117 flow. Second operand 6 states and 279 transitions. [2025-03-04 15:32:18,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 107 transitions, 444 flow [2025-03-04 15:32:18,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 432 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:18,959 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 179 flow [2025-03-04 15:32:18,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2025-03-04 15:32:18,960 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 7 predicate places. [2025-03-04 15:32:18,960 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 179 flow [2025-03-04 15:32:18,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:32:18,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:32:18,960 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:18,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1873663899, now seen corresponding path program 1 times [2025-03-04 15:32:18,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167359968] [2025-03-04 15:32:18,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:18,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:18,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:18,977 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:32:18,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167359968] [2025-03-04 15:32:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167359968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:32:18,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084749358] [2025-03-04 15:32:18,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:18,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:18,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:18,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:18,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:18,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-03-04 15:32:18,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:32:18,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:18,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-03-04 15:32:18,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:19,468 INFO L124 PetriNetUnfolderBase]: 5199/9942 cut-off events. [2025-03-04 15:32:19,468 INFO L125 PetriNetUnfolderBase]: For 4019/4109 co-relation queries the response was YES. [2025-03-04 15:32:19,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21276 conditions, 9942 events. 5199/9942 cut-off events. For 4019/4109 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 83059 event pairs, 4027 based on Foata normal form. 64/8582 useless extension candidates. Maximal degree in co-relation 12824. Up to 7532 conditions per place. [2025-03-04 15:32:19,518 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 37 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-04 15:32:19,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 279 flow [2025-03-04 15:32:19,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:19,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-03-04 15:32:19,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6575342465753424 [2025-03-04 15:32:19,519 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 179 flow. Second operand 3 states and 144 transitions. [2025-03-04 15:32:19,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 279 flow [2025-03-04 15:32:19,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:19,533 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 199 flow [2025-03-04 15:32:19,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2025-03-04 15:32:19,533 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2025-03-04 15:32:19,533 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 199 flow [2025-03-04 15:32:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:32:19,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:19,533 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:19,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:32:19,534 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:19,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:19,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2045977235, now seen corresponding path program 1 times [2025-03-04 15:32:19,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:19,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192730160] [2025-03-04 15:32:19,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:19,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:19,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:19,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:19,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:19,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:19,563 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:32:19,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:19,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192730160] [2025-03-04 15:32:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192730160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:19,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:19,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:19,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681587702] [2025-03-04 15:32:19,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:19,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:19,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:19,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:19,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:19,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:32:19,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:19,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:19,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:19,940 INFO L124 PetriNetUnfolderBase]: 5448/8477 cut-off events. [2025-03-04 15:32:19,940 INFO L125 PetriNetUnfolderBase]: For 4406/4913 co-relation queries the response was YES. [2025-03-04 15:32:19,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20557 conditions, 8477 events. 5448/8477 cut-off events. For 4406/4913 co-relation queries the response was YES. Maximal size of possible extension queue 459. Compared 53213 event pairs, 1178 based on Foata normal form. 429/8745 useless extension candidates. Maximal degree in co-relation 20444. Up to 4245 conditions per place. [2025-03-04 15:32:19,980 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 77 selfloop transitions, 8 changer transitions 0/105 dead transitions. [2025-03-04 15:32:19,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 105 transitions, 532 flow [2025-03-04 15:32:19,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-03-04 15:32:19,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187214611872146 [2025-03-04 15:32:19,981 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 199 flow. Second operand 6 states and 271 transitions. [2025-03-04 15:32:19,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 105 transitions, 532 flow [2025-03-04 15:32:19,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 105 transitions, 522 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:19,986 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 227 flow [2025-03-04 15:32:19,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2025-03-04 15:32:19,986 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2025-03-04 15:32:19,986 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 227 flow [2025-03-04 15:32:19,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 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:32:19,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:19,986 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:19,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:32:19,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:19,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2046799499, now seen corresponding path program 1 times [2025-03-04 15:32:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686683580] [2025-03-04 15:32:19,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:19,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:19,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:19,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:19,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:19,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:20,010 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:32:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686683580] [2025-03-04 15:32:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686683580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829077779] [2025-03-04 15:32:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:20,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:20,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:20,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-03-04 15:32:20,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:32:20,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:20,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-03-04 15:32:20,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:20,420 INFO L124 PetriNetUnfolderBase]: 5194/9849 cut-off events. [2025-03-04 15:32:20,420 INFO L125 PetriNetUnfolderBase]: For 7065/7155 co-relation queries the response was YES. [2025-03-04 15:32:20,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22827 conditions, 9849 events. 5194/9849 cut-off events. For 7065/7155 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 81516 event pairs, 4024 based on Foata normal form. 61/8660 useless extension candidates. Maximal degree in co-relation 10041. Up to 7517 conditions per place. [2025-03-04 15:32:20,451 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 39 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2025-03-04 15:32:20,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 61 transitions, 329 flow [2025-03-04 15:32:20,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:20,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2025-03-04 15:32:20,452 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5273972602739726 [2025-03-04 15:32:20,452 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 227 flow. Second operand 4 states and 154 transitions. [2025-03-04 15:32:20,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 61 transitions, 329 flow [2025-03-04 15:32:20,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 61 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:20,461 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 222 flow [2025-03-04 15:32:20,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2025-03-04 15:32:20,462 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-04 15:32:20,462 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 222 flow [2025-03-04 15:32:20,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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:32:20,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:20,462 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:20,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:32:20,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:20,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:20,463 INFO L85 PathProgramCache]: Analyzing trace with hash -806255310, now seen corresponding path program 1 times [2025-03-04 15:32:20,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:20,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-04 15:32:20,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:20,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:20,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:20,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:20,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:20,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:20,485 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:32:20,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:20,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867817005] [2025-03-04 15:32:20,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867817005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:20,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:20,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:20,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765427345] [2025-03-04 15:32:20,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:20,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:20,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:20,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:20,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-03-04 15:32:20,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:32:20,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:20,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-03-04 15:32:20,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:20,914 INFO L124 PetriNetUnfolderBase]: 4929/9142 cut-off events. [2025-03-04 15:32:20,915 INFO L125 PetriNetUnfolderBase]: For 5926/6194 co-relation queries the response was YES. [2025-03-04 15:32:20,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20922 conditions, 9142 events. 4929/9142 cut-off events. For 5926/6194 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 74708 event pairs, 1612 based on Foata normal form. 292/8401 useless extension candidates. Maximal degree in co-relation 9182. Up to 4967 conditions per place. [2025-03-04 15:32:20,944 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 56 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2025-03-04 15:32:20,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 452 flow [2025-03-04 15:32:20,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:20,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-04 15:32:20,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636986301369863 [2025-03-04 15:32:20,945 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 222 flow. Second operand 4 states and 186 transitions. [2025-03-04 15:32:20,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 452 flow [2025-03-04 15:32:20,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 78 transitions, 446 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:20,953 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 218 flow [2025-03-04 15:32:20,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2025-03-04 15:32:20,953 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 12 predicate places. [2025-03-04 15:32:20,953 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 218 flow [2025-03-04 15:32:20,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:32:20,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:20,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:20,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:32:20,953 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:20,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:20,954 INFO L85 PathProgramCache]: Analyzing trace with hash -806255253, now seen corresponding path program 1 times [2025-03-04 15:32:20,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:20,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421110838] [2025-03-04 15:32:20,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:20,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:20,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:20,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:20,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:20,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:20,981 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:32:20,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421110838] [2025-03-04 15:32:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421110838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:20,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:20,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267939166] [2025-03-04 15:32:20,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:20,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:20,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:20,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:20,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:20,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:32:20,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:20,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:20,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:21,681 INFO L124 PetriNetUnfolderBase]: 9554/15111 cut-off events. [2025-03-04 15:32:21,681 INFO L125 PetriNetUnfolderBase]: For 9589/9980 co-relation queries the response was YES. [2025-03-04 15:32:21,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37101 conditions, 15111 events. 9554/15111 cut-off events. For 9589/9980 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 107873 event pairs, 1828 based on Foata normal form. 442/15287 useless extension candidates. Maximal degree in co-relation 20374. Up to 5319 conditions per place. [2025-03-04 15:32:21,743 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 83 selfloop transitions, 15 changer transitions 0/117 dead transitions. [2025-03-04 15:32:21,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 117 transitions, 650 flow [2025-03-04 15:32:21,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:21,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2025-03-04 15:32:21,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6187214611872146 [2025-03-04 15:32:21,744 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 218 flow. Second operand 6 states and 271 transitions. [2025-03-04 15:32:21,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 117 transitions, 650 flow [2025-03-04 15:32:21,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 117 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:21,779 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 347 flow [2025-03-04 15:32:21,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2025-03-04 15:32:21,780 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-03-04 15:32:21,780 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 347 flow [2025-03-04 15:32:21,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:32:21,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:21,780 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:21,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:32:21,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:21,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash 775889424, now seen corresponding path program 1 times [2025-03-04 15:32:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:21,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858686591] [2025-03-04 15:32:21,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:21,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:21,805 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:32:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:21,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858686591] [2025-03-04 15:32:21,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858686591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:21,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:21,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:21,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634008108] [2025-03-04 15:32:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:21,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:21,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:21,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:21,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:21,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-03-04 15:32:21,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:32:21,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:21,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-03-04 15:32:21,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:22,638 INFO L124 PetriNetUnfolderBase]: 8084/14663 cut-off events. [2025-03-04 15:32:22,638 INFO L125 PetriNetUnfolderBase]: For 22955/23979 co-relation queries the response was YES. [2025-03-04 15:32:22,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37270 conditions, 14663 events. 8084/14663 cut-off events. For 22955/23979 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 126164 event pairs, 4747 based on Foata normal form. 460/13518 useless extension candidates. Maximal degree in co-relation 22556. Up to 11574 conditions per place. [2025-03-04 15:32:22,688 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 64 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-03-04 15:32:22,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 88 transitions, 620 flow [2025-03-04 15:32:22,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:22,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-03-04 15:32:22,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6404109589041096 [2025-03-04 15:32:22,691 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 347 flow. Second operand 4 states and 187 transitions. [2025-03-04 15:32:22,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 88 transitions, 620 flow [2025-03-04 15:32:22,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:22,713 INFO L231 Difference]: Finished difference. Result has 79 places, 67 transitions, 372 flow [2025-03-04 15:32:22,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=372, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2025-03-04 15:32:22,713 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 22 predicate places. [2025-03-04 15:32:22,713 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 67 transitions, 372 flow [2025-03-04 15:32:22,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 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:32:22,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:22,714 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:22,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:32:22,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:22,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash 775891224, now seen corresponding path program 1 times [2025-03-04 15:32:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:22,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792507556] [2025-03-04 15:32:22,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:22,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:22,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:22,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:22,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:22,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:22,738 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:32:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792507556] [2025-03-04 15:32:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792507556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:22,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:22,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815437365] [2025-03-04 15:32:22,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:22,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:22,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:22,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:22,761 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:22,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 372 flow. Second operand has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:32:22,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:22,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:22,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:23,468 INFO L124 PetriNetUnfolderBase]: 9089/14462 cut-off events. [2025-03-04 15:32:23,468 INFO L125 PetriNetUnfolderBase]: For 20782/21509 co-relation queries the response was YES. [2025-03-04 15:32:23,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40309 conditions, 14462 events. 9089/14462 cut-off events. For 20782/21509 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 103981 event pairs, 2686 based on Foata normal form. 546/14755 useless extension candidates. Maximal degree in co-relation 22355. Up to 7322 conditions per place. [2025-03-04 15:32:23,523 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 87 selfloop transitions, 11 changer transitions 0/117 dead transitions. [2025-03-04 15:32:23,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 778 flow [2025-03-04 15:32:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2025-03-04 15:32:23,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6073059360730594 [2025-03-04 15:32:23,524 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 372 flow. Second operand 6 states and 266 transitions. [2025-03-04 15:32:23,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 778 flow [2025-03-04 15:32:23,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 117 transitions, 750 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:23,586 INFO L231 Difference]: Finished difference. Result has 81 places, 66 transitions, 375 flow [2025-03-04 15:32:23,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=81, PETRI_TRANSITIONS=66} [2025-03-04 15:32:23,587 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2025-03-04 15:32:23,587 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 66 transitions, 375 flow [2025-03-04 15:32:23,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.8) internal successors, (164), 5 states have internal predecessors, (164), 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:32:23,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:23,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:23,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:32:23,587 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:23,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:23,587 INFO L85 PathProgramCache]: Analyzing trace with hash 776697599, now seen corresponding path program 1 times [2025-03-04 15:32:23,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:23,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483171215] [2025-03-04 15:32:23,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:23,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:23,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:23,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:23,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:23,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:23,609 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:32:23,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:23,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483171215] [2025-03-04 15:32:23,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483171215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:23,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:23,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:23,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481692284] [2025-03-04 15:32:23,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:23,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:23,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:23,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:23,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 73 [2025-03-04 15:32:23,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 66 transitions, 375 flow. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:32:23,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:23,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 73 [2025-03-04 15:32:23,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:24,911 INFO L124 PetriNetUnfolderBase]: 14083/24654 cut-off events. [2025-03-04 15:32:24,912 INFO L125 PetriNetUnfolderBase]: For 39465/41401 co-relation queries the response was YES. [2025-03-04 15:32:24,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62773 conditions, 24654 events. 14083/24654 cut-off events. For 39465/41401 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 216063 event pairs, 9207 based on Foata normal form. 1230/23975 useless extension candidates. Maximal degree in co-relation 27140. Up to 14727 conditions per place. [2025-03-04 15:32:25,031 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 103 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2025-03-04 15:32:25,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 125 transitions, 1049 flow [2025-03-04 15:32:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-04 15:32:25,032 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6815068493150684 [2025-03-04 15:32:25,032 INFO L175 Difference]: Start difference. First operand has 81 places, 66 transitions, 375 flow. Second operand 4 states and 199 transitions. [2025-03-04 15:32:25,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 125 transitions, 1049 flow [2025-03-04 15:32:25,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 125 transitions, 1035 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:25,113 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 391 flow [2025-03-04 15:32:25,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2025-03-04 15:32:25,114 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 27 predicate places. [2025-03-04 15:32:25,114 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 391 flow [2025-03-04 15:32:25,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 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:32:25,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:25,114 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:25,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:32:25,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:25,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1631004648, now seen corresponding path program 1 times [2025-03-04 15:32:25,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377546316] [2025-03-04 15:32:25,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:25,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:25,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:25,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:25,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:25,166 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:32:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377546316] [2025-03-04 15:32:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377546316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252234347] [2025-03-04 15:32:25,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:25,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:32:25,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:25,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:32:25,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:32:25,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-03-04 15:32:25,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 68 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 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:32:25,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:25,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-03-04 15:32:25,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:26,803 INFO L124 PetriNetUnfolderBase]: 16754/25448 cut-off events. [2025-03-04 15:32:26,803 INFO L125 PetriNetUnfolderBase]: For 42426/44788 co-relation queries the response was YES. [2025-03-04 15:32:26,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74964 conditions, 25448 events. 16754/25448 cut-off events. For 42426/44788 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 185005 event pairs, 2800 based on Foata normal form. 500/25597 useless extension candidates. Maximal degree in co-relation 74308. Up to 8407 conditions per place. [2025-03-04 15:32:26,921 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 165 selfloop transitions, 26 changer transitions 0/208 dead transitions. [2025-03-04 15:32:26,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 208 transitions, 1393 flow [2025-03-04 15:32:26,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:32:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:32:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2025-03-04 15:32:26,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095890410958904 [2025-03-04 15:32:26,922 INFO L175 Difference]: Start difference. First operand has 84 places, 68 transitions, 391 flow. Second operand 10 states and 445 transitions. [2025-03-04 15:32:26,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 208 transitions, 1393 flow [2025-03-04 15:32:27,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 208 transitions, 1377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:27,053 INFO L231 Difference]: Finished difference. Result has 95 places, 79 transitions, 549 flow [2025-03-04 15:32:27,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=549, PETRI_PLACES=95, PETRI_TRANSITIONS=79} [2025-03-04 15:32:27,053 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 38 predicate places. [2025-03-04 15:32:27,053 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 79 transitions, 549 flow [2025-03-04 15:32:27,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 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:32:27,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:27,053 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:27,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:32:27,053 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:27,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash -938241650, now seen corresponding path program 1 times [2025-03-04 15:32:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-03-04 15:32:27,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:27,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:27,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:27,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:27,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:27,250 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:32:27,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041867425] [2025-03-04 15:32:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041867425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959392792] [2025-03-04 15:32:27,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:27,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:32:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:27,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:32:27,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:32:27,288 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-03-04 15:32:27,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 79 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 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:32:27,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:27,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-03-04 15:32:27,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:28,741 INFO L124 PetriNetUnfolderBase]: 17543/26958 cut-off events. [2025-03-04 15:32:28,741 INFO L125 PetriNetUnfolderBase]: For 61339/63749 co-relation queries the response was YES. [2025-03-04 15:32:28,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83296 conditions, 26958 events. 17543/26958 cut-off events. For 61339/63749 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 201095 event pairs, 3028 based on Foata normal form. 342/27063 useless extension candidates. Maximal degree in co-relation 63392. Up to 9478 conditions per place. [2025-03-04 15:32:28,858 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 168 selfloop transitions, 31 changer transitions 0/216 dead transitions. [2025-03-04 15:32:28,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 216 transitions, 1566 flow [2025-03-04 15:32:28,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:32:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:32:28,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 444 transitions. [2025-03-04 15:32:28,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6082191780821918 [2025-03-04 15:32:28,859 INFO L175 Difference]: Start difference. First operand has 95 places, 79 transitions, 549 flow. Second operand 10 states and 444 transitions. [2025-03-04 15:32:28,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 216 transitions, 1566 flow [2025-03-04 15:32:29,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 216 transitions, 1501 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-03-04 15:32:29,356 INFO L231 Difference]: Finished difference. Result has 102 places, 89 transitions, 667 flow [2025-03-04 15:32:29,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=667, PETRI_PLACES=102, PETRI_TRANSITIONS=89} [2025-03-04 15:32:29,357 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 45 predicate places. [2025-03-04 15:32:29,357 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 667 flow [2025-03-04 15:32:29,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 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:32:29,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:29,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:29,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:32:29,357 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:29,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1609675694, now seen corresponding path program 1 times [2025-03-04 15:32:29,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:29,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846618046] [2025-03-04 15:32:29,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:29,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:29,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:29,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:29,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:29,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:32:29,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:29,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846618046] [2025-03-04 15:32:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846618046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:29,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:29,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:32:29,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908436146] [2025-03-04 15:32:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:29,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:29,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:29,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:29,414 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-03-04 15:32:29,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 667 flow. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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:32:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-03-04 15:32:29,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:31,077 INFO L124 PetriNetUnfolderBase]: 14009/25350 cut-off events. [2025-03-04 15:32:31,077 INFO L125 PetriNetUnfolderBase]: For 66554/67420 co-relation queries the response was YES. [2025-03-04 15:32:31,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76036 conditions, 25350 events. 14009/25350 cut-off events. For 66554/67420 co-relation queries the response was YES. Maximal size of possible extension queue 1352. Compared 233620 event pairs, 8715 based on Foata normal form. 184/24095 useless extension candidates. Maximal degree in co-relation 62953. Up to 19742 conditions per place. [2025-03-04 15:32:31,266 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 76 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-03-04 15:32:31,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 994 flow [2025-03-04 15:32:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:32:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:32:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 192 transitions. [2025-03-04 15:32:31,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5260273972602739 [2025-03-04 15:32:31,267 INFO L175 Difference]: Start difference. First operand has 102 places, 89 transitions, 667 flow. Second operand 5 states and 192 transitions. [2025-03-04 15:32:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 109 transitions, 994 flow [2025-03-04 15:32:32,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 109 transitions, 915 flow, removed 13 selfloop flow, removed 5 redundant places. [2025-03-04 15:32:32,023 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 606 flow [2025-03-04 15:32:32,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=97, 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=5, PETRI_FLOW=606, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2025-03-04 15:32:32,023 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 44 predicate places. [2025-03-04 15:32:32,023 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 606 flow [2025-03-04 15:32:32,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 5 states have internal predecessors, (162), 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:32:32,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:32,024 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:32,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:32:32,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:32,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:32,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2049727765, now seen corresponding path program 1 times [2025-03-04 15:32:32,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843603385] [2025-03-04 15:32:32,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:32,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:32:32,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:32:32,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:32,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:32,058 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:32:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843603385] [2025-03-04 15:32:32,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843603385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:32,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:32,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:32,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885248092] [2025-03-04 15:32:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:32,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:32:32,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:32,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:32:32,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:32:32,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-03-04 15:32:32,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 606 flow. Second operand has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 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:32:32,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:32,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-03-04 15:32:32,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:33,503 INFO L124 PetriNetUnfolderBase]: 17023/26080 cut-off events. [2025-03-04 15:32:33,503 INFO L125 PetriNetUnfolderBase]: For 63291/65834 co-relation queries the response was YES. [2025-03-04 15:32:33,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81255 conditions, 26080 events. 17023/26080 cut-off events. For 63291/65834 co-relation queries the response was YES. Maximal size of possible extension queue 1356. Compared 194491 event pairs, 3044 based on Foata normal form. 406/26281 useless extension candidates. Maximal degree in co-relation 81086. Up to 7325 conditions per place. [2025-03-04 15:32:33,678 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 203 selfloop transitions, 29 changer transitions 0/249 dead transitions. [2025-03-04 15:32:33,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 249 transitions, 1783 flow [2025-03-04 15:32:33,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:32:33,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:32:33,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 531 transitions. [2025-03-04 15:32:33,679 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061643835616438 [2025-03-04 15:32:33,680 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 606 flow. Second operand 12 states and 531 transitions. [2025-03-04 15:32:33,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 249 transitions, 1783 flow [2025-03-04 15:32:34,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 249 transitions, 1757 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:34,125 INFO L231 Difference]: Finished difference. Result has 108 places, 93 transitions, 711 flow [2025-03-04 15:32:34,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=711, PETRI_PLACES=108, PETRI_TRANSITIONS=93} [2025-03-04 15:32:34,125 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places. [2025-03-04 15:32:34,125 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 93 transitions, 711 flow [2025-03-04 15:32:34,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.714285714285715) internal successors, (215), 7 states have internal predecessors, (215), 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:32:34,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:34,125 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:34,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:32:34,125 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:34,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash -681761441, now seen corresponding path program 1 times [2025-03-04 15:32:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:34,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995907829] [2025-03-04 15:32:34,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:34,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:34,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:32:34,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:32:34,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:34,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:34,157 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:32:34,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:34,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995907829] [2025-03-04 15:32:34,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995907829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:34,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:34,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:34,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93646670] [2025-03-04 15:32:34,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:34,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:34,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:34,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:34,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:34,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:34,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 93 transitions, 711 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:32:34,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:34,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:34,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:36,411 INFO L124 PetriNetUnfolderBase]: 22450/36092 cut-off events. [2025-03-04 15:32:36,411 INFO L125 PetriNetUnfolderBase]: For 89341/92498 co-relation queries the response was YES. [2025-03-04 15:32:36,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109241 conditions, 36092 events. 22450/36092 cut-off events. For 89341/92498 co-relation queries the response was YES. Maximal size of possible extension queue 1976. Compared 303016 event pairs, 4894 based on Foata normal form. 741/36527 useless extension candidates. Maximal degree in co-relation 88938. Up to 13479 conditions per place. [2025-03-04 15:32:36,649 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 119 selfloop transitions, 28 changer transitions 0/177 dead transitions. [2025-03-04 15:32:36,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 177 transitions, 1548 flow [2025-03-04 15:32:36,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:36,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:36,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2025-03-04 15:32:36,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6141552511415526 [2025-03-04 15:32:36,651 INFO L175 Difference]: Start difference. First operand has 108 places, 93 transitions, 711 flow. Second operand 6 states and 269 transitions. [2025-03-04 15:32:36,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 177 transitions, 1548 flow [2025-03-04 15:32:37,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 177 transitions, 1460 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-03-04 15:32:37,603 INFO L231 Difference]: Finished difference. Result has 111 places, 113 transitions, 980 flow [2025-03-04 15:32:37,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=111, PETRI_TRANSITIONS=113} [2025-03-04 15:32:37,604 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 54 predicate places. [2025-03-04 15:32:37,604 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 113 transitions, 980 flow [2025-03-04 15:32:37,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:32:37,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:37,604 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:37,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 15:32:37,604 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:37,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:37,604 INFO L85 PathProgramCache]: Analyzing trace with hash 979280227, now seen corresponding path program 1 times [2025-03-04 15:32:37,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:37,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171938097] [2025-03-04 15:32:37,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:37,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:32:37,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:32:37,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:37,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:37,648 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:32:37,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:37,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171938097] [2025-03-04 15:32:37,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171938097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:37,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:37,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:37,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352626455] [2025-03-04 15:32:37,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:37,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:32:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:37,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:32:37,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:32:37,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-03-04 15:32:37,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 113 transitions, 980 flow. Second operand has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 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:32:37,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:37,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-03-04 15:32:37,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:39,944 INFO L124 PetriNetUnfolderBase]: 22670/36163 cut-off events. [2025-03-04 15:32:39,944 INFO L125 PetriNetUnfolderBase]: For 98776/102582 co-relation queries the response was YES. [2025-03-04 15:32:40,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115341 conditions, 36163 events. 22670/36163 cut-off events. For 98776/102582 co-relation queries the response was YES. Maximal size of possible extension queue 1958. Compared 300113 event pairs, 4330 based on Foata normal form. 794/36705 useless extension candidates. Maximal degree in co-relation 115164. Up to 9984 conditions per place. [2025-03-04 15:32:40,131 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 214 selfloop transitions, 39 changer transitions 0/271 dead transitions. [2025-03-04 15:32:40,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 271 transitions, 2207 flow [2025-03-04 15:32:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:32:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:32:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 531 transitions. [2025-03-04 15:32:40,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061643835616438 [2025-03-04 15:32:40,133 INFO L175 Difference]: Start difference. First operand has 111 places, 113 transitions, 980 flow. Second operand 12 states and 531 transitions. [2025-03-04 15:32:40,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 271 transitions, 2207 flow [2025-03-04 15:32:40,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 271 transitions, 2206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:40,776 INFO L231 Difference]: Finished difference. Result has 121 places, 116 transitions, 1112 flow [2025-03-04 15:32:40,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1112, PETRI_PLACES=121, PETRI_TRANSITIONS=116} [2025-03-04 15:32:40,777 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 64 predicate places. [2025-03-04 15:32:40,777 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 116 transitions, 1112 flow [2025-03-04 15:32:40,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 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:32:40,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:40,777 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:40,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 15:32:40,777 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:40,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:40,777 INFO L85 PathProgramCache]: Analyzing trace with hash 340223356, now seen corresponding path program 1 times [2025-03-04 15:32:40,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:40,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313395791] [2025-03-04 15:32:40,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:40,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:40,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:32:40,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:32:40,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:40,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:40,805 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:32:40,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:40,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313395791] [2025-03-04 15:32:40,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313395791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:40,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:40,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:32:40,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790428148] [2025-03-04 15:32:40,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:40,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:40,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:40,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:40,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:40,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-03-04 15:32:40,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 116 transitions, 1112 flow. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:32:40,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:40,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-03-04 15:32:40,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:43,227 INFO L124 PetriNetUnfolderBase]: 18857/34453 cut-off events. [2025-03-04 15:32:43,227 INFO L125 PetriNetUnfolderBase]: For 118930/123497 co-relation queries the response was YES. [2025-03-04 15:32:43,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103053 conditions, 34453 events. 18857/34453 cut-off events. For 118930/123497 co-relation queries the response was YES. Maximal size of possible extension queue 1836. Compared 335511 event pairs, 4963 based on Foata normal form. 1698/35580 useless extension candidates. Maximal degree in co-relation 87554. Up to 24081 conditions per place. [2025-03-04 15:32:43,402 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 145 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2025-03-04 15:32:43,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 181 transitions, 2221 flow [2025-03-04 15:32:43,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2025-03-04 15:32:43,403 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5342465753424658 [2025-03-04 15:32:43,403 INFO L175 Difference]: Start difference. First operand has 121 places, 116 transitions, 1112 flow. Second operand 4 states and 156 transitions. [2025-03-04 15:32:43,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 181 transitions, 2221 flow [2025-03-04 15:32:43,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 181 transitions, 2071 flow, removed 22 selfloop flow, removed 9 redundant places. [2025-03-04 15:32:43,629 INFO L231 Difference]: Finished difference. Result has 115 places, 116 transitions, 1044 flow [2025-03-04 15:32:43,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1044, PETRI_PLACES=115, PETRI_TRANSITIONS=116} [2025-03-04 15:32:43,629 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 58 predicate places. [2025-03-04 15:32:43,629 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 116 transitions, 1044 flow [2025-03-04 15:32:43,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 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:32:43,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:43,629 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:43,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 15:32:43,630 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:43,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:43,630 INFO L85 PathProgramCache]: Analyzing trace with hash 340232107, now seen corresponding path program 1 times [2025-03-04 15:32:43,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:43,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474815115] [2025-03-04 15:32:43,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:43,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:43,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:32:43,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:32:43,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:43,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:43,654 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:32:43,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:43,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474815115] [2025-03-04 15:32:43,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474815115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:43,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:43,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798560860] [2025-03-04 15:32:43,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:43,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:43,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:43,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:43,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:43,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:43,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 116 transitions, 1044 flow. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:32:43,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:43,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:43,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:45,911 INFO L124 PetriNetUnfolderBase]: 21098/34335 cut-off events. [2025-03-04 15:32:45,911 INFO L125 PetriNetUnfolderBase]: For 96356/98537 co-relation queries the response was YES. [2025-03-04 15:32:46,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111302 conditions, 34335 events. 21098/34335 cut-off events. For 96356/98537 co-relation queries the response was YES. Maximal size of possible extension queue 1904. Compared 291996 event pairs, 6946 based on Foata normal form. 703/34695 useless extension candidates. Maximal degree in co-relation 93554. Up to 16379 conditions per place. [2025-03-04 15:32:46,098 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 129 selfloop transitions, 15 changer transitions 0/172 dead transitions. [2025-03-04 15:32:46,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 172 transitions, 1658 flow [2025-03-04 15:32:46,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:46,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-03-04 15:32:46,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6027397260273972 [2025-03-04 15:32:46,099 INFO L175 Difference]: Start difference. First operand has 115 places, 116 transitions, 1044 flow. Second operand 6 states and 264 transitions. [2025-03-04 15:32:46,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 172 transitions, 1658 flow [2025-03-04 15:32:46,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 172 transitions, 1637 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:46,818 INFO L231 Difference]: Finished difference. Result has 117 places, 115 transitions, 1057 flow [2025-03-04 15:32:46,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1057, PETRI_PLACES=117, PETRI_TRANSITIONS=115} [2025-03-04 15:32:46,818 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 60 predicate places. [2025-03-04 15:32:46,818 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 115 transitions, 1057 flow [2025-03-04 15:32:46,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 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:32:46,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:46,819 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:46,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 15:32:46,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash 537141350, now seen corresponding path program 1 times [2025-03-04 15:32:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:46,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767839167] [2025-03-04 15:32:46,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:46,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:46,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:32:46,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:32:46,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:46,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:46,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:32:46,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:32:46,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:32:46,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:46,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:32:46,832 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:32:46,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-03-04 15:32:46,833 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-03-04 15:32:46,834 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-03-04 15:32:46,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 15:32:46,834 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:46,834 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:32:46,834 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 15:32:46,857 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:32:46,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 93 transitions, 242 flow [2025-03-04 15:32:46,864 INFO L124 PetriNetUnfolderBase]: 5/131 cut-off events. [2025-03-04 15:32:46,865 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:32:46,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 131 events. 5/131 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 487 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 155. Up to 10 conditions per place. [2025-03-04 15:32:46,865 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 93 transitions, 242 flow [2025-03-04 15:32:46,865 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 56 transitions, 143 flow [2025-03-04 15:32:46,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:46,866 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;@7063dd32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:46,866 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-03-04 15:32:46,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:46,867 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:32:46,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:46,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:46,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:46,868 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-03-04 15:32:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1811079534, now seen corresponding path program 1 times [2025-03-04 15:32:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35750669] [2025-03-04 15:32:46,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:46,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:46,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:46,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:46,888 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:32:46,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:46,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35750669] [2025-03-04 15:32:46,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35750669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:46,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:46,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980922794] [2025-03-04 15:32:46,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:46,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:46,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:46,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:46,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 93 [2025-03-04 15:32:46,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:32:46,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:46,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 93 [2025-03-04 15:32:46,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:48,943 INFO L124 PetriNetUnfolderBase]: 39926/54546 cut-off events. [2025-03-04 15:32:48,943 INFO L125 PetriNetUnfolderBase]: For 2575/2575 co-relation queries the response was YES. [2025-03-04 15:32:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109765 conditions, 54546 events. 39926/54546 cut-off events. For 2575/2575 co-relation queries the response was YES. Maximal size of possible extension queue 2281. Compared 349411 event pairs, 7002 based on Foata normal form. 2958/54383 useless extension candidates. Maximal degree in co-relation 49657. Up to 21801 conditions per place. [2025-03-04 15:32:49,301 INFO L140 encePairwiseOnDemand]: 83/93 looper letters, 91 selfloop transitions, 11 changer transitions 0/126 dead transitions. [2025-03-04 15:32:49,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 126 transitions, 549 flow [2025-03-04 15:32:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 348 transitions. [2025-03-04 15:32:49,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2025-03-04 15:32:49,302 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 143 flow. Second operand 6 states and 348 transitions. [2025-03-04 15:32:49,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 126 transitions, 549 flow [2025-03-04 15:32:49,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 126 transitions, 521 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:49,304 INFO L231 Difference]: Finished difference. Result has 74 places, 64 transitions, 217 flow [2025-03-04 15:32:49,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2025-03-04 15:32:49,305 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 7 predicate places. [2025-03-04 15:32:49,305 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 217 flow [2025-03-04 15:32:49,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:32:49,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:49,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:49,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 15:32:49,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-03-04 15:32:49,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:49,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1811079477, now seen corresponding path program 1 times [2025-03-04 15:32:49,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:49,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262205390] [2025-03-04 15:32:49,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:49,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:49,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:49,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:49,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:49,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:49,315 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:32:49,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262205390] [2025-03-04 15:32:49,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262205390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:49,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:49,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:32:49,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077759168] [2025-03-04 15:32:49,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:49,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:49,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:49,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:49,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:49,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 93 [2025-03-04 15:32:49,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:32:49,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:49,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 93 [2025-03-04 15:32:49,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:51,583 INFO L124 PetriNetUnfolderBase]: 31609/53521 cut-off events. [2025-03-04 15:32:51,583 INFO L125 PetriNetUnfolderBase]: For 26627/28583 co-relation queries the response was YES. [2025-03-04 15:32:51,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117775 conditions, 53521 events. 31609/53521 cut-off events. For 26627/28583 co-relation queries the response was YES. Maximal size of possible extension queue 2618. Compared 495098 event pairs, 25123 based on Foata normal form. 796/46947 useless extension candidates. Maximal degree in co-relation 65511. Up to 42282 conditions per place. [2025-03-04 15:32:51,995 INFO L140 encePairwiseOnDemand]: 88/93 looper letters, 43 selfloop transitions, 3 changer transitions 0/71 dead transitions. [2025-03-04 15:32:51,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 329 flow [2025-03-04 15:32:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:51,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-03-04 15:32:51,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6487455197132617 [2025-03-04 15:32:51,996 INFO L175 Difference]: Start difference. First operand has 74 places, 64 transitions, 217 flow. Second operand 3 states and 181 transitions. [2025-03-04 15:32:51,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 329 flow [2025-03-04 15:32:52,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 71 transitions, 328 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:52,018 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 237 flow [2025-03-04 15:32:52,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-03-04 15:32:52,018 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 9 predicate places. [2025-03-04 15:32:52,018 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 237 flow [2025-03-04 15:32:52,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:32:52,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:52,018 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:52,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 15:32:52,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-03-04 15:32:52,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash 308891090, now seen corresponding path program 1 times [2025-03-04 15:32:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:52,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267115298] [2025-03-04 15:32:52,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:52,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:52,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:52,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:52,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:52,038 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:32:52,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:52,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267115298] [2025-03-04 15:32:52,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267115298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:52,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:52,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061194568] [2025-03-04 15:32:52,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:52,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:52,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:52,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:52,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:52,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 93 [2025-03-04 15:32:52,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:32:52,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:52,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 93 [2025-03-04 15:32:52,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:53,924 INFO L124 PetriNetUnfolderBase]: 32732/44927 cut-off events. [2025-03-04 15:32:53,924 INFO L125 PetriNetUnfolderBase]: For 26306/28293 co-relation queries the response was YES. [2025-03-04 15:32:53,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113440 conditions, 44927 events. 32732/44927 cut-off events. For 26306/28293 co-relation queries the response was YES. Maximal size of possible extension queue 1928. Compared 285494 event pairs, 8114 based on Foata normal form. 1441/45770 useless extension candidates. Maximal degree in co-relation 113289. Up to 23569 conditions per place. [2025-03-04 15:32:54,096 INFO L140 encePairwiseOnDemand]: 84/93 looper letters, 90 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2025-03-04 15:32:54,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 641 flow [2025-03-04 15:32:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 339 transitions. [2025-03-04 15:32:54,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6075268817204301 [2025-03-04 15:32:54,097 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 237 flow. Second operand 6 states and 339 transitions. [2025-03-04 15:32:54,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 641 flow [2025-03-04 15:32:54,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 124 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:54,104 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 277 flow [2025-03-04 15:32:54,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=93, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2025-03-04 15:32:54,105 INFO L279 CegarLoopForPetriNet]: 67 programPoint places, 12 predicate places. [2025-03-04 15:32:54,105 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 277 flow [2025-03-04 15:32:54,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.2) internal successors, (206), 5 states have internal predecessors, (206), 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:32:54,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:54,105 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:54,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-04 15:32:54,105 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 31 more)] === [2025-03-04 15:32:54,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash 309726262, now seen corresponding path program 1 times [2025-03-04 15:32:54,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:54,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109850299] [2025-03-04 15:32:54,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:54,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:54,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:54,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:54,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:54,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:54,120 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:32:54,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:54,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109850299] [2025-03-04 15:32:54,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109850299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:54,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:54,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:54,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982542300] [2025-03-04 15:32:54,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:54,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:54,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:54,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:54,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:54,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 93 [2025-03-04 15:32:54,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 states have internal predecessors, (163), 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:32:54,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:54,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 93 [2025-03-04 15:32:54,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand