./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/unwind3-nondet.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-nondet.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 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:32:13,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:32:13,596 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:13,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:32:13,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:32:13,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:32:13,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:32:13,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:32:13,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:32:13,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:32:13,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:32:13,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:32:13,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:32:13,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:32:13,629 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:32:13,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:32:13,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:32:13,631 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:32:13,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:32:13,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:32:13,631 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:32:13,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:32:13,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:32:13,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:32:13,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:32:13,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:32:13,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:32:13,632 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 -> 2d10f4791070edb44c97ab9948c6a47d7a3edd4f9cb75d429f64896be7b2f789 [2025-03-04 15:32:13,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:32:13,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:32:13,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:32:13,847 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:32:13,847 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:32:13,849 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-03-04 15:32:14,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa14d119/af8f5ea42d9942a78b71f72915b32162/FLAG80d72ca49 [2025-03-04 15:32:15,223 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:32:15,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/unwind3-nondet.i [2025-03-04 15:32:15,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa14d119/af8f5ea42d9942a78b71f72915b32162/FLAG80d72ca49 [2025-03-04 15:32:15,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fa14d119/af8f5ea42d9942a78b71f72915b32162 [2025-03-04 15:32:15,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:32:15,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:32:15,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:32:15,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:32:15,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:32:15,250 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:32:15" (1/1) ... [2025-03-04 15:32:15,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e7609d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:15, skipping insertion in model container [2025-03-04 15:32:15,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:32:15" (1/1) ... [2025-03-04 15:32:15,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:32:15,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:32:15,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:32:15,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:32:15,513 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:32:15,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:15 WrapperNode [2025-03-04 15:32:15,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:32:15,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:32:15,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:32:15,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:32:15,517 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:15" (1/1) ... [2025-03-04 15:32:15,524 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:15" (1/1) ... [2025-03-04 15:32:15,535 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-03-04 15:32:15,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:32:15,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:32:15,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:32:15,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:32:15,541 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:15" (1/1) ... [2025-03-04 15:32:15,541 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:15" (1/1) ... [2025-03-04 15:32:15,544 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:15" (1/1) ... [2025-03-04 15:32:15,555 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:15,556 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:15" (1/1) ... [2025-03-04 15:32:15,556 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:15" (1/1) ... [2025-03-04 15:32:15,559 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:15" (1/1) ... [2025-03-04 15:32:15,559 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:15" (1/1) ... [2025-03-04 15:32:15,560 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:15" (1/1) ... [2025-03-04 15:32:15,560 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:15" (1/1) ... [2025-03-04 15:32:15,562 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:32:15,562 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:32:15,562 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:32:15,562 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:32:15,563 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:15" (1/1) ... [2025-03-04 15:32:15,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:32:15,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:15,583 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:15,584 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:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:32:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-04 15:32:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-04 15:32:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-04 15:32:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-04 15:32:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:32:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:32:15,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:32:15,601 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,686 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:32:15,688 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:32:15,837 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:32:15,837 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:32:15,912 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:32:15,913 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:32:15,913 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,913 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:32:15,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:32:15,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:32:15,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:32:15,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:32:15" (1/3) ... [2025-03-04 15:32:15,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc65d38 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,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:32:15" (2/3) ... [2025-03-04 15:32:15,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cc65d38 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,921 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,922 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2025-03-04 15:32:15,933 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:32:15,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-nondet.i that has 3 procedures, 32 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:32:15,934 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:32:15,973 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:32:16,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 74 flow [2025-03-04 15:32:16,026 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2025-03-04 15:32:16,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:16,029 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:16,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 74 flow [2025-03-04 15:32:16,031 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 32 transitions, 71 flow [2025-03-04 15:32:16,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:16,049 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;@3c4d64f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:16,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 15:32:16,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:16,055 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:32:16,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:16,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,056 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:16,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,061 INFO L85 PathProgramCache]: Analyzing trace with hash -255007104, now seen corresponding path program 1 times [2025-03-04 15:32:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626015778] [2025-03-04 15:32:16,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:16,147 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,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,296 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,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626015778] [2025-03-04 15:32:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626015778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:16,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638468479] [2025-03-04 15:32:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:32:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:32:16,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:32:16,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-04 15:32:16,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-04 15:32:16,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:16,584 INFO L124 PetriNetUnfolderBase]: 108/266 cut-off events. [2025-03-04 15:32:16,584 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:32:16,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 266 events. 108/266 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1248 event pairs, 23 based on Foata normal form. 20/258 useless extension candidates. Maximal degree in co-relation 431. Up to 82 conditions per place. [2025-03-04 15:32:16,587 INFO L140 encePairwiseOnDemand]: 21/33 looper letters, 46 selfloop transitions, 12 changer transitions 2/69 dead transitions. [2025-03-04 15:32:16,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 274 flow [2025-03-04 15:32:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:32:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:32:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 156 transitions. [2025-03-04 15:32:16,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2025-03-04 15:32:16,596 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 71 flow. Second operand 9 states and 156 transitions. [2025-03-04 15:32:16,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 274 flow [2025-03-04 15:32:16,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:16,601 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 142 flow [2025-03-04 15:32:16,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-04 15:32:16,605 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 11 predicate places. [2025-03-04 15:32:16,606 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 142 flow [2025-03-04 15:32:16,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,607 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:32:16,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash 684714539, now seen corresponding path program 1 times [2025-03-04 15:32:16,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342390119] [2025-03-04 15:32:16,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:16,629 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,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,686 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,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342390119] [2025-03-04 15:32:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342390119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:16,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384939293] [2025-03-04 15:32:16,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:16,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:16,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2025-03-04 15:32:16,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 142 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,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2025-03-04 15:32:16,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:16,797 INFO L124 PetriNetUnfolderBase]: 72/200 cut-off events. [2025-03-04 15:32:16,798 INFO L125 PetriNetUnfolderBase]: For 86/89 co-relation queries the response was YES. [2025-03-04 15:32:16,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 200 events. 72/200 cut-off events. For 86/89 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 829 event pairs, 10 based on Foata normal form. 28/220 useless extension candidates. Maximal degree in co-relation 377. Up to 74 conditions per place. [2025-03-04 15:32:16,799 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 35 selfloop transitions, 5 changer transitions 3/55 dead transitions. [2025-03-04 15:32:16,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 269 flow [2025-03-04 15:32:16,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:32:16,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:32:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-04 15:32:16,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2025-03-04 15:32:16,800 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 142 flow. Second operand 5 states and 108 transitions. [2025-03-04 15:32:16,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 269 flow [2025-03-04 15:32:16,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 262 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:16,802 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 132 flow [2025-03-04 15:32:16,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2025-03-04 15:32:16,803 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-03-04 15:32:16,803 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 132 flow [2025-03-04 15:32:16,803 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,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,803 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:32:16,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-04 15:32:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 685585429, now seen corresponding path program 1 times [2025-03-04 15:32:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292670603] [2025-03-04 15:32:16,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:16,814 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,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,853 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,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292670603] [2025-03-04 15:32:16,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292670603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:32:16,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904728138] [2025-03-04 15:32:16,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:16,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:16,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:16,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 33 [2025-03-04 15:32:16,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 33 [2025-03-04 15:32:16,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:16,893 INFO L124 PetriNetUnfolderBase]: 50/155 cut-off events. [2025-03-04 15:32:16,894 INFO L125 PetriNetUnfolderBase]: For 119/124 co-relation queries the response was YES. [2025-03-04 15:32:16,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 155 events. 50/155 cut-off events. For 119/124 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 637 event pairs, 29 based on Foata normal form. 11/154 useless extension candidates. Maximal degree in co-relation 289. Up to 104 conditions per place. [2025-03-04 15:32:16,900 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 20 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2025-03-04 15:32:16,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 165 flow [2025-03-04 15:32:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:16,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-04 15:32:16,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2025-03-04 15:32:16,902 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 132 flow. Second operand 3 states and 61 transitions. [2025-03-04 15:32:16,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 165 flow [2025-03-04 15:32:16,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 155 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:16,905 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 115 flow [2025-03-04 15:32:16,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2025-03-04 15:32:16,906 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2025-03-04 15:32:16,906 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 115 flow [2025-03-04 15:32:16,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:16,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:16,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:32:16,906 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,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:16,907 INFO L85 PathProgramCache]: Analyzing trace with hash 685585462, now seen corresponding path program 1 times [2025-03-04 15:32:16,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:16,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295398915] [2025-03-04 15:32:16,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:16,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:16,918 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,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:16,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:16,961 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,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:16,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295398915] [2025-03-04 15:32:16,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295398915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:16,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:16,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:16,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432723902] [2025-03-04 15:32:16,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:16,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:16,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:16,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:16,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:16,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 33 [2025-03-04 15:32:16,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:16,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 33 [2025-03-04 15:32:16,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,040 INFO L124 PetriNetUnfolderBase]: 94/250 cut-off events. [2025-03-04 15:32:17,041 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 15:32:17,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 250 events. 94/250 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1080 event pairs, 47 based on Foata normal form. 10/245 useless extension candidates. Maximal degree in co-relation 531. Up to 147 conditions per place. [2025-03-04 15:32:17,044 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 30 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-03-04 15:32:17,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 211 flow [2025-03-04 15:32:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2025-03-04 15:32:17,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2025-03-04 15:32:17,045 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 115 flow. Second operand 4 states and 89 transitions. [2025-03-04 15:32:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 211 flow [2025-03-04 15:32:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:17,046 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 136 flow [2025-03-04 15:32:17,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2025-03-04 15:32:17,047 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 10 predicate places. [2025-03-04 15:32:17,047 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 136 flow [2025-03-04 15:32:17,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states 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,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,047 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:32:17,047 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:17,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,049 INFO L85 PathProgramCache]: Analyzing trace with hash 878952743, now seen corresponding path program 1 times [2025-03-04 15:32:17,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028464050] [2025-03-04 15:32:17,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:32:17,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:32:17,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:17,063 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:32:17,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:32:17,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:32:17,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:17,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:32:17,083 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:32:17,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-04 15:32:17,084 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-04 15:32:17,085 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-04 15:32:17,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:32:17,086 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:32:17,089 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:32:17,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:32:17,114 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:32:17,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 126 flow [2025-03-04 15:32:17,123 INFO L124 PetriNetUnfolderBase]: 3/75 cut-off events. [2025-03-04 15:32:17,123 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:32:17,124 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:17,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 53 transitions, 126 flow [2025-03-04 15:32:17,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 40 transitions, 93 flow [2025-03-04 15:32:17,125 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:17,125 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;@3c4d64f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:17,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-04 15:32:17,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:17,126 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:32:17,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:17,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,126 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:17,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1105989160, now seen corresponding path program 1 times [2025-03-04 15:32:17,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490064811] [2025-03-04 15:32:17,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:17,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:17,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,189 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,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490064811] [2025-03-04 15:32:17,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490064811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:17,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182497089] [2025-03-04 15:32:17,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:32:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:32:17,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:32:17,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-04 15:32:17,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 93 flow. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-04 15:32:17,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,510 INFO L124 PetriNetUnfolderBase]: 1210/2223 cut-off events. [2025-03-04 15:32:17,510 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-03-04 15:32:17,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4265 conditions, 2223 events. 1210/2223 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13833 event pairs, 211 based on Foata normal form. 96/2092 useless extension candidates. Maximal degree in co-relation 1893. Up to 518 conditions per place. [2025-03-04 15:32:17,519 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 99 selfloop transitions, 17 changer transitions 1/130 dead transitions. [2025-03-04 15:32:17,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 130 transitions, 532 flow [2025-03-04 15:32:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:32:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:32:17,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 314 transitions. [2025-03-04 15:32:17,521 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5924528301886792 [2025-03-04 15:32:17,521 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 93 flow. Second operand 10 states and 314 transitions. [2025-03-04 15:32:17,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 130 transitions, 532 flow [2025-03-04 15:32:17,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 130 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:17,524 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 216 flow [2025-03-04 15:32:17,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=216, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2025-03-04 15:32:17,524 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 16 predicate places. [2025-03-04 15:32:17,524 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 216 flow [2025-03-04 15:32:17,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 6 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:32:17,525 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash -74074184, now seen corresponding path program 1 times [2025-03-04 15:32:17,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14972764] [2025-03-04 15:32:17,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:17,534 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,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,567 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,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14972764] [2025-03-04 15:32:17,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14972764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:17,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697093555] [2025-03-04 15:32:17,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:17,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:17,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:17,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-03-04 15:32:17,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 216 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:17,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-03-04 15:32:17,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,754 INFO L124 PetriNetUnfolderBase]: 857/1647 cut-off events. [2025-03-04 15:32:17,754 INFO L125 PetriNetUnfolderBase]: For 1156/1399 co-relation queries the response was YES. [2025-03-04 15:32:17,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3926 conditions, 1647 events. 857/1647 cut-off events. For 1156/1399 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9807 event pairs, 179 based on Foata normal form. 180/1749 useless extension candidates. Maximal degree in co-relation 3855. Up to 773 conditions per place. [2025-03-04 15:32:17,762 INFO L140 encePairwiseOnDemand]: 46/53 looper letters, 67 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2025-03-04 15:32:17,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 91 transitions, 483 flow [2025-03-04 15:32:17,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2025-03-04 15:32:17,763 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6446540880503144 [2025-03-04 15:32:17,763 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 216 flow. Second operand 6 states and 205 transitions. [2025-03-04 15:32:17,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 91 transitions, 483 flow [2025-03-04 15:32:17,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 474 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:17,772 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 223 flow [2025-03-04 15:32:17,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2025-03-04 15:32:17,773 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2025-03-04 15:32:17,773 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 223 flow [2025-03-04 15:32:17,773 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,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,773 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:32:17,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:17,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash -73226134, now seen corresponding path program 1 times [2025-03-04 15:32:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254748370] [2025-03-04 15:32:17,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:17,784 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,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,807 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,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254748370] [2025-03-04 15:32:17,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254748370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:32:17,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123561754] [2025-03-04 15:32:17,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:17,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:17,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:17,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 53 [2025-03-04 15:32:17,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 223 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 53 [2025-03-04 15:32:17,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:17,915 INFO L124 PetriNetUnfolderBase]: 630/1438 cut-off events. [2025-03-04 15:32:17,915 INFO L125 PetriNetUnfolderBase]: For 1383/1551 co-relation queries the response was YES. [2025-03-04 15:32:17,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3324 conditions, 1438 events. 630/1438 cut-off events. For 1383/1551 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9618 event pairs, 529 based on Foata normal form. 64/1340 useless extension candidates. Maximal degree in co-relation 2169. Up to 1028 conditions per place. [2025-03-04 15:32:17,921 INFO L140 encePairwiseOnDemand]: 51/53 looper letters, 30 selfloop transitions, 1 changer transitions 0/49 dead transitions. [2025-03-04 15:32:17,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 49 transitions, 267 flow [2025-03-04 15:32:17,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:17,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 15:32:17,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2025-03-04 15:32:17,922 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 223 flow. Second operand 3 states and 93 transitions. [2025-03-04 15:32:17,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 49 transitions, 267 flow [2025-03-04 15:32:17,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 49 transitions, 242 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 15:32:17,926 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 182 flow [2025-03-04 15:32:17,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2025-03-04 15:32:17,928 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 13 predicate places. [2025-03-04 15:32:17,928 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 182 flow [2025-03-04 15:32:17,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:17,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:32:17,928 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,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash -73226101, now seen corresponding path program 1 times [2025-03-04 15:32:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:17,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624392213] [2025-03-04 15:32:17,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:17,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:17,936 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,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:17,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:17,968 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,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:17,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624392213] [2025-03-04 15:32:17,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624392213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:17,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:17,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234408101] [2025-03-04 15:32:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:17,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:17,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:17,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 53 [2025-03-04 15:32:17,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 182 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,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:17,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 53 [2025-03-04 15:32:17,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:18,199 INFO L124 PetriNetUnfolderBase]: 1165/2509 cut-off events. [2025-03-04 15:32:18,199 INFO L125 PetriNetUnfolderBase]: For 804/976 co-relation queries the response was YES. [2025-03-04 15:32:18,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5302 conditions, 2509 events. 1165/2509 cut-off events. For 804/976 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 17972 event pairs, 731 based on Foata normal form. 68/2343 useless extension candidates. Maximal degree in co-relation 5289. Up to 1367 conditions per place. [2025-03-04 15:32:18,212 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 57 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2025-03-04 15:32:18,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 76 transitions, 400 flow [2025-03-04 15:32:18,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-03-04 15:32:18,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6839622641509434 [2025-03-04 15:32:18,213 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 182 flow. Second operand 4 states and 145 transitions. [2025-03-04 15:32:18,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 76 transitions, 400 flow [2025-03-04 15:32:18,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:18,217 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 203 flow [2025-03-04 15:32:18,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=203, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2025-03-04 15:32:18,219 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 17 predicate places. [2025-03-04 15:32:18,219 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 203 flow [2025-03-04 15:32:18,219 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:18,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:32:18,219 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:18,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,219 INFO L85 PathProgramCache]: Analyzing trace with hash 839784812, now seen corresponding path program 1 times [2025-03-04 15:32:18,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156081068] [2025-03-04 15:32:18,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:32:18,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:32:18,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:18,247 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,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:18,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156081068] [2025-03-04 15:32:18,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156081068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:18,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:18,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:32:18,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289794557] [2025-03-04 15:32:18,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:18,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:18,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:18,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:18,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:18,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-03-04 15:32:18,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 203 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:18,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-03-04 15:32:18,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:18,436 INFO L124 PetriNetUnfolderBase]: 1021/2179 cut-off events. [2025-03-04 15:32:18,436 INFO L125 PetriNetUnfolderBase]: For 1303/1389 co-relation queries the response was YES. [2025-03-04 15:32:18,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5281 conditions, 2179 events. 1021/2179 cut-off events. For 1303/1389 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15293 event pairs, 898 based on Foata normal form. 5/1955 useless extension candidates. Maximal degree in co-relation 5266. Up to 1650 conditions per place. [2025-03-04 15:32:18,444 INFO L140 encePairwiseOnDemand]: 48/53 looper letters, 34 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2025-03-04 15:32:18,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 54 transitions, 291 flow [2025-03-04 15:32:18,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:18,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2025-03-04 15:32:18,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6729559748427673 [2025-03-04 15:32:18,445 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 203 flow. Second operand 3 states and 107 transitions. [2025-03-04 15:32:18,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 54 transitions, 291 flow [2025-03-04 15:32:18,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 54 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:18,447 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 228 flow [2025-03-04 15:32:18,447 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-03-04 15:32:18,448 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2025-03-04 15:32:18,448 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 228 flow [2025-03-04 15:32:18,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:32:18,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,450 INFO L85 PathProgramCache]: Analyzing trace with hash 364854509, now seen corresponding path program 1 times [2025-03-04 15:32:18,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766967626] [2025-03-04 15:32:18,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:32:18,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:32:18,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:32:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766967626] [2025-03-04 15:32:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766967626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:18,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:32:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485314610] [2025-03-04 15:32:18,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:18,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:32:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:18,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:32:18,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:32:18,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 53 [2025-03-04 15:32:18,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:18,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 53 [2025-03-04 15:32:18,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:18,684 INFO L124 PetriNetUnfolderBase]: 1015/1980 cut-off events. [2025-03-04 15:32:18,684 INFO L125 PetriNetUnfolderBase]: For 1291/1393 co-relation queries the response was YES. [2025-03-04 15:32:18,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5086 conditions, 1980 events. 1015/1980 cut-off events. For 1291/1393 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 12592 event pairs, 302 based on Foata normal form. 5/1887 useless extension candidates. Maximal degree in co-relation 5070. Up to 1366 conditions per place. [2025-03-04 15:32:18,693 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 44 selfloop transitions, 9 changer transitions 6/74 dead transitions. [2025-03-04 15:32:18,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 74 transitions, 435 flow [2025-03-04 15:32:18,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:18,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2025-03-04 15:32:18,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.559748427672956 [2025-03-04 15:32:18,694 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 228 flow. Second operand 6 states and 178 transitions. [2025-03-04 15:32:18,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 74 transitions, 435 flow [2025-03-04 15:32:18,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 418 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:18,697 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 235 flow [2025-03-04 15:32:18,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=235, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2025-03-04 15:32:18,698 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2025-03-04 15:32:18,698 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 235 flow [2025-03-04 15:32:18,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 6 states have internal predecessors, (135), 0 states have call successors, (0), 0 states 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,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,698 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:32:18,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:18,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash -479486190, now seen corresponding path program 1 times [2025-03-04 15:32:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399768155] [2025-03-04 15:32:18,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:18,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:18,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:18,721 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,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:18,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399768155] [2025-03-04 15:32:18,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399768155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:18,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:18,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:18,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366844382] [2025-03-04 15:32:18,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:18,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:18,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:18,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:18,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-03-04 15:32:18,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 235 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:18,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:18,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-03-04 15:32:18,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:18,876 INFO L124 PetriNetUnfolderBase]: 976/2167 cut-off events. [2025-03-04 15:32:18,876 INFO L125 PetriNetUnfolderBase]: For 1208/1242 co-relation queries the response was YES. [2025-03-04 15:32:18,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 2167 events. 976/2167 cut-off events. For 1208/1242 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 15586 event pairs, 332 based on Foata normal form. 59/2129 useless extension candidates. Maximal degree in co-relation 5208. Up to 1263 conditions per place. [2025-03-04 15:32:18,884 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 43 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2025-03-04 15:32:18,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 63 transitions, 379 flow [2025-03-04 15:32:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-03-04 15:32:18,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6367924528301887 [2025-03-04 15:32:18,885 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 235 flow. Second operand 4 states and 135 transitions. [2025-03-04 15:32:18,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 63 transitions, 379 flow [2025-03-04 15:32:18,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 63 transitions, 349 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:32:18,888 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 215 flow [2025-03-04 15:32:18,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=215, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2025-03-04 15:32:18,888 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 20 predicate places. [2025-03-04 15:32:18,888 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 215 flow [2025-03-04 15:32:18,888 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:18,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:18,888 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:18,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:32:18,888 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:18,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:18,889 INFO L85 PathProgramCache]: Analyzing trace with hash -479485909, now seen corresponding path program 1 times [2025-03-04 15:32:18,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:18,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236941736] [2025-03-04 15:32:18,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:18,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:18,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:18,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:18,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:18,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:18,937 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,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:18,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236941736] [2025-03-04 15:32:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236941736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:32:18,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047132674] [2025-03-04 15:32:18,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:18,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:32:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:18,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:32:18,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:32:18,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 53 [2025-03-04 15:32:18,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 215 flow. Second operand has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:18,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 53 [2025-03-04 15:32:18,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:19,210 INFO L124 PetriNetUnfolderBase]: 1440/2674 cut-off events. [2025-03-04 15:32:19,211 INFO L125 PetriNetUnfolderBase]: For 1544/1694 co-relation queries the response was YES. [2025-03-04 15:32:19,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6614 conditions, 2674 events. 1440/2674 cut-off events. For 1544/1694 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17516 event pairs, 152 based on Foata normal form. 83/2717 useless extension candidates. Maximal degree in co-relation 6598. Up to 724 conditions per place. [2025-03-04 15:32:19,225 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 86 selfloop transitions, 15 changer transitions 0/114 dead transitions. [2025-03-04 15:32:19,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 114 transitions, 670 flow [2025-03-04 15:32:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:32:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:32:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 260 transitions. [2025-03-04 15:32:19,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5450733752620545 [2025-03-04 15:32:19,226 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 215 flow. Second operand 9 states and 260 transitions. [2025-03-04 15:32:19,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 114 transitions, 670 flow [2025-03-04 15:32:19,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 114 transitions, 660 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:19,231 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 280 flow [2025-03-04 15:32:19,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=280, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2025-03-04 15:32:19,232 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2025-03-04 15:32:19,232 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 280 flow [2025-03-04 15:32:19,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.571428571428573) internal successors, (144), 7 states have internal predecessors, (144), 0 states have call successors, (0), 0 states 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,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:19,232 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:19,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:32:19,232 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:19,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1979169811, now seen corresponding path program 1 times [2025-03-04 15:32:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:19,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054839294] [2025-03-04 15:32:19,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:19,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:19,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:19,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:19,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:19,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:32:19,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:19,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054839294] [2025-03-04 15:32:19,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054839294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:19,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:19,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:19,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720261278] [2025-03-04 15:32:19,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:19,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:19,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:19,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:19,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:19,266 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 53 [2025-03-04 15:32:19,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 54 transitions, 280 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:19,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:19,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 53 [2025-03-04 15:32:19,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:19,402 INFO L124 PetriNetUnfolderBase]: 1114/2464 cut-off events. [2025-03-04 15:32:19,402 INFO L125 PetriNetUnfolderBase]: For 2126/2228 co-relation queries the response was YES. [2025-03-04 15:32:19,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6124 conditions, 2464 events. 1114/2464 cut-off events. For 2126/2228 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18317 event pairs, 275 based on Foata normal form. 67/2531 useless extension candidates. Maximal degree in co-relation 6105. Up to 1656 conditions per place. [2025-03-04 15:32:19,410 INFO L140 encePairwiseOnDemand]: 49/53 looper letters, 49 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2025-03-04 15:32:19,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 71 transitions, 484 flow [2025-03-04 15:32:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:19,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:19,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-03-04 15:32:19,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6415094339622641 [2025-03-04 15:32:19,411 INFO L175 Difference]: Start difference. First operand has 77 places, 54 transitions, 280 flow. Second operand 4 states and 136 transitions. [2025-03-04 15:32:19,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 71 transitions, 484 flow [2025-03-04 15:32:19,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 71 transitions, 476 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:19,414 INFO L231 Difference]: Finished difference. Result has 77 places, 54 transitions, 290 flow [2025-03-04 15:32:19,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=290, PETRI_PLACES=77, PETRI_TRANSITIONS=54} [2025-03-04 15:32:19,415 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 30 predicate places. [2025-03-04 15:32:19,415 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 54 transitions, 290 flow [2025-03-04 15:32:19,415 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:19,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:19,415 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:19,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:32:19,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1979161060, now seen corresponding path program 1 times [2025-03-04 15:32:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:19,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501349223] [2025-03-04 15:32:19,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:19,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:19,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:19,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:19,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:19,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:19,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:19,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501349223] [2025-03-04 15:32:19,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501349223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:19,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:19,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:19,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333961432] [2025-03-04 15:32:19,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:19,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:19,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:19,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:19,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 53 [2025-03-04 15:32:19,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 54 transitions, 290 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:19,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:19,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 53 [2025-03-04 15:32:19,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:19,630 INFO L124 PetriNetUnfolderBase]: 1256/2397 cut-off events. [2025-03-04 15:32:19,631 INFO L125 PetriNetUnfolderBase]: For 2847/2989 co-relation queries the response was YES. [2025-03-04 15:32:19,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6604 conditions, 2397 events. 1256/2397 cut-off events. For 2847/2989 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 15660 event pairs, 234 based on Foata normal form. 77/2474 useless extension candidates. Maximal degree in co-relation 6583. Up to 1144 conditions per place. [2025-03-04 15:32:19,642 INFO L140 encePairwiseOnDemand]: 47/53 looper letters, 72 selfloop transitions, 8 changer transitions 0/94 dead transitions. [2025-03-04 15:32:19,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 94 transitions, 625 flow [2025-03-04 15:32:19,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2025-03-04 15:32:19,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2025-03-04 15:32:19,644 INFO L175 Difference]: Start difference. First operand has 77 places, 54 transitions, 290 flow. Second operand 6 states and 196 transitions. [2025-03-04 15:32:19,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 94 transitions, 625 flow [2025-03-04 15:32:19,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 94 transitions, 598 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:19,654 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 285 flow [2025-03-04 15:32:19,655 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2025-03-04 15:32:19,655 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 31 predicate places. [2025-03-04 15:32:19,655 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 285 flow [2025-03-04 15:32:19,656 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:19,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:19,656 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:19,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:32:19,656 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-04 15:32:19,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:19,656 INFO L85 PathProgramCache]: Analyzing trace with hash 688332324, now seen corresponding path program 1 times [2025-03-04 15:32:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752665183] [2025-03-04 15:32:19,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:19,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:32:19,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:32:19,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:19,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:19,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:32:19,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 15:32:19,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 15:32:19,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:19,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:32:19,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:32:19,677 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-04 15:32:19,677 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-04 15:32:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-04 15:32:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-04 15:32:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-04 15:32:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-04 15:32:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-04 15:32:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-04 15:32:19,678 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-04 15:32:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-04 15:32:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-04 15:32:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-04 15:32:19,679 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-04 15:32:19,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:32:19,679 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:19,680 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:32:19,680 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:32:19,703 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:32:19,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 73 transitions, 182 flow [2025-03-04 15:32:19,709 INFO L124 PetriNetUnfolderBase]: 4/103 cut-off events. [2025-03-04 15:32:19,710 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:32:19,710 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:19,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 73 transitions, 182 flow [2025-03-04 15:32:19,710 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 117 flow [2025-03-04 15:32:19,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:32:19,711 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;@3c4d64f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:32:19,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 15:32:19,712 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:32:19,712 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-03-04 15:32:19,712 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:32:19,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:19,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:19,713 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:19,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash -666107868, now seen corresponding path program 1 times [2025-03-04 15:32:19,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:19,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694024340] [2025-03-04 15:32:19,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:19,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:19,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:32:19,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:32:19,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:19,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:19,752 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,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:19,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694024340] [2025-03-04 15:32:19,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694024340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:19,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:19,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:19,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886642982] [2025-03-04 15:32:19,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:19,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:32:19,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:19,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:32:19,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:32:19,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-03-04 15:32:19,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:19,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:19,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-03-04 15:32:19,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:20,409 INFO L124 PetriNetUnfolderBase]: 8710/13562 cut-off events. [2025-03-04 15:32:20,409 INFO L125 PetriNetUnfolderBase]: For 387/387 co-relation queries the response was YES. [2025-03-04 15:32:20,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26489 conditions, 13562 events. 8710/13562 cut-off events. For 387/387 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 93611 event pairs, 1571 based on Foata normal form. 400/12753 useless extension candidates. Maximal degree in co-relation 8369. Up to 4536 conditions per place. [2025-03-04 15:32:20,451 INFO L140 encePairwiseOnDemand]: 58/73 looper letters, 119 selfloop transitions, 20 changer transitions 1/157 dead transitions. [2025-03-04 15:32:20,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 157 transitions, 668 flow [2025-03-04 15:32:20,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:32:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:32:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 427 transitions. [2025-03-04 15:32:20,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.584931506849315 [2025-03-04 15:32:20,453 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 117 flow. Second operand 10 states and 427 transitions. [2025-03-04 15:32:20,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 157 transitions, 668 flow [2025-03-04 15:32:20,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 157 transitions, 652 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:20,455 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 269 flow [2025-03-04 15:32:20,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=269, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-03-04 15:32:20,455 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 16 predicate places. [2025-03-04 15:32:20,455 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 269 flow [2025-03-04 15:32:20,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:20,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:20,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:20,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:32:20,455 INFO L396 AbstractCegarLoop]: === Iteration 2 === 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:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash 825492883, now seen corresponding path program 1 times [2025-03-04 15:32:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633659006] [2025-03-04 15:32:20,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:20,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:20,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:20,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:20,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:20,482 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,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633659006] [2025-03-04 15:32:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633659006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:20,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692242569] [2025-03-04 15:32:20,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:20,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:20,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:20,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:20,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:20,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 269 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:20,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:20,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:20,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:20,991 INFO L124 PetriNetUnfolderBase]: 6487/10082 cut-off events. [2025-03-04 15:32:20,992 INFO L125 PetriNetUnfolderBase]: For 6555/7922 co-relation queries the response was YES. [2025-03-04 15:32:21,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24806 conditions, 10082 events. 6487/10082 cut-off events. For 6555/7922 co-relation queries the response was YES. Maximal size of possible extension queue 552. Compared 65439 event pairs, 1511 based on Foata normal form. 771/10458 useless extension candidates. Maximal degree in co-relation 24736. Up to 5153 conditions per place. [2025-03-04 15:32:21,024 INFO L140 encePairwiseOnDemand]: 65/73 looper letters, 88 selfloop transitions, 10 changer transitions 0/118 dead transitions. [2025-03-04 15:32:21,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 118 transitions, 635 flow [2025-03-04 15:32:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 275 transitions. [2025-03-04 15:32:21,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6278538812785388 [2025-03-04 15:32:21,025 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 269 flow. Second operand 6 states and 275 transitions. [2025-03-04 15:32:21,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 118 transitions, 635 flow [2025-03-04 15:32:21,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 118 transitions, 625 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:21,052 INFO L231 Difference]: Finished difference. Result has 75 places, 67 transitions, 288 flow [2025-03-04 15:32:21,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=75, PETRI_TRANSITIONS=67} [2025-03-04 15:32:21,052 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2025-03-04 15:32:21,052 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 67 transitions, 288 flow [2025-03-04 15:32:21,052 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:21,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:21,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:21,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:32:21,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-04 15:32:21,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash 826315114, now seen corresponding path program 1 times [2025-03-04 15:32:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:21,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853791035] [2025-03-04 15:32:21,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:21,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:21,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:21,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:21,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:21,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:21,069 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,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:21,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853791035] [2025-03-04 15:32:21,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853791035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:21,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:21,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:32:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526099824] [2025-03-04 15:32:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:21,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:21,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:21,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:21,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:21,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 73 [2025-03-04 15:32:21,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 67 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:21,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 73 [2025-03-04 15:32:21,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:21,541 INFO L124 PetriNetUnfolderBase]: 4756/8857 cut-off events. [2025-03-04 15:32:21,541 INFO L125 PetriNetUnfolderBase]: For 5847/6941 co-relation queries the response was YES. [2025-03-04 15:32:21,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19973 conditions, 8857 events. 4756/8857 cut-off events. For 5847/6941 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 70899 event pairs, 3999 based on Foata normal form. 307/8109 useless extension candidates. Maximal degree in co-relation 11400. Up to 6872 conditions per place. [2025-03-04 15:32:21,573 INFO L140 encePairwiseOnDemand]: 71/73 looper letters, 40 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2025-03-04 15:32:21,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 63 transitions, 344 flow [2025-03-04 15:32:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-03-04 15:32:21,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5662100456621004 [2025-03-04 15:32:21,574 INFO L175 Difference]: Start difference. First operand has 75 places, 67 transitions, 288 flow. Second operand 3 states and 124 transitions. [2025-03-04 15:32:21,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 63 transitions, 344 flow [2025-03-04 15:32:21,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 63 transitions, 314 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 15:32:21,583 INFO L231 Difference]: Finished difference. Result has 70 places, 63 transitions, 234 flow [2025-03-04 15:32:21,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=70, PETRI_TRANSITIONS=63} [2025-03-04 15:32:21,584 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 13 predicate places. [2025-03-04 15:32:21,584 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 63 transitions, 234 flow [2025-03-04 15:32:21,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:21,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:21,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:32:21,584 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:21,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash 826315147, now seen corresponding path program 1 times [2025-03-04 15:32:21,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:21,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455647584] [2025-03-04 15:32:21,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:21,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:21,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:32:21,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:32:21,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:21,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:21,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:21,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455647584] [2025-03-04 15:32:21,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455647584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:21,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:21,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:21,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082091005] [2025-03-04 15:32:21,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:21,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:21,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:21,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:21,622 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 73 [2025-03-04 15:32:21,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 63 transitions, 234 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,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:21,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 73 [2025-03-04 15:32:21,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:22,513 INFO L124 PetriNetUnfolderBase]: 8725/15874 cut-off events. [2025-03-04 15:32:22,513 INFO L125 PetriNetUnfolderBase]: For 4896/6038 co-relation queries the response was YES. [2025-03-04 15:32:22,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33497 conditions, 15874 events. 8725/15874 cut-off events. For 4896/6038 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 136004 event pairs, 5443 based on Foata normal form. 376/14685 useless extension candidates. Maximal degree in co-relation 33483. Up to 9115 conditions per place. [2025-03-04 15:32:22,561 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 85 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-03-04 15:32:22,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 580 flow [2025-03-04 15:32:22,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-03-04 15:32:22,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6815068493150684 [2025-03-04 15:32:22,563 INFO L175 Difference]: Start difference. First operand has 70 places, 63 transitions, 234 flow. Second operand 4 states and 199 transitions. [2025-03-04 15:32:22,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 580 flow [2025-03-04 15:32:22,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:22,570 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 255 flow [2025-03-04 15:32:22,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2025-03-04 15:32:22,571 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 17 predicate places. [2025-03-04 15:32:22,571 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 255 flow [2025-03-04 15:32:22,571 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,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:22,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:22,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:32:22,571 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:22,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1154370968, now seen corresponding path program 1 times [2025-03-04 15:32:22,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:22,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791407477] [2025-03-04 15:32:22,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:22,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:32:22,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:32:22,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:22,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:22,587 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,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:22,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791407477] [2025-03-04 15:32:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791407477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:22,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:22,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:32:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541749732] [2025-03-04 15:32:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:32:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:22,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:32:22,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:32:22,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-03-04 15:32:22,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:22,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-03-04 15:32:22,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:23,167 INFO L124 PetriNetUnfolderBase]: 7741/14538 cut-off events. [2025-03-04 15:32:23,167 INFO L125 PetriNetUnfolderBase]: For 7608/8164 co-relation queries the response was YES. [2025-03-04 15:32:23,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33588 conditions, 14538 events. 7741/14538 cut-off events. For 7608/8164 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 126986 event pairs, 6722 based on Foata normal form. 5/12727 useless extension candidates. Maximal degree in co-relation 33572. Up to 11168 conditions per place. [2025-03-04 15:32:23,218 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 44 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2025-03-04 15:32:23,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 68 transitions, 363 flow [2025-03-04 15:32:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:32:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:32:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2025-03-04 15:32:23,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6575342465753424 [2025-03-04 15:32:23,221 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 255 flow. Second operand 3 states and 144 transitions. [2025-03-04 15:32:23,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 68 transitions, 363 flow [2025-03-04 15:32:23,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 68 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:23,232 INFO L231 Difference]: Finished difference. Result has 76 places, 66 transitions, 280 flow [2025-03-04 15:32:23,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=76, PETRI_TRANSITIONS=66} [2025-03-04 15:32:23,232 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 19 predicate places. [2025-03-04 15:32:23,232 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 66 transitions, 280 flow [2025-03-04 15:32:23,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:23,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:23,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:32:23,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:23,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1997663000, now seen corresponding path program 1 times [2025-03-04 15:32:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:23,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961752126] [2025-03-04 15:32:23,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:23,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:23,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:32:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:32:23,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:32:23,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:23,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961752126] [2025-03-04 15:32:23,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961752126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:23,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:32:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247328832] [2025-03-04 15:32:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:23,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:32:23,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:23,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:32:23,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:32:23,408 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 73 [2025-03-04 15:32:23,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 66 transitions, 280 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:23,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:23,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 73 [2025-03-04 15:32:23,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:24,018 INFO L124 PetriNetUnfolderBase]: 7602/12401 cut-off events. [2025-03-04 15:32:24,018 INFO L125 PetriNetUnfolderBase]: For 7752/8330 co-relation queries the response was YES. [2025-03-04 15:32:24,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31538 conditions, 12401 events. 7602/12401 cut-off events. For 7752/8330 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 89817 event pairs, 2391 based on Foata normal form. 9/11727 useless extension candidates. Maximal degree in co-relation 31521. Up to 10197 conditions per place. [2025-03-04 15:32:24,067 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 54 selfloop transitions, 11 changer transitions 6/90 dead transitions. [2025-03-04 15:32:24,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 520 flow [2025-03-04 15:32:24,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:24,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:24,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 239 transitions. [2025-03-04 15:32:24,068 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.545662100456621 [2025-03-04 15:32:24,068 INFO L175 Difference]: Start difference. First operand has 76 places, 66 transitions, 280 flow. Second operand 6 states and 239 transitions. [2025-03-04 15:32:24,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 520 flow [2025-03-04 15:32:24,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 90 transitions, 503 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-03-04 15:32:24,093 INFO L231 Difference]: Finished difference. Result has 82 places, 65 transitions, 291 flow [2025-03-04 15:32:24,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=75, 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=291, PETRI_PLACES=82, PETRI_TRANSITIONS=65} [2025-03-04 15:32:24,094 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2025-03-04 15:32:24,094 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 65 transitions, 291 flow [2025-03-04 15:32:24,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:24,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:24,094 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:24,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:32:24,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === 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:24,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:24,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1712044466, now seen corresponding path program 1 times [2025-03-04 15:32:24,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:24,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811385286] [2025-03-04 15:32:24,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:24,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:24,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:24,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:24,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:24,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:24,121 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:24,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811385286] [2025-03-04 15:32:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811385286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118650999] [2025-03-04 15:32:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:24,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:24,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:24,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:24,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:24,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-03-04 15:32:24,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 65 transitions, 291 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:24,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:24,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-03-04 15:32:24,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:24,947 INFO L124 PetriNetUnfolderBase]: 7477/14143 cut-off events. [2025-03-04 15:32:24,947 INFO L125 PetriNetUnfolderBase]: For 7046/7268 co-relation queries the response was YES. [2025-03-04 15:32:24,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33145 conditions, 14143 events. 7477/14143 cut-off events. For 7046/7268 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 124184 event pairs, 2316 based on Foata normal form. 363/13802 useless extension candidates. Maximal degree in co-relation 33125. Up to 8544 conditions per place. [2025-03-04 15:32:25,020 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 62 selfloop transitions, 5 changer transitions 0/86 dead transitions. [2025-03-04 15:32:25,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 513 flow [2025-03-04 15:32:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2025-03-04 15:32:25,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636986301369863 [2025-03-04 15:32:25,021 INFO L175 Difference]: Start difference. First operand has 82 places, 65 transitions, 291 flow. Second operand 4 states and 186 transitions. [2025-03-04 15:32:25,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 513 flow [2025-03-04 15:32:25,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 475 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:32:25,089 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 267 flow [2025-03-04 15:32:25,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=267, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2025-03-04 15:32:25,089 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places. [2025-03-04 15:32:25,089 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 267 flow [2025-03-04 15:32:25,089 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:25,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:25,089 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:25,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:32:25,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:25,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1712044523, now seen corresponding path program 1 times [2025-03-04 15:32:25,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:25,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029419298] [2025-03-04 15:32:25,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:25,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:32:25,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:32:25,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:25,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:25,135 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,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:25,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029419298] [2025-03-04 15:32:25,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029419298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:25,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:32:25,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705907502] [2025-03-04 15:32:25,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:25,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:32:25,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:25,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:32:25,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:32:25,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-03-04 15:32:25,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 267 flow. Second operand has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:25,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-03-04 15:32:25,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:26,355 INFO L124 PetriNetUnfolderBase]: 14910/24037 cut-off events. [2025-03-04 15:32:26,355 INFO L125 PetriNetUnfolderBase]: For 12816/14108 co-relation queries the response was YES. [2025-03-04 15:32:26,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59002 conditions, 24037 events. 14910/24037 cut-off events. For 12816/14108 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 189127 event pairs, 3103 based on Foata normal form. 609/24100 useless extension candidates. Maximal degree in co-relation 58985. Up to 8224 conditions per place. [2025-03-04 15:32:26,452 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 111 selfloop transitions, 23 changer transitions 0/151 dead transitions. [2025-03-04 15:32:26,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 151 transitions, 886 flow [2025-03-04 15:32:26,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:32:26,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:32:26,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 363 transitions. [2025-03-04 15:32:26,453 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5525114155251142 [2025-03-04 15:32:26,454 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 267 flow. Second operand 9 states and 363 transitions. [2025-03-04 15:32:26,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 151 transitions, 886 flow [2025-03-04 15:32:26,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 151 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:32:26,503 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 417 flow [2025-03-04 15:32:26,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=417, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-04 15:32:26,504 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2025-03-04 15:32:26,504 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 417 flow [2025-03-04 15:32:26,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.571428571428573) internal successors, (207), 7 states have internal predecessors, (207), 0 states have call successors, (0), 0 states 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:26,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:26,504 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:26,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:32:26,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:26,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:26,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1533771158, now seen corresponding path program 1 times [2025-03-04 15:32:26,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:26,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163939291] [2025-03-04 15:32:26,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:26,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:26,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:26,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:26,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:26,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:26,522 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:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:26,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163939291] [2025-03-04 15:32:26,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163939291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:26,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:26,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433027743] [2025-03-04 15:32:26,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:26,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:32:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:26,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:32:26,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:32:26,525 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 73 [2025-03-04 15:32:26,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 417 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:26,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:26,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 73 [2025-03-04 15:32:26,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:27,478 INFO L124 PetriNetUnfolderBase]: 11890/21672 cut-off events. [2025-03-04 15:32:27,478 INFO L125 PetriNetUnfolderBase]: For 24108/25864 co-relation queries the response was YES. [2025-03-04 15:32:27,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54956 conditions, 21672 events. 11890/21672 cut-off events. For 24108/25864 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 196873 event pairs, 7147 based on Foata normal form. 525/20240 useless extension candidates. Maximal degree in co-relation 54935. Up to 17102 conditions per place. [2025-03-04 15:32:27,565 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 70 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2025-03-04 15:32:27,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 96 transitions, 682 flow [2025-03-04 15:32:27,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:32:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:32:27,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2025-03-04 15:32:27,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6404109589041096 [2025-03-04 15:32:27,566 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 417 flow. Second operand 4 states and 187 transitions. [2025-03-04 15:32:27,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 96 transitions, 682 flow [2025-03-04 15:32:27,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 96 transitions, 674 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:27,602 INFO L231 Difference]: Finished difference. Result has 89 places, 78 transitions, 443 flow [2025-03-04 15:32:27,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=443, PETRI_PLACES=89, PETRI_TRANSITIONS=78} [2025-03-04 15:32:27,602 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 32 predicate places. [2025-03-04 15:32:27,602 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 78 transitions, 443 flow [2025-03-04 15:32:27,602 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:27,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:27,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:27,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:32:27,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === 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:27,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:27,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1533772958, now seen corresponding path program 1 times [2025-03-04 15:32:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:27,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845076735] [2025-03-04 15:32:27,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:27,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:27,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:32:27,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:32:27,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:27,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:27,643 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,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:27,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845076735] [2025-03-04 15:32:27,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845076735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:27,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:27,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:32:27,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323981894] [2025-03-04 15:32:27,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:27,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:32:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:27,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:32:27,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:32:27,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 73 [2025-03-04 15:32:27,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 78 transitions, 443 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:27,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:27,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 73 [2025-03-04 15:32:27,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:28,735 INFO L124 PetriNetUnfolderBase]: 13621/22052 cut-off events. [2025-03-04 15:32:28,735 INFO L125 PetriNetUnfolderBase]: For 27077/29852 co-relation queries the response was YES. [2025-03-04 15:32:28,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61057 conditions, 22052 events. 13621/22052 cut-off events. For 27077/29852 co-relation queries the response was YES. Maximal size of possible extension queue 1159. Compared 172957 event pairs, 3938 based on Foata normal form. 683/22467 useless extension candidates. Maximal degree in co-relation 61034. Up to 10990 conditions per place. [2025-03-04 15:32:28,810 INFO L140 encePairwiseOnDemand]: 66/73 looper letters, 101 selfloop transitions, 12 changer transitions 0/132 dead transitions. [2025-03-04 15:32:28,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 132 transitions, 919 flow [2025-03-04 15:32:28,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2025-03-04 15:32:28,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6073059360730594 [2025-03-04 15:32:28,811 INFO L175 Difference]: Start difference. First operand has 89 places, 78 transitions, 443 flow. Second operand 6 states and 266 transitions. [2025-03-04 15:32:28,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 132 transitions, 919 flow [2025-03-04 15:32:28,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 132 transitions, 894 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-03-04 15:32:28,899 INFO L231 Difference]: Finished difference. Result has 91 places, 77 transitions, 448 flow [2025-03-04 15:32:28,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=91, PETRI_TRANSITIONS=77} [2025-03-04 15:32:28,899 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 34 predicate places. [2025-03-04 15:32:28,899 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 77 transitions, 448 flow [2025-03-04 15:32:28,899 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:28,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:28,899 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:28,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:32:28,899 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:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash 575878398, now seen corresponding path program 1 times [2025-03-04 15:32:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838517767] [2025-03-04 15:32:28,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:28,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:28,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:28,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:28,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:28,960 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:28,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:28,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838517767] [2025-03-04 15:32:28,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838517767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:28,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:28,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:32:28,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993510685] [2025-03-04 15:32:28,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:28,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:32:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:28,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:32:28,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:32:29,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2025-03-04 15:32:29,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 77 transitions, 448 flow. Second operand has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:29,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2025-03-04 15:32:29,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:31,261 INFO L124 PetriNetUnfolderBase]: 25611/38882 cut-off events. [2025-03-04 15:32:31,261 INFO L125 PetriNetUnfolderBase]: For 51623/53845 co-relation queries the response was YES. [2025-03-04 15:32:31,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110931 conditions, 38882 events. 25611/38882 cut-off events. For 51623/53845 co-relation queries the response was YES. Maximal size of possible extension queue 1930. Compared 298804 event pairs, 5416 based on Foata normal form. 284/38065 useless extension candidates. Maximal degree in co-relation 110907. Up to 19178 conditions per place. [2025-03-04 15:32:31,487 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 192 selfloop transitions, 36 changer transitions 0/243 dead transitions. [2025-03-04 15:32:31,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 243 transitions, 1718 flow [2025-03-04 15:32:31,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:32:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:32:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 517 transitions. [2025-03-04 15:32:31,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5447839831401475 [2025-03-04 15:32:31,492 INFO L175 Difference]: Start difference. First operand has 91 places, 77 transitions, 448 flow. Second operand 13 states and 517 transitions. [2025-03-04 15:32:31,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 243 transitions, 1718 flow [2025-03-04 15:32:31,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 243 transitions, 1682 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:31,966 INFO L231 Difference]: Finished difference. Result has 103 places, 97 transitions, 697 flow [2025-03-04 15:32:31,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=697, PETRI_PLACES=103, PETRI_TRANSITIONS=97} [2025-03-04 15:32:31,966 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 46 predicate places. [2025-03-04 15:32:31,966 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 97 transitions, 697 flow [2025-03-04 15:32:31,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:31,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:31,967 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:31,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:32:31,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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:31,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1363128088, now seen corresponding path program 2 times [2025-03-04 15:32:31,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:31,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281915194] [2025-03-04 15:32:31,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:32:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:31,972 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:31,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:31,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:32:31,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:32,030 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,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:32,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281915194] [2025-03-04 15:32:32,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281915194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:32,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:32,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:32:32,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818556532] [2025-03-04 15:32:32,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:32,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:32:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:32,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:32:32,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:32:32,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2025-03-04 15:32:32,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 97 transitions, 697 flow. Second operand has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:32,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2025-03-04 15:32:32,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:34,734 INFO L124 PetriNetUnfolderBase]: 26438/40254 cut-off events. [2025-03-04 15:32:34,734 INFO L125 PetriNetUnfolderBase]: For 79340/81704 co-relation queries the response was YES. [2025-03-04 15:32:34,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122742 conditions, 40254 events. 26438/40254 cut-off events. For 79340/81704 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 311647 event pairs, 3552 based on Foata normal form. 378/39601 useless extension candidates. Maximal degree in co-relation 122716. Up to 11875 conditions per place. [2025-03-04 15:32:34,931 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 177 selfloop transitions, 49 changer transitions 0/241 dead transitions. [2025-03-04 15:32:34,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 241 transitions, 1821 flow [2025-03-04 15:32:34,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:32:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:32:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 538 transitions. [2025-03-04 15:32:34,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5264187866927593 [2025-03-04 15:32:34,932 INFO L175 Difference]: Start difference. First operand has 103 places, 97 transitions, 697 flow. Second operand 14 states and 538 transitions. [2025-03-04 15:32:34,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 241 transitions, 1821 flow [2025-03-04 15:32:36,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 241 transitions, 1794 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-03-04 15:32:36,218 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 895 flow [2025-03-04 15:32:36,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=895, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2025-03-04 15:32:36,219 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 57 predicate places. [2025-03-04 15:32:36,219 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 895 flow [2025-03-04 15:32:36,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:36,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:36,219 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:36,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:32:36,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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:36,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:36,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1021344174, now seen corresponding path program 1 times [2025-03-04 15:32:36,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:36,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891105034] [2025-03-04 15:32:36,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:36,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:36,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:36,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:36,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891105034] [2025-03-04 15:32:36,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891105034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:32:36,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973184659] [2025-03-04 15:32:36,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:36,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:36,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:36,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:32:36,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:32:36,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:36,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:36,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:36,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:36,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:32:36,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:32:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:36,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:32:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973184659] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:36,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:32:36,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 15:32:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073331493] [2025-03-04 15:32:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:36,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:32:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:36,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:32:36,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:32:36,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 73 [2025-03-04 15:32:36,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 895 flow. Second operand has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:36,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:36,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 73 [2025-03-04 15:32:36,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:38,755 INFO L124 PetriNetUnfolderBase]: 22967/41748 cut-off events. [2025-03-04 15:32:38,755 INFO L125 PetriNetUnfolderBase]: For 108853/113153 co-relation queries the response was YES. [2025-03-04 15:32:38,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118721 conditions, 41748 events. 22967/41748 cut-off events. For 108853/113153 co-relation queries the response was YES. Maximal size of possible extension queue 2079. Compared 409551 event pairs, 5360 based on Foata normal form. 2025/41902 useless extension candidates. Maximal degree in co-relation 118692. Up to 9031 conditions per place. [2025-03-04 15:32:38,992 INFO L140 encePairwiseOnDemand]: 69/73 looper letters, 281 selfloop transitions, 5 changer transitions 0/314 dead transitions. [2025-03-04 15:32:38,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 314 transitions, 3689 flow [2025-03-04 15:32:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:32:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:32:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 291 transitions. [2025-03-04 15:32:38,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6643835616438356 [2025-03-04 15:32:38,994 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 895 flow. Second operand 6 states and 291 transitions. [2025-03-04 15:32:38,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 314 transitions, 3689 flow [2025-03-04 15:32:39,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 314 transitions, 3544 flow, removed 25 selfloop flow, removed 8 redundant places. [2025-03-04 15:32:39,458 INFO L231 Difference]: Finished difference. Result has 110 places, 105 transitions, 856 flow [2025-03-04 15:32:39,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=856, PETRI_PLACES=110, PETRI_TRANSITIONS=105} [2025-03-04 15:32:39,458 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 53 predicate places. [2025-03-04 15:32:39,458 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 105 transitions, 856 flow [2025-03-04 15:32:39,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.166666666666664) internal successors, (235), 6 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:39,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:39,459 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:39,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:32:39,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 15:32:39,659 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:39,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:39,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1526573170, now seen corresponding path program 1 times [2025-03-04 15:32:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:39,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274160223] [2025-03-04 15:32:39,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:39,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:39,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:39,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:39,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:39,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:39,718 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:39,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:39,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274160223] [2025-03-04 15:32:39,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274160223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:39,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:39,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:32:39,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749270412] [2025-03-04 15:32:39,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:39,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:32:39,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:39,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:32:39,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:32:39,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 73 [2025-03-04 15:32:39,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 856 flow. Second operand has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:39,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:39,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 73 [2025-03-04 15:32:39,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:42,475 INFO L124 PetriNetUnfolderBase]: 27265/42111 cut-off events. [2025-03-04 15:32:42,475 INFO L125 PetriNetUnfolderBase]: For 126674/128026 co-relation queries the response was YES. [2025-03-04 15:32:42,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140329 conditions, 42111 events. 27265/42111 cut-off events. For 126674/128026 co-relation queries the response was YES. Maximal size of possible extension queue 2125. Compared 336290 event pairs, 5813 based on Foata normal form. 400/41733 useless extension candidates. Maximal degree in co-relation 140299. Up to 16318 conditions per place. [2025-03-04 15:32:42,909 INFO L140 encePairwiseOnDemand]: 61/73 looper letters, 190 selfloop transitions, 49 changer transitions 0/253 dead transitions. [2025-03-04 15:32:42,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 253 transitions, 2170 flow [2025-03-04 15:32:42,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:32:42,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:32:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 480 transitions. [2025-03-04 15:32:42,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.547945205479452 [2025-03-04 15:32:42,910 INFO L175 Difference]: Start difference. First operand has 110 places, 105 transitions, 856 flow. Second operand 12 states and 480 transitions. [2025-03-04 15:32:42,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 253 transitions, 2170 flow [2025-03-04 15:32:44,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 253 transitions, 2086 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-04 15:32:44,050 INFO L231 Difference]: Finished difference. Result has 120 places, 116 transitions, 1080 flow [2025-03-04 15:32:44,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1080, PETRI_PLACES=120, PETRI_TRANSITIONS=116} [2025-03-04 15:32:44,050 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 63 predicate places. [2025-03-04 15:32:44,050 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 116 transitions, 1080 flow [2025-03-04 15:32:44,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.444444444444443) internal successors, (247), 9 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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:44,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:44,050 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:44,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 15:32:44,050 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:44,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1752658435, now seen corresponding path program 1 times [2025-03-04 15:32:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:44,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323305567] [2025-03-04 15:32:44,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:44,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:32:44,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:32:44,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:44,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:44,084 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:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323305567] [2025-03-04 15:32:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323305567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:32:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983345869] [2025-03-04 15:32:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:44,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:32:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:44,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:32:44,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:32:44,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 73 [2025-03-04 15:32:44,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 116 transitions, 1080 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:44,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:44,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 73 [2025-03-04 15:32:44,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:47,097 INFO L124 PetriNetUnfolderBase]: 25328/39172 cut-off events. [2025-03-04 15:32:47,098 INFO L125 PetriNetUnfolderBase]: For 142436/146359 co-relation queries the response was YES. [2025-03-04 15:32:47,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131906 conditions, 39172 events. 25328/39172 cut-off events. For 142436/146359 co-relation queries the response was YES. Maximal size of possible extension queue 2011. Compared 309211 event pairs, 3714 based on Foata normal form. 786/39699 useless extension candidates. Maximal degree in co-relation 131874. Up to 11581 conditions per place. [2025-03-04 15:32:47,278 INFO L140 encePairwiseOnDemand]: 64/73 looper letters, 215 selfloop transitions, 46 changer transitions 0/277 dead transitions. [2025-03-04 15:32:47,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 277 transitions, 2355 flow [2025-03-04 15:32:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:32:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:32:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 531 transitions. [2025-03-04 15:32:47,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6061643835616438 [2025-03-04 15:32:47,282 INFO L175 Difference]: Start difference. First operand has 120 places, 116 transitions, 1080 flow. Second operand 12 states and 531 transitions. [2025-03-04 15:32:47,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 277 transitions, 2355 flow [2025-03-04 15:32:48,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 277 transitions, 2286 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:32:48,632 INFO L231 Difference]: Finished difference. Result has 124 places, 121 transitions, 1171 flow [2025-03-04 15:32:48,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=978, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1171, PETRI_PLACES=124, PETRI_TRANSITIONS=121} [2025-03-04 15:32:48,632 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 67 predicate places. [2025-03-04 15:32:48,632 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 121 transitions, 1171 flow [2025-03-04 15:32:48,632 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:48,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:48,633 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:48,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 15:32:48,633 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:48,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1740169371, now seen corresponding path program 1 times [2025-03-04 15:32:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:48,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509376812] [2025-03-04 15:32:48,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:48,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:48,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:32:48,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:32:48,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:48,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:48,683 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:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509376812] [2025-03-04 15:32:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509376812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:48,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:32:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140952240] [2025-03-04 15:32:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:48,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:32:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:48,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:32:48,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:32:48,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-03-04 15:32:48,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 121 transitions, 1171 flow. Second operand has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:48,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:48,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-03-04 15:32:48,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:52,280 INFO L124 PetriNetUnfolderBase]: 37552/61378 cut-off events. [2025-03-04 15:32:52,281 INFO L125 PetriNetUnfolderBase]: For 206477/210747 co-relation queries the response was YES. [2025-03-04 15:32:52,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194648 conditions, 61378 events. 37552/61378 cut-off events. For 206477/210747 co-relation queries the response was YES. Maximal size of possible extension queue 3160. Compared 563417 event pairs, 18931 based on Foata normal form. 2066/62121 useless extension candidates. Maximal degree in co-relation 194615. Up to 23657 conditions per place. [2025-03-04 15:32:52,837 INFO L140 encePairwiseOnDemand]: 62/73 looper letters, 180 selfloop transitions, 103 changer transitions 0/312 dead transitions. [2025-03-04 15:32:52,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 312 transitions, 3460 flow [2025-03-04 15:32:52,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 15:32:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 15:32:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 480 transitions. [2025-03-04 15:32:52,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.547945205479452 [2025-03-04 15:32:52,838 INFO L175 Difference]: Start difference. First operand has 124 places, 121 transitions, 1171 flow. Second operand 12 states and 480 transitions. [2025-03-04 15:32:52,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 312 transitions, 3460 flow [2025-03-04 15:32:54,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 312 transitions, 3282 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-03-04 15:32:54,469 INFO L231 Difference]: Finished difference. Result has 138 places, 203 transitions, 2578 flow [2025-03-04 15:32:54,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=1104, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2578, PETRI_PLACES=138, PETRI_TRANSITIONS=203} [2025-03-04 15:32:54,470 INFO L279 CegarLoopForPetriNet]: 57 programPoint places, 81 predicate places. [2025-03-04 15:32:54,470 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 203 transitions, 2578 flow [2025-03-04 15:32:54,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.875) internal successors, (239), 8 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:54,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:54,470 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:54,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 15:32:54,470 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:54,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash -79127703, now seen corresponding path program 1 times [2025-03-04 15:32:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557554662] [2025-03-04 15:32:54,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:54,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:54,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:32:54,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:32:54,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:54,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:54,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:54,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557554662] [2025-03-04 15:32:54,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557554662] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:32:54,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733759167] [2025-03-04 15:32:54,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:32:54,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:54,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:54,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:32:54,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:32:54,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:32:54,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:32:54,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:32:54,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:54,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:32:54,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:32:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:54,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:32:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:54,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733759167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:32:54,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:32:54,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 15:32:54,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957705349] [2025-03-04 15:32:54,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:32:54,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 15:32:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:54,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 15:32:54,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:32:54,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 73 [2025-03-04 15:32:54,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 203 transitions, 2578 flow. Second operand has 13 states, 13 states have (on average 29.846153846153847) internal successors, (388), 13 states have internal predecessors, (388), 0 states have call successors, (0), 0 states 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,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:54,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 73 [2025-03-04 15:32:54,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:59,730 INFO L124 PetriNetUnfolderBase]: 41932/65824 cut-off events. [2025-03-04 15:32:59,731 INFO L125 PetriNetUnfolderBase]: For 262991/272836 co-relation queries the response was YES. [2025-03-04 15:33:00,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223615 conditions, 65824 events. 41932/65824 cut-off events. For 262991/272836 co-relation queries the response was YES. Maximal size of possible extension queue 3364. Compared 569653 event pairs, 2643 based on Foata normal form. 2691/68313 useless extension candidates. Maximal degree in co-relation 223575. Up to 10073 conditions per place. [2025-03-04 15:33:00,154 INFO L140 encePairwiseOnDemand]: 63/73 looper letters, 344 selfloop transitions, 137 changer transitions 2/499 dead transitions. [2025-03-04 15:33:00,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 499 transitions, 5013 flow [2025-03-04 15:33:00,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:33:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-04 15:33:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 869 transitions. [2025-03-04 15:33:00,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5952054794520548 [2025-03-04 15:33:00,155 INFO L175 Difference]: Start difference. First operand has 138 places, 203 transitions, 2578 flow. Second operand 20 states and 869 transitions. [2025-03-04 15:33:00,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 499 transitions, 5013 flow