./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/exponential-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/exponential-4.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 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:45:10,436 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:45:10,489 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:45:10,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:45:10,493 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:45:10,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:45:10,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:45:10,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:45:10,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:45:10,508 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:45:10,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:45:10,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:45:10,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:45:10,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:45:10,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:45:10,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:45:10,509 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:45:10,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:45:10,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:45:10,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:45:10,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:45:10,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:45:10,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:45:10,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:45:10,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:45:10,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:45:10,511 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 -> 6e0717c26865b2b98bbf38ebc229049821d555def6fcecec3e56a64fb6f63f98 [2025-03-09 06:45:10,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:45:10,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:45:10,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:45:10,757 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:45:10,757 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:45:10,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-4.i [2025-03-09 06:45:11,952 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88202fbbd/4f41def6867b45748ec497003223b744/FLAG8848710a1 [2025-03-09 06:45:12,253 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:45:12,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-4.i [2025-03-09 06:45:12,270 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88202fbbd/4f41def6867b45748ec497003223b744/FLAG8848710a1 [2025-03-09 06:45:12,288 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88202fbbd/4f41def6867b45748ec497003223b744 [2025-03-09 06:45:12,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:45:12,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:45:12,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:45:12,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:45:12,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:45:12,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ae7f66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12, skipping insertion in model container [2025-03-09 06:45:12,300 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,331 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:45:12,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:45:12,608 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:45:12,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:45:12,697 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:45:12,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12 WrapperNode [2025-03-09 06:45:12,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:45:12,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:45:12,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:45:12,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:45:12,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,717 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,733 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2025-03-09 06:45:12,734 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:45:12,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:45:12,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:45:12,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:45:12,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,756 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-09 06:45:12,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,763 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,765 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:45:12,771 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:45:12,771 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:45:12,771 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:45:12,772 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (1/1) ... [2025-03-09 06:45:12,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:45:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:45:12,799 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-09 06:45:12,804 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-09 06:45:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:45:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-09 06:45:12,820 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-09 06:45:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-09 06:45:12,820 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-09 06:45:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:45:12,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:45:12,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:45:12,821 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:45:12,921 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:45:12,923 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:45:13,078 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:45:13,078 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:45:13,167 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:45:13,167 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:45:13,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:45:13 BoogieIcfgContainer [2025-03-09 06:45:13,168 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:45:13,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:45:13,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:45:13,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:45:13,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:45:12" (1/3) ... [2025-03-09 06:45:13,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784cb178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:45:13, skipping insertion in model container [2025-03-09 06:45:13,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:12" (2/3) ... [2025-03-09 06:45:13,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784cb178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:45:13, skipping insertion in model container [2025-03-09 06:45:13,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:45:13" (3/3) ... [2025-03-09 06:45:13,178 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-4.i [2025-03-09 06:45:13,190 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:45:13,192 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-4.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-09 06:45:13,193 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:45:13,235 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:13,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 58 flow [2025-03-09 06:45:13,290 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-03-09 06:45:13,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:13,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 32 events. 2/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 23. Up to 4 conditions per place. [2025-03-09 06:45:13,295 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 58 flow [2025-03-09 06:45:13,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 53 flow [2025-03-09 06:45:13,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:13,318 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;@4d827d5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:13,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:13,324 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:13,325 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:13,325 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:13,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:13,325 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:13,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:13,333 INFO L85 PathProgramCache]: Analyzing trace with hash 5736783, now seen corresponding path program 1 times [2025-03-09 06:45:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:13,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110842960] [2025-03-09 06:45:13,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:13,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:13,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:13,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:13,536 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-09 06:45:13,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:13,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110842960] [2025-03-09 06:45:13,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110842960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:13,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:13,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:13,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425277653] [2025-03-09 06:45:13,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:13,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:45:13,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:13,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:45:13,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:45:13,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2025-03-09 06:45:13,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 06:45:13,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:13,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2025-03-09 06:45:13,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:13,668 INFO L124 PetriNetUnfolderBase]: 77/190 cut-off events. [2025-03-09 06:45:13,668 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:45:13,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 190 events. 77/190 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 800 event pairs, 20 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 320. Up to 94 conditions per place. [2025-03-09 06:45:13,672 INFO L140 encePairwiseOnDemand]: 22/25 looper letters, 17 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2025-03-09 06:45:13,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 101 flow [2025-03-09 06:45:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:45:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:45:13,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2025-03-09 06:45:13,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:45:13,684 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 53 flow. Second operand 3 states and 50 transitions. [2025-03-09 06:45:13,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 101 flow [2025-03-09 06:45:13,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:13,690 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 60 flow [2025-03-09 06:45:13,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2025-03-09 06:45:13,696 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2025-03-09 06:45:13,696 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 60 flow [2025-03-09 06:45:13,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-09 06:45:13,697 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:13,697 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:13,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:45:13,698 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:13,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash -904909961, now seen corresponding path program 1 times [2025-03-09 06:45:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:13,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103326982] [2025-03-09 06:45:13,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:13,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:13,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:13,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:13,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:13,798 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-09 06:45:13,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:13,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103326982] [2025-03-09 06:45:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103326982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:13,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:13,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692768403] [2025-03-09 06:45:13,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:13,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:13,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:13,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:13,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:13,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-09 06:45:13,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-09 06:45:13,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:13,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-09 06:45:13,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:13,895 INFO L124 PetriNetUnfolderBase]: 77/181 cut-off events. [2025-03-09 06:45:13,895 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-09 06:45:13,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 181 events. 77/181 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 713 event pairs, 8 based on Foata normal form. 18/189 useless extension candidates. Maximal degree in co-relation 338. Up to 94 conditions per place. [2025-03-09 06:45:13,897 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 20 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2025-03-09 06:45:13,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 120 flow [2025-03-09 06:45:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:13,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-03-09 06:45:13,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.57 [2025-03-09 06:45:13,900 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 60 flow. Second operand 4 states and 57 transitions. [2025-03-09 06:45:13,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 120 flow [2025-03-09 06:45:13,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:45:13,901 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 58 flow [2025-03-09 06:45:13,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2025-03-09 06:45:13,902 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2025-03-09 06:45:13,902 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 58 flow [2025-03-09 06:45:13,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-09 06:45:13,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:13,902 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:13,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:45:13,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:13,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:13,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1337210635, now seen corresponding path program 1 times [2025-03-09 06:45:13,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:13,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800713791] [2025-03-09 06:45:13,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:13,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:13,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:45:13,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:45:13,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:13,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:13,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:45:13,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:45:13,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:45:13,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:13,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:13,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:45:13,944 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:45:13,944 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 06:45:13,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 06:45:13,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 06:45:13,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 06:45:13,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 06:45:13,946 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-09 06:45:13,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:45:13,947 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-09 06:45:13,950 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:45:13,951 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:45:13,969 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:13,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 86 flow [2025-03-09 06:45:13,977 INFO L124 PetriNetUnfolderBase]: 3/54 cut-off events. [2025-03-09 06:45:13,977 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:45:13,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 54 events. 3/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 49. Up to 6 conditions per place. [2025-03-09 06:45:13,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 86 flow [2025-03-09 06:45:13,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 80 flow [2025-03-09 06:45:13,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:13,980 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;@4d827d5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:13,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:13,981 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:13,981 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:13,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:13,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:13,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:13,982 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:13,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash 6752655, now seen corresponding path program 1 times [2025-03-09 06:45:13,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:13,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894194125] [2025-03-09 06:45:13,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:13,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:13,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:13,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:13,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:13,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:14,040 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-09 06:45:14,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:14,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894194125] [2025-03-09 06:45:14,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894194125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:14,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:14,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:14,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160342844] [2025-03-09 06:45:14,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:14,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:45:14,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:14,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:45:14,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:45:14,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-03-09 06:45:14,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-09 06:45:14,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:14,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-03-09 06:45:14,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:14,275 INFO L124 PetriNetUnfolderBase]: 1490/2545 cut-off events. [2025-03-09 06:45:14,276 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2025-03-09 06:45:14,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4759 conditions, 2545 events. 1490/2545 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 15259 event pairs, 632 based on Foata normal form. 0/2320 useless extension candidates. Maximal degree in co-relation 1315. Up to 2047 conditions per place. [2025-03-09 06:45:14,301 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 26 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2025-03-09 06:45:14,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 152 flow [2025-03-09 06:45:14,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:45:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:45:14,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-09 06:45:14,312 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6565656565656566 [2025-03-09 06:45:14,312 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 80 flow. Second operand 3 states and 65 transitions. [2025-03-09 06:45:14,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 152 flow [2025-03-09 06:45:14,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:14,314 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 91 flow [2025-03-09 06:45:14,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-03-09 06:45:14,315 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2025-03-09 06:45:14,315 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 91 flow [2025-03-09 06:45:14,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-09 06:45:14,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:14,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:14,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:45:14,315 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:14,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -699335099, now seen corresponding path program 1 times [2025-03-09 06:45:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:14,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240670696] [2025-03-09 06:45:14,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:14,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:14,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:14,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:14,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:14,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:14,373 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-09 06:45:14,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:14,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240670696] [2025-03-09 06:45:14,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240670696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:14,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:14,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:14,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697221945] [2025-03-09 06:45:14,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:14,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:14,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:14,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:14,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:14,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 06:45:14,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:14,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:14,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:14,628 INFO L124 PetriNetUnfolderBase]: 1922/3022 cut-off events. [2025-03-09 06:45:14,628 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-09 06:45:14,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6021 conditions, 3022 events. 1922/3022 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 17194 event pairs, 836 based on Foata normal form. 18/2967 useless extension candidates. Maximal degree in co-relation 1663. Up to 2641 conditions per place. [2025-03-09 06:45:14,674 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 31 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-03-09 06:45:14,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 181 flow [2025-03-09 06:45:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-09 06:45:14,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-03-09 06:45:14,677 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 91 flow. Second operand 4 states and 76 transitions. [2025-03-09 06:45:14,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 181 flow [2025-03-09 06:45:14,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:14,679 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 107 flow [2025-03-09 06:45:14,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2025-03-09 06:45:14,681 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-09 06:45:14,682 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 107 flow [2025-03-09 06:45:14,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-09 06:45:14,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:14,682 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:45:14,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:14,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:14,682 INFO L85 PathProgramCache]: Analyzing trace with hash 767617185, now seen corresponding path program 1 times [2025-03-09 06:45:14,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:14,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248822417] [2025-03-09 06:45:14,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:14,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:14,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:45:14,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:45:14,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:14,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:14,745 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-09 06:45:14,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248822417] [2025-03-09 06:45:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248822417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:14,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060559023] [2025-03-09 06:45:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:14,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:14,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:14,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:14,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:14,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-09 06:45:14,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:14,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:14,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:15,050 INFO L124 PetriNetUnfolderBase]: 2402/3697 cut-off events. [2025-03-09 06:45:15,050 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2025-03-09 06:45:15,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7557 conditions, 3697 events. 2402/3697 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 20674 event pairs, 1856 based on Foata normal form. 90/3667 useless extension candidates. Maximal degree in co-relation 2086. Up to 2729 conditions per place. [2025-03-09 06:45:15,079 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 39 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2025-03-09 06:45:15,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 51 transitions, 227 flow [2025-03-09 06:45:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-09 06:45:15,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-09 06:45:15,083 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 107 flow. Second operand 4 states and 82 transitions. [2025-03-09 06:45:15,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 51 transitions, 227 flow [2025-03-09 06:45:15,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 51 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:45:15,086 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 125 flow [2025-03-09 06:45:15,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, 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=125, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2025-03-09 06:45:15,088 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-03-09 06:45:15,088 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 125 flow [2025-03-09 06:45:15,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-09 06:45:15,089 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:15,089 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:15,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:45:15,089 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1674381621, now seen corresponding path program 1 times [2025-03-09 06:45:15,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:15,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664884262] [2025-03-09 06:45:15,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:15,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:15,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:15,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:15,181 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-09 06:45:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:15,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664884262] [2025-03-09 06:45:15,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664884262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:15,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:15,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:15,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746552831] [2025-03-09 06:45:15,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:15,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:15,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:15,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:15,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:15,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:15,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 125 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-09 06:45:15,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:15,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:15,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:15,539 INFO L124 PetriNetUnfolderBase]: 2162/3445 cut-off events. [2025-03-09 06:45:15,540 INFO L125 PetriNetUnfolderBase]: For 843/870 co-relation queries the response was YES. [2025-03-09 06:45:15,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7723 conditions, 3445 events. 2162/3445 cut-off events. For 843/870 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19842 event pairs, 728 based on Foata normal form. 81/3516 useless extension candidates. Maximal degree in co-relation 4706. Up to 2385 conditions per place. [2025-03-09 06:45:15,559 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 38 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2025-03-09 06:45:15,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 52 transitions, 243 flow [2025-03-09 06:45:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2025-03-09 06:45:15,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-09 06:45:15,560 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 125 flow. Second operand 6 states and 102 transitions. [2025-03-09 06:45:15,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 52 transitions, 243 flow [2025-03-09 06:45:15,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 241 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:15,567 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 129 flow [2025-03-09 06:45:15,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=34} [2025-03-09 06:45:15,568 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-03-09 06:45:15,568 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 129 flow [2025-03-09 06:45:15,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-09 06:45:15,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:15,569 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:15,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:45:15,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1677835587, now seen corresponding path program 1 times [2025-03-09 06:45:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:15,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843527844] [2025-03-09 06:45:15,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:15,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:15,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:15,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:15,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:15,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:45:15,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:15,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843527844] [2025-03-09 06:45:15,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843527844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:15,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:15,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:15,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061188229] [2025-03-09 06:45:15,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:15,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:45:15,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:15,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:45:15,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:45:15,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:15,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 129 flow. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 06:45:15,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:15,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:15,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:15,844 INFO L124 PetriNetUnfolderBase]: 2105/3430 cut-off events. [2025-03-09 06:45:15,845 INFO L125 PetriNetUnfolderBase]: For 868/868 co-relation queries the response was YES. [2025-03-09 06:45:15,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7679 conditions, 3430 events. 2105/3430 cut-off events. For 868/868 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19910 event pairs, 296 based on Foata normal form. 9/3411 useless extension candidates. Maximal degree in co-relation 4833. Up to 1864 conditions per place. [2025-03-09 06:45:15,860 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 40 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-03-09 06:45:15,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 255 flow [2025-03-09 06:45:15,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:45:15,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:45:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2025-03-09 06:45:15,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5636363636363636 [2025-03-09 06:45:15,863 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 129 flow. Second operand 5 states and 93 transitions. [2025-03-09 06:45:15,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 255 flow [2025-03-09 06:45:15,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 53 transitions, 244 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 06:45:15,871 INFO L231 Difference]: Finished difference. Result has 53 places, 34 transitions, 130 flow [2025-03-09 06:45:15,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=53, PETRI_TRANSITIONS=34} [2025-03-09 06:45:15,871 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-03-09 06:45:15,871 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 34 transitions, 130 flow [2025-03-09 06:45:15,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-09 06:45:15,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:15,872 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:15,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:45:15,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash 366222873, now seen corresponding path program 1 times [2025-03-09 06:45:15,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:15,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743997133] [2025-03-09 06:45:15,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:15,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:15,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:15,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:15,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:15,934 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-09 06:45:15,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:15,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743997133] [2025-03-09 06:45:15,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743997133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:15,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:15,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013768708] [2025-03-09 06:45:15,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:15,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:15,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:15,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:15,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:15,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:15,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 34 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-09 06:45:15,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:15,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:15,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:16,172 INFO L124 PetriNetUnfolderBase]: 1889/3154 cut-off events. [2025-03-09 06:45:16,173 INFO L125 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2025-03-09 06:45:16,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7106 conditions, 3154 events. 1889/3154 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18645 event pairs, 80 based on Foata normal form. 81/3225 useless extension candidates. Maximal degree in co-relation 4260. Up to 1864 conditions per place. [2025-03-09 06:45:16,194 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 46 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2025-03-09 06:45:16,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 282 flow [2025-03-09 06:45:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2025-03-09 06:45:16,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-03-09 06:45:16,195 INFO L175 Difference]: Start difference. First operand has 53 places, 34 transitions, 130 flow. Second operand 6 states and 110 transitions. [2025-03-09 06:45:16,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 282 flow [2025-03-09 06:45:16,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 272 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:45:16,200 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 126 flow [2025-03-09 06:45:16,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2025-03-09 06:45:16,201 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-03-09 06:45:16,201 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 126 flow [2025-03-09 06:45:16,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 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-09 06:45:16,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:16,201 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:16,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:45:16,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:16,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash -247129963, now seen corresponding path program 1 times [2025-03-09 06:45:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820348838] [2025-03-09 06:45:16,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:16,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:45:16,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:45:16,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:16,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:16,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:45:16,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:45:16,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:45:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:16,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:16,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:45:16,225 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:45:16,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 06:45:16,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 06:45:16,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 06:45:16,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 06:45:16,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 06:45:16,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-09 06:45:16,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:45:16,227 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:16,227 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:45:16,227 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:45:16,248 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:16,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 118 flow [2025-03-09 06:45:16,256 INFO L124 PetriNetUnfolderBase]: 4/76 cut-off events. [2025-03-09 06:45:16,258 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-09 06:45:16,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 76 events. 4/76 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 79. Up to 8 conditions per place. [2025-03-09 06:45:16,259 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 41 transitions, 118 flow [2025-03-09 06:45:16,259 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 111 flow [2025-03-09 06:45:16,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:16,260 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;@4d827d5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:16,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:16,261 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:16,261 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:16,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:16,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:16,261 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:16,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:16,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash 8014799, now seen corresponding path program 1 times [2025-03-09 06:45:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:16,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046380510] [2025-03-09 06:45:16,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:16,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:16,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:16,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:16,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:16,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:16,299 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-09 06:45:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046380510] [2025-03-09 06:45:16,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046380510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:16,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:16,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477173688] [2025-03-09 06:45:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:16,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:45:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:16,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:45:16,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:45:16,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-09 06:45:16,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-09 06:45:16,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:16,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-09 06:45:16,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:17,883 INFO L124 PetriNetUnfolderBase]: 20687/29059 cut-off events. [2025-03-09 06:45:17,883 INFO L125 PetriNetUnfolderBase]: For 2323/2323 co-relation queries the response was YES. [2025-03-09 06:45:17,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56628 conditions, 29059 events. 20687/29059 cut-off events. For 2323/2323 co-relation queries the response was YES. Maximal size of possible extension queue 1231. Compared 183985 event pairs, 12620 based on Foata normal form. 0/27196 useless extension candidates. Maximal degree in co-relation 16444. Up to 26104 conditions per place. [2025-03-09 06:45:18,063 INFO L140 encePairwiseOnDemand]: 38/41 looper letters, 32 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2025-03-09 06:45:18,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 47 transitions, 195 flow [2025-03-09 06:45:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:45:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:45:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-09 06:45:18,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6260162601626016 [2025-03-09 06:45:18,065 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 111 flow. Second operand 3 states and 77 transitions. [2025-03-09 06:45:18,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 47 transitions, 195 flow [2025-03-09 06:45:18,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 190 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:18,076 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 118 flow [2025-03-09 06:45:18,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2025-03-09 06:45:18,077 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 2 predicate places. [2025-03-09 06:45:18,077 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 118 flow [2025-03-09 06:45:18,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-09 06:45:18,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:18,077 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:18,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:45:18,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:18,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:18,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1746997733, now seen corresponding path program 1 times [2025-03-09 06:45:18,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461306923] [2025-03-09 06:45:18,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:18,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:18,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:18,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:18,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:18,115 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-09 06:45:18,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:18,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461306923] [2025-03-09 06:45:18,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461306923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:18,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:18,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:18,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655006531] [2025-03-09 06:45:18,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:18,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:18,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:18,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:18,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:18,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:18,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:18,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:18,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:18,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:19,864 INFO L124 PetriNetUnfolderBase]: 26951/36178 cut-off events. [2025-03-09 06:45:19,865 INFO L125 PetriNetUnfolderBase]: For 2494/2494 co-relation queries the response was YES. [2025-03-09 06:45:19,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72956 conditions, 36178 events. 26951/36178 cut-off events. For 2494/2494 co-relation queries the response was YES. Maximal size of possible extension queue 1520. Compared 216063 event pairs, 16712 based on Foata normal form. 18/35538 useless extension candidates. Maximal degree in co-relation 21166. Up to 33988 conditions per place. [2025-03-09 06:45:20,036 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 37 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2025-03-09 06:45:20,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 220 flow [2025-03-09 06:45:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2025-03-09 06:45:20,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2025-03-09 06:45:20,038 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 118 flow. Second operand 4 states and 90 transitions. [2025-03-09 06:45:20,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 220 flow [2025-03-09 06:45:20,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 51 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:20,040 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 134 flow [2025-03-09 06:45:20,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2025-03-09 06:45:20,042 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 6 predicate places. [2025-03-09 06:45:20,042 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 134 flow [2025-03-09 06:45:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:20,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:20,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:20,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:45:20,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:20,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1801830473, now seen corresponding path program 1 times [2025-03-09 06:45:20,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:20,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528517362] [2025-03-09 06:45:20,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:20,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:20,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:45:20,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:45:20,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:20,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:20,082 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-09 06:45:20,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:20,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528517362] [2025-03-09 06:45:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528517362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846893079] [2025-03-09 06:45:20,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:20,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:20,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:20,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:20,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:20,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-09 06:45:20,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:20,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:20,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:22,485 INFO L124 PetriNetUnfolderBase]: 33263/44890 cut-off events. [2025-03-09 06:45:22,486 INFO L125 PetriNetUnfolderBase]: For 3228/3228 co-relation queries the response was YES. [2025-03-09 06:45:22,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91196 conditions, 44890 events. 33263/44890 cut-off events. For 3228/3228 co-relation queries the response was YES. Maximal size of possible extension queue 1464. Compared 275114 event pairs, 26156 based on Foata normal form. 819/44619 useless extension candidates. Maximal degree in co-relation 26509. Up to 34076 conditions per place. [2025-03-09 06:45:22,782 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 53 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2025-03-09 06:45:22,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 67 transitions, 298 flow [2025-03-09 06:45:22,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-09 06:45:22,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-09 06:45:22,783 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 134 flow. Second operand 4 states and 104 transitions. [2025-03-09 06:45:22,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 67 transitions, 298 flow [2025-03-09 06:45:22,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 67 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:45:22,793 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 152 flow [2025-03-09 06:45:22,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2025-03-09 06:45:22,794 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2025-03-09 06:45:22,794 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 152 flow [2025-03-09 06:45:22,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-09 06:45:22,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:22,794 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:22,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:45:22,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash 172862581, now seen corresponding path program 1 times [2025-03-09 06:45:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:22,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761358803] [2025-03-09 06:45:22,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:22,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:22,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:22,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:22,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:22,848 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-09 06:45:22,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:22,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761358803] [2025-03-09 06:45:22,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761358803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:22,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:22,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:22,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874500859] [2025-03-09 06:45:22,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:22,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:22,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:22,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:22,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:22,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:22,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 152 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-09 06:45:22,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:22,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:22,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:24,930 INFO L124 PetriNetUnfolderBase]: 30107/39820 cut-off events. [2025-03-09 06:45:24,930 INFO L125 PetriNetUnfolderBase]: For 11139/11868 co-relation queries the response was YES. [2025-03-09 06:45:25,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88515 conditions, 39820 events. 30107/39820 cut-off events. For 11139/11868 co-relation queries the response was YES. Maximal size of possible extension queue 1440. Compared 230165 event pairs, 11933 based on Foata normal form. 810/40539 useless extension candidates. Maximal degree in co-relation 56498. Up to 30087 conditions per place. [2025-03-09 06:45:25,179 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 48 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-03-09 06:45:25,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 64 transitions, 298 flow [2025-03-09 06:45:25,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-03-09 06:45:25,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2025-03-09 06:45:25,180 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 152 flow. Second operand 6 states and 124 transitions. [2025-03-09 06:45:25,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 64 transitions, 298 flow [2025-03-09 06:45:25,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 64 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:25,282 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 156 flow [2025-03-09 06:45:25,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=42} [2025-03-09 06:45:25,282 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-03-09 06:45:25,282 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 156 flow [2025-03-09 06:45:25,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-09 06:45:25,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:25,283 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:25,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:45:25,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:25,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:25,283 INFO L85 PathProgramCache]: Analyzing trace with hash 169846134, now seen corresponding path program 1 times [2025-03-09 06:45:25,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:25,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817355735] [2025-03-09 06:45:25,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:25,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:25,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:25,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:25,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:25,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:25,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:45:25,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:25,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817355735] [2025-03-09 06:45:25,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817355735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:25,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:25,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:25,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650876520] [2025-03-09 06:45:25,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:25,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:45:25,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:25,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:45:25,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:45:25,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:25,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-09 06:45:25,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:25,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:25,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:27,550 INFO L124 PetriNetUnfolderBase]: 30050/41494 cut-off events. [2025-03-09 06:45:27,550 INFO L125 PetriNetUnfolderBase]: For 10381/10624 co-relation queries the response was YES. [2025-03-09 06:45:27,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91429 conditions, 41494 events. 30050/41494 cut-off events. For 10381/10624 co-relation queries the response was YES. Maximal size of possible extension queue 1540. Compared 262822 event pairs, 8720 based on Foata normal form. 9/41232 useless extension candidates. Maximal degree in co-relation 58692. Up to 36856 conditions per place. [2025-03-09 06:45:27,833 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 50 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2025-03-09 06:45:27,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 320 flow [2025-03-09 06:45:28,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:45:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:45:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2025-03-09 06:45:28,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.551219512195122 [2025-03-09 06:45:28,003 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 156 flow. Second operand 5 states and 113 transitions. [2025-03-09 06:45:28,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 320 flow [2025-03-09 06:45:28,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 65 transitions, 305 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-09 06:45:28,133 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 163 flow [2025-03-09 06:45:28,133 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2025-03-09 06:45:28,134 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2025-03-09 06:45:28,134 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 163 flow [2025-03-09 06:45:28,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-09 06:45:28,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:28,134 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:28,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:45:28,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:28,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1063772930, now seen corresponding path program 1 times [2025-03-09 06:45:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:28,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244258695] [2025-03-09 06:45:28,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:28,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:28,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:28,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:28,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:28,181 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-09 06:45:28,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:28,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244258695] [2025-03-09 06:45:28,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244258695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:28,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:28,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:28,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339609634] [2025-03-09 06:45:28,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:28,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:28,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:28,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:28,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:28,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:28,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-09 06:45:28,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:28,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:28,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:30,260 INFO L124 PetriNetUnfolderBase]: 29834/41224 cut-off events. [2025-03-09 06:45:30,260 INFO L125 PetriNetUnfolderBase]: For 10264/10507 co-relation queries the response was YES. [2025-03-09 06:45:30,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90862 conditions, 41224 events. 29834/41224 cut-off events. For 10264/10507 co-relation queries the response was YES. Maximal size of possible extension queue 1540. Compared 261551 event pairs, 8504 based on Foata normal form. 81/41214 useless extension candidates. Maximal degree in co-relation 58125. Up to 36856 conditions per place. [2025-03-09 06:45:30,561 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 56 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2025-03-09 06:45:30,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 345 flow [2025-03-09 06:45:30,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:30,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2025-03-09 06:45:30,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5365853658536586 [2025-03-09 06:45:30,563 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 163 flow. Second operand 6 states and 132 transitions. [2025-03-09 06:45:30,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 345 flow [2025-03-09 06:45:30,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 72 transitions, 339 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:45:30,713 INFO L231 Difference]: Finished difference. Result has 69 places, 44 transitions, 179 flow [2025-03-09 06:45:30,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=44} [2025-03-09 06:45:30,714 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2025-03-09 06:45:30,714 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 44 transitions, 179 flow [2025-03-09 06:45:30,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-09 06:45:30,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:30,714 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:30,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:45:30,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:30,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:30,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1147727324, now seen corresponding path program 1 times [2025-03-09 06:45:30,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:30,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009700152] [2025-03-09 06:45:30,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:30,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:30,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:45:30,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:45:30,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:30,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:45:30,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:30,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009700152] [2025-03-09 06:45:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009700152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:30,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:45:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018106619] [2025-03-09 06:45:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:30,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:45:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:30,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:45:30,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:45:30,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:30,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 44 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-09 06:45:30,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:30,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:30,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:33,021 INFO L124 PetriNetUnfolderBase]: 28889/40852 cut-off events. [2025-03-09 06:45:33,021 INFO L125 PetriNetUnfolderBase]: For 11965/11965 co-relation queries the response was YES. [2025-03-09 06:45:33,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90609 conditions, 40852 events. 28889/40852 cut-off events. For 11965/11965 co-relation queries the response was YES. Maximal size of possible extension queue 1579. Compared 267689 event pairs, 2672 based on Foata normal form. 81/40842 useless extension candidates. Maximal degree in co-relation 59247. Up to 22600 conditions per place. [2025-03-09 06:45:33,306 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 68 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2025-03-09 06:45:33,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 85 transitions, 409 flow [2025-03-09 06:45:33,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:45:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:45:33,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2025-03-09 06:45:33,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5470383275261324 [2025-03-09 06:45:33,307 INFO L175 Difference]: Start difference. First operand has 69 places, 44 transitions, 179 flow. Second operand 7 states and 157 transitions. [2025-03-09 06:45:33,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 85 transitions, 409 flow [2025-03-09 06:45:33,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 85 transitions, 401 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:45:33,449 INFO L231 Difference]: Finished difference. Result has 72 places, 44 transitions, 187 flow [2025-03-09 06:45:33,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=72, PETRI_TRANSITIONS=44} [2025-03-09 06:45:33,450 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2025-03-09 06:45:33,450 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 44 transitions, 187 flow [2025-03-09 06:45:33,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 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-09 06:45:33,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:33,450 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:33,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:45:33,450 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:33,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:33,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1341977690, now seen corresponding path program 1 times [2025-03-09 06:45:33,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:33,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728152867] [2025-03-09 06:45:33,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:33,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:33,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:45:33,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:45:33,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:33,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:33,524 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-09 06:45:33,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:33,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728152867] [2025-03-09 06:45:33,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728152867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:33,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:45:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923022631] [2025-03-09 06:45:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:33,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:45:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:33,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:45:33,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:45:33,534 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:33,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 44 transitions, 187 flow. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:33,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:33,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:33,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:35,669 INFO L124 PetriNetUnfolderBase]: 25973/37390 cut-off events. [2025-03-09 06:45:35,669 INFO L125 PetriNetUnfolderBase]: For 14701/14701 co-relation queries the response was YES. [2025-03-09 06:45:35,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84313 conditions, 37390 events. 25973/37390 cut-off events. For 14701/14701 co-relation queries the response was YES. Maximal size of possible extension queue 1430. Compared 250997 event pairs, 728 based on Foata normal form. 729/38028 useless extension candidates. Maximal degree in co-relation 52950. Up to 22600 conditions per place. [2025-03-09 06:45:36,071 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 78 selfloop transitions, 7 changer transitions 0/96 dead transitions. [2025-03-09 06:45:36,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 96 transitions, 457 flow [2025-03-09 06:45:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:45:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:45:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 180 transitions. [2025-03-09 06:45:36,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2025-03-09 06:45:36,072 INFO L175 Difference]: Start difference. First operand has 72 places, 44 transitions, 187 flow. Second operand 8 states and 180 transitions. [2025-03-09 06:45:36,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 96 transitions, 457 flow [2025-03-09 06:45:36,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 96 transitions, 441 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-09 06:45:36,212 INFO L231 Difference]: Finished difference. Result has 71 places, 43 transitions, 179 flow [2025-03-09 06:45:36,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=71, PETRI_TRANSITIONS=43} [2025-03-09 06:45:36,212 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 19 predicate places. [2025-03-09 06:45:36,212 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 43 transitions, 179 flow [2025-03-09 06:45:36,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:36,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:36,213 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:36,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:45:36,213 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:36,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:36,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1150379965, now seen corresponding path program 1 times [2025-03-09 06:45:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073927027] [2025-03-09 06:45:36,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:36,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:36,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:45:36,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:45:36,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:36,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:36,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:45:36,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:45:36,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:45:36,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:36,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:36,231 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:45:36,231 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:45:36,231 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 06:45:36,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 06:45:36,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 06:45:36,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 06:45:36,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 06:45:36,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-09 06:45:36,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:45:36,232 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:36,233 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:45:36,233 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 06:45:36,249 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:36,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 49 transitions, 154 flow [2025-03-09 06:45:36,254 INFO L124 PetriNetUnfolderBase]: 5/98 cut-off events. [2025-03-09 06:45:36,255 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 06:45:36,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 98 events. 5/98 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 174 event pairs, 0 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 111. Up to 10 conditions per place. [2025-03-09 06:45:36,255 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 49 transitions, 154 flow [2025-03-09 06:45:36,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 47 transitions, 146 flow [2025-03-09 06:45:36,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:36,256 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;@4d827d5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:36,256 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:36,257 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:36,257 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:36,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:36,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:36,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:36,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:36,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash 9523215, now seen corresponding path program 1 times [2025-03-09 06:45:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:36,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365553553] [2025-03-09 06:45:36,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:36,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:36,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:36,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:36,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:36,275 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-09 06:45:36,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:36,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365553553] [2025-03-09 06:45:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365553553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:36,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:36,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:36,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016021630] [2025-03-09 06:45:36,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:45:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:36,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:45:36,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:45:36,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-03-09 06:45:36,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 146 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-09 06:45:36,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:36,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-03-09 06:45:36,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand