./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-theta/exponential-nondet.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-nondet.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f87ddde6d61a5d434f69c49dc65eaf95f54327ebb0ef5acca382e4d4744605ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:45:18,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:45:18,721 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:18,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:45:18,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:45:18,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:45:18,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:45:18,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:45:18,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:45:18,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:45:18,744 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:45:18,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:45:18,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:45:18,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:45:18,745 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:45:18,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:45:18,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:45:18,746 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:45:18,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:45:18,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:45:18,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:45:18,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:45:18,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:45:18,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:45:18,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:45:18,748 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 -> f87ddde6d61a5d434f69c49dc65eaf95f54327ebb0ef5acca382e4d4744605ae [2025-03-09 06:45:18,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:45:19,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:45:19,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:45:19,008 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:45:19,008 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:45:19,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-nondet.i [2025-03-09 06:45:20,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffca6b7a3/950f8dd20cd94aafa70fa841e2580955/FLAG6f0f9076c [2025-03-09 06:45:20,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:45:20,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-nondet.i [2025-03-09 06:45:20,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffca6b7a3/950f8dd20cd94aafa70fa841e2580955/FLAG6f0f9076c [2025-03-09 06:45:20,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffca6b7a3/950f8dd20cd94aafa70fa841e2580955 [2025-03-09 06:45:20,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:45:20,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:45:20,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:45:20,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:45:20,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:45:20,464 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:45:20" (1/1) ... [2025-03-09 06:45:20,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dbe50d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:20, skipping insertion in model container [2025-03-09 06:45:20,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:45:20" (1/1) ... [2025-03-09 06:45:20,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:45:20,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:45:20,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:45:20,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:45:20,818 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:45:20,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:20 WrapperNode [2025-03-09 06:45:20,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:45:20,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:45:20,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:45:20,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:45:20,825 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:20" (1/1) ... [2025-03-09 06:45:20,832 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:20" (1/1) ... [2025-03-09 06:45:20,846 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2025-03-09 06:45:20,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:45:20,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:45:20,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:45:20,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:45:20,852 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:20" (1/1) ... [2025-03-09 06:45:20,852 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:20" (1/1) ... [2025-03-09 06:45:20,853 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:20" (1/1) ... [2025-03-09 06:45:20,868 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:20,870 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:20" (1/1) ... [2025-03-09 06:45:20,870 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:20" (1/1) ... [2025-03-09 06:45:20,873 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:20" (1/1) ... [2025-03-09 06:45:20,874 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:20" (1/1) ... [2025-03-09 06:45:20,874 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:20" (1/1) ... [2025-03-09 06:45:20,875 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:20" (1/1) ... [2025-03-09 06:45:20,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:45:20,877 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:45:20,877 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:45:20,877 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:45:20,878 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:20" (1/1) ... [2025-03-09 06:45:20,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:45:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:45:20,900 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:20,902 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:20,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:45:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-09 06:45:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-09 06:45:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-09 06:45:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-09 06:45:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:45:20,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:45:20,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:45:20,920 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:21,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:45:21,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:45:21,174 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:45:21,174 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:45:21,304 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:45:21,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:45:21,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:45:21 BoogieIcfgContainer [2025-03-09 06:45:21,306 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:45:21,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:45:21,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:45:21,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:45:21,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:45:20" (1/3) ... [2025-03-09 06:45:21,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f50002e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:45:21, skipping insertion in model container [2025-03-09 06:45:21,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:45:20" (2/3) ... [2025-03-09 06:45:21,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f50002e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:45:21, skipping insertion in model container [2025-03-09 06:45:21,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:45:21" (3/3) ... [2025-03-09 06:45:21,315 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-nondet.i [2025-03-09 06:45:21,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:45:21,329 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-nondet.i that has 3 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-09 06:45:21,329 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:45:21,368 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:21,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 25 transitions, 58 flow [2025-03-09 06:45:21,428 INFO L124 PetriNetUnfolderBase]: 2/32 cut-off events. [2025-03-09 06:45:21,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:21,435 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:21,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 25 transitions, 58 flow [2025-03-09 06:45:21,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 53 flow [2025-03-09 06:45:21,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:21,455 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;@6c59628c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:21,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:21,460 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:21,460 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:21,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:21,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:21,461 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:21,461 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:21,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 5921487, now seen corresponding path program 1 times [2025-03-09 06:45:21,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:21,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271321872] [2025-03-09 06:45:21,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:21,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:21,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:21,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:21,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:21,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:21,702 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:21,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:21,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271321872] [2025-03-09 06:45:21,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271321872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:21,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:21,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:21,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992250091] [2025-03-09 06:45:21,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:21,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:21,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:21,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:21,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:21,748 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-09 06:45:21,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:21,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:21,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-09 06:45:21,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:21,886 INFO L124 PetriNetUnfolderBase]: 126/266 cut-off events. [2025-03-09 06:45:21,888 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:45:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 266 events. 126/266 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1173 event pairs, 92 based on Foata normal form. 10/247 useless extension candidates. Maximal degree in co-relation 476. Up to 187 conditions per place. [2025-03-09 06:45:21,894 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 23 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-03-09 06:45:21,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 125 flow [2025-03-09 06:45:21,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:21,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:21,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-09 06:45:21,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 06:45:21,909 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 53 flow. Second operand 4 states and 60 transitions. [2025-03-09 06:45:21,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 125 flow [2025-03-09 06:45:21,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:21,917 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 74 flow [2025-03-09 06:45:21,919 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2025-03-09 06:45:21,923 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-03-09 06:45:21,924 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 74 flow [2025-03-09 06:45:21,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:21,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:21,924 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:21,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:45:21,924 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:21,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:21,925 INFO L85 PathProgramCache]: Analyzing trace with hash 302645565, now seen corresponding path program 1 times [2025-03-09 06:45:21,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158326992] [2025-03-09 06:45:21,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:21,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:21,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:21,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:21,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:21,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:21,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:21,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158326992] [2025-03-09 06:45:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158326992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:21,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:21,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339363847] [2025-03-09 06:45:21,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:21,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:21,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:21,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:21,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:21,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 25 [2025-03-09 06:45:21,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 74 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:21,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:21,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 25 [2025-03-09 06:45:21,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:22,067 INFO L124 PetriNetUnfolderBase]: 102/241 cut-off events. [2025-03-09 06:45:22,068 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-09 06:45:22,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 241 events. 102/241 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 970 event pairs, 8 based on Foata normal form. 9/249 useless extension candidates. Maximal degree in co-relation 485. Up to 136 conditions per place. [2025-03-09 06:45:22,070 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 27 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2025-03-09 06:45:22,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 172 flow [2025-03-09 06:45:22,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-03-09 06:45:22,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-03-09 06:45:22,071 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 74 flow. Second operand 4 states and 60 transitions. [2025-03-09 06:45:22,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 172 flow [2025-03-09 06:45:22,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:22,074 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 74 flow [2025-03-09 06:45:22,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=74, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-03-09 06:45:22,074 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2025-03-09 06:45:22,075 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 74 flow [2025-03-09 06:45:22,075 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:22,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:22,075 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 06:45:22,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:45:22,075 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:22,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 313494426, now seen corresponding path program 1 times [2025-03-09 06:45:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591790823] [2025-03-09 06:45:22,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:22,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:22,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:22,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:22,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:22,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:45:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591790823] [2025-03-09 06:45:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591790823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:22,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:22,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:22,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051212678] [2025-03-09 06:45:22,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:22,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:22,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:22,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:22,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 25 [2025-03-09 06:45:22,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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:22,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:22,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 25 [2025-03-09 06:45:22,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:22,258 INFO L124 PetriNetUnfolderBase]: 101/234 cut-off events. [2025-03-09 06:45:22,259 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-09 06:45:22,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 234 events. 101/234 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 940 event pairs, 20 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 495. Up to 136 conditions per place. [2025-03-09 06:45:22,262 INFO L140 encePairwiseOnDemand]: 21/25 looper letters, 19 selfloop transitions, 2 changer transitions 1/29 dead transitions. [2025-03-09 06:45:22,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 132 flow [2025-03-09 06:45:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-09 06:45:22,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-03-09 06:45:22,264 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 74 flow. Second operand 4 states and 61 transitions. [2025-03-09 06:45:22,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 132 flow [2025-03-09 06:45:22,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 126 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:45:22,266 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 78 flow [2025-03-09 06:45:22,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2025-03-09 06:45:22,266 INFO L279 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2025-03-09 06:45:22,266 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 78 flow [2025-03-09 06:45:22,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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:22,267 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:22,267 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:22,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:45:22,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:22,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:22,267 INFO L85 PathProgramCache]: Analyzing trace with hash 977820363, now seen corresponding path program 1 times [2025-03-09 06:45:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132718002] [2025-03-09 06:45:22,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:22,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:45:22,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:45:22,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:22,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:22,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:45:22,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:45:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:45:22,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:22,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:22,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:45:22,316 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:45:22,317 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 06:45:22,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 06:45:22,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 06:45:22,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 06:45:22,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 06:45:22,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-09 06:45:22,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:45:22,321 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-09 06:45:22,322 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:45:22,324 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-09 06:45:22,347 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:22,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 33 transitions, 86 flow [2025-03-09 06:45:22,358 INFO L124 PetriNetUnfolderBase]: 3/54 cut-off events. [2025-03-09 06:45:22,358 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-09 06:45:22,358 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:22,358 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 33 transitions, 86 flow [2025-03-09 06:45:22,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 80 flow [2025-03-09 06:45:22,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:22,362 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;@6c59628c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:22,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:22,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:22,365 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:22,365 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:22,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:22,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:22,365 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:22,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash 6937359, now seen corresponding path program 1 times [2025-03-09 06:45:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:22,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-03-09 06:45:22,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:22,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:22,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:22,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:22,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:22,426 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,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:22,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691770302] [2025-03-09 06:45:22,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691770302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:22,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:22,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578679955] [2025-03-09 06:45:22,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:22,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:22,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:22,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:22,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:22,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:22,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:22,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:22,787 INFO L124 PetriNetUnfolderBase]: 2403/3697 cut-off events. [2025-03-09 06:45:22,787 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2025-03-09 06:45:22,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7190 conditions, 3697 events. 2403/3697 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 21041 event pairs, 1856 based on Foata normal form. 91/3534 useless extension candidates. Maximal degree in co-relation 1960. Up to 2734 conditions per place. [2025-03-09 06:45:22,809 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 37 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-03-09 06:45:22,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 196 flow [2025-03-09 06:45:22,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:22,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-09 06:45:22,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6212121212121212 [2025-03-09 06:45:22,811 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 80 flow. Second operand 4 states and 82 transitions. [2025-03-09 06:45:22,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 196 flow [2025-03-09 06:45:22,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:22,814 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 101 flow [2025-03-09 06:45:22,815 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=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2025-03-09 06:45:22,815 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2025-03-09 06:45:22,816 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 101 flow [2025-03-09 06:45:22,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:22,816 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:22,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:45:22,816 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:22,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash 508220427, now seen corresponding path program 1 times [2025-03-09 06:45:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989358084] [2025-03-09 06:45:22,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:22,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:22,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:22,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:22,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:22,867 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,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:22,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989358084] [2025-03-09 06:45:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989358084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:22,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:22,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048145594] [2025-03-09 06:45:22,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:22,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:22,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:22,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:22,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:22,874 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:22,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 101 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:22,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:22,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:22,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:23,168 INFO L124 PetriNetUnfolderBase]: 2379/3724 cut-off events. [2025-03-09 06:45:23,169 INFO L125 PetriNetUnfolderBase]: For 508/535 co-relation queries the response was YES. [2025-03-09 06:45:23,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 3724 events. 2379/3724 cut-off events. For 508/535 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 21449 event pairs, 1052 based on Foata normal form. 9/3642 useless extension candidates. Maximal degree in co-relation 4906. Up to 3277 conditions per place. [2025-03-09 06:45:23,193 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 38 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2025-03-09 06:45:23,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 231 flow [2025-03-09 06:45:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-03-09 06:45:23,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5984848484848485 [2025-03-09 06:45:23,195 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 101 flow. Second operand 4 states and 79 transitions. [2025-03-09 06:45:23,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 231 flow [2025-03-09 06:45:23,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 50 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:23,203 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 121 flow [2025-03-09 06:45:23,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=121, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2025-03-09 06:45:23,204 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2025-03-09 06:45:23,204 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 121 flow [2025-03-09 06:45:23,204 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:23,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:23,204 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 06:45:23,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:45:23,204 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:23,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash 512598875, now seen corresponding path program 1 times [2025-03-09 06:45:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:23,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017334542] [2025-03-09 06:45:23,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:23,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:23,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:23,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:23,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:45:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017334542] [2025-03-09 06:45:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017334542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:23,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:23,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:23,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676140369] [2025-03-09 06:45:23,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:23,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:23,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:23,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:23,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:23,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 33 [2025-03-09 06:45:23,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:23,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:23,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 33 [2025-03-09 06:45:23,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:23,523 INFO L124 PetriNetUnfolderBase]: 1946/3233 cut-off events. [2025-03-09 06:45:23,523 INFO L125 PetriNetUnfolderBase]: For 564/618 co-relation queries the response was YES. [2025-03-09 06:45:23,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7062 conditions, 3233 events. 1946/3233 cut-off events. For 564/618 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 19328 event pairs, 848 based on Foata normal form. 1/3222 useless extension candidates. Maximal degree in co-relation 4136. Up to 2683 conditions per place. [2025-03-09 06:45:23,546 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 28 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2025-03-09 06:45:23,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 199 flow [2025-03-09 06:45:23,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:23,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:23,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-03-09 06:45:23,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2025-03-09 06:45:23,547 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 121 flow. Second operand 4 states and 78 transitions. [2025-03-09 06:45:23,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 199 flow [2025-03-09 06:45:23,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:23,553 INFO L231 Difference]: Finished difference. Result has 52 places, 35 transitions, 129 flow [2025-03-09 06:45:23,553 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=129, PETRI_PLACES=52, PETRI_TRANSITIONS=35} [2025-03-09 06:45:23,553 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-03-09 06:45:23,553 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 35 transitions, 129 flow [2025-03-09 06:45:23,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:23,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:23,554 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:23,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:45:23,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:23,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:23,555 INFO L85 PathProgramCache]: Analyzing trace with hash -597634429, now seen corresponding path program 1 times [2025-03-09 06:45:23,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:23,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517321044] [2025-03-09 06:45:23,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:23,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:23,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:23,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:23,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:23,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:23,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517321044] [2025-03-09 06:45:23,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517321044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:45:23,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868057242] [2025-03-09 06:45:23,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:23,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:45:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:45:23,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:45:23,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:45:23,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:23,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:23,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:23,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:23,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:45:23,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:45:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:23,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:45:23,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868057242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:23,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:45:23,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:45:23,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26193272] [2025-03-09 06:45:23,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:23,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:23,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:23,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:23,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:45:23,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:23,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 35 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:23,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:23,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:23,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:24,085 INFO L124 PetriNetUnfolderBase]: 2174/3406 cut-off events. [2025-03-09 06:45:24,086 INFO L125 PetriNetUnfolderBase]: For 705/741 co-relation queries the response was YES. [2025-03-09 06:45:24,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7671 conditions, 3406 events. 2174/3406 cut-off events. For 705/741 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19258 event pairs, 944 based on Foata normal form. 90/3394 useless extension candidates. Maximal degree in co-relation 4125. Up to 1367 conditions per place. [2025-03-09 06:45:24,111 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 52 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2025-03-09 06:45:24,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 303 flow [2025-03-09 06:45:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:24,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-03-09 06:45:24,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5858585858585859 [2025-03-09 06:45:24,114 INFO L175 Difference]: Start difference. First operand has 52 places, 35 transitions, 129 flow. Second operand 6 states and 116 transitions. [2025-03-09 06:45:24,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 303 flow [2025-03-09 06:45:24,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 297 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:45:24,122 INFO L231 Difference]: Finished difference. Result has 52 places, 34 transitions, 129 flow [2025-03-09 06:45:24,122 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:24,123 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2025-03-09 06:45:24,123 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 34 transitions, 129 flow [2025-03-09 06:45:24,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:24,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:24,124 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:24,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:45:24,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:45:24,324 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:24,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:24,325 INFO L85 PathProgramCache]: Analyzing trace with hash -601088395, now seen corresponding path program 1 times [2025-03-09 06:45:24,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:24,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649276162] [2025-03-09 06:45:24,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:24,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:24,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:24,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:24,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:24,381 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:24,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:24,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649276162] [2025-03-09 06:45:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649276162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:24,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515414845] [2025-03-09 06:45:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:24,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:24,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:24,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:24,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:24,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:24,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 34 transitions, 129 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:24,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:24,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:24,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:24,669 INFO L124 PetriNetUnfolderBase]: 2162/3388 cut-off events. [2025-03-09 06:45:24,669 INFO L125 PetriNetUnfolderBase]: For 1365/1365 co-relation queries the response was YES. [2025-03-09 06:45:24,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7963 conditions, 3388 events. 2162/3388 cut-off events. For 1365/1365 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 19178 event pairs, 728 based on Foata normal form. 81/3378 useless extension candidates. Maximal degree in co-relation 4802. Up to 2385 conditions per place. [2025-03-09 06:45:24,684 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 38 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2025-03-09 06:45:24,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 247 flow [2025-03-09 06:45:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2025-03-09 06:45:24,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2025-03-09 06:45:24,686 INFO L175 Difference]: Start difference. First operand has 52 places, 34 transitions, 129 flow. Second operand 6 states and 102 transitions. [2025-03-09 06:45:24,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 247 flow [2025-03-09 06:45:24,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 233 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 06:45:24,691 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 121 flow [2025-03-09 06:45:24,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=121, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2025-03-09 06:45:24,692 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-03-09 06:45:24,692 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 121 flow [2025-03-09 06:45:24,692 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:24,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:24,692 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:24,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:45:24,692 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:24,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:24,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1453870881, now seen corresponding path program 1 times [2025-03-09 06:45:24,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:24,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-03-09 06:45:24,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:24,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:24,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:24,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:24,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:24,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:24,748 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:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:24,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342137267] [2025-03-09 06:45:24,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342137267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:24,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:24,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:24,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677496617] [2025-03-09 06:45:24,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:24,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:24,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:24,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:24,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:24,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 121 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:24,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:24,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:24,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:24,961 INFO L124 PetriNetUnfolderBase]: 1946/3199 cut-off events. [2025-03-09 06:45:24,961 INFO L125 PetriNetUnfolderBase]: For 1066/1066 co-relation queries the response was YES. [2025-03-09 06:45:24,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6973 conditions, 3199 events. 1946/3199 cut-off events. For 1066/1066 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 18485 event pairs, 80 based on Foata normal form. 81/3270 useless extension candidates. Maximal degree in co-relation 4155. Up to 1864 conditions per place. [2025-03-09 06:45:24,975 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 51 selfloop transitions, 5 changer transitions 0/64 dead transitions. [2025-03-09 06:45:24,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 303 flow [2025-03-09 06:45:24,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:24,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:24,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-09 06:45:24,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2025-03-09 06:45:24,977 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 121 flow. Second operand 6 states and 113 transitions. [2025-03-09 06:45:24,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 303 flow [2025-03-09 06:45:24,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 290 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-09 06:45:24,981 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 114 flow [2025-03-09 06:45:24,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=114, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2025-03-09 06:45:24,981 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2025-03-09 06:45:24,981 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 114 flow [2025-03-09 06:45:24,982 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:24,982 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:24,982 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:24,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:45:24,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:24,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1346797949, now seen corresponding path program 1 times [2025-03-09 06:45:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:24,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149463212] [2025-03-09 06:45:24,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:24,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:24,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:24,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:24,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:24,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149463212] [2025-03-09 06:45:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149463212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:45:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807396515] [2025-03-09 06:45:25,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:45:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:45:25,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:45:25,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:45:25,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:25,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:25,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:25,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:25,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:45:25,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:45:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:25,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:45:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807396515] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:45:25,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:45:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 06:45:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153447029] [2025-03-09 06:45:25,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:45:25,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:45:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:25,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:45:25,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:45:25,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 33 [2025-03-09 06:45:25,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 114 flow. Second operand has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:25,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 33 [2025-03-09 06:45:25,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:25,591 INFO L124 PetriNetUnfolderBase]: 3542/5512 cut-off events. [2025-03-09 06:45:25,592 INFO L125 PetriNetUnfolderBase]: For 2139/2139 co-relation queries the response was YES. [2025-03-09 06:45:25,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12041 conditions, 5512 events. 3542/5512 cut-off events. For 2139/2139 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 31352 event pairs, 1628 based on Foata normal form. 270/5770 useless extension candidates. Maximal degree in co-relation 4053. Up to 2411 conditions per place. [2025-03-09 06:45:25,619 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 86 selfloop transitions, 9 changer transitions 0/102 dead transitions. [2025-03-09 06:45:25,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 456 flow [2025-03-09 06:45:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:45:25,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:45:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2025-03-09 06:45:25,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.593939393939394 [2025-03-09 06:45:25,621 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 114 flow. Second operand 10 states and 196 transitions. [2025-03-09 06:45:25,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 456 flow [2025-03-09 06:45:25,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 102 transitions, 445 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:45:25,624 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 161 flow [2025-03-09 06:45:25,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=161, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2025-03-09 06:45:25,625 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-03-09 06:45:25,625 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 161 flow [2025-03-09 06:45:25,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.666666666666666) internal successors, (140), 12 states have internal predecessors, (140), 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,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:25,625 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:25,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:45:25,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 06:45:25,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === 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:25,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:25,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1305537893, now seen corresponding path program 1 times [2025-03-09 06:45:25,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:25,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954317986] [2025-03-09 06:45:25,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:25,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:25,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:45:25,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:45:25,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:25,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:25,839 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:45:25,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:45:25,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:45:25,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:25,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:25,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:45:25,853 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:45:25,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 06:45:25,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 06:45:25,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 06:45:25,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 06:45:25,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 06:45:25,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-09 06:45:25,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:45:25,854 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:25,854 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:45:25,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-09 06:45:25,870 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:25,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 41 transitions, 118 flow [2025-03-09 06:45:25,876 INFO L124 PetriNetUnfolderBase]: 4/76 cut-off events. [2025-03-09 06:45:25,877 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-09 06:45:25,877 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:25,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 41 transitions, 118 flow [2025-03-09 06:45:25,877 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 39 transitions, 111 flow [2025-03-09 06:45:25,878 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:25,878 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;@6c59628c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:25,878 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:25,879 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:25,879 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:25,879 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:25,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:25,880 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:25,880 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:25,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:25,880 INFO L85 PathProgramCache]: Analyzing trace with hash 8199503, now seen corresponding path program 1 times [2025-03-09 06:45:25,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:25,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821752938] [2025-03-09 06:45:25,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:25,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:25,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:25,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:25,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:25,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:25,903 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:25,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:25,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821752938] [2025-03-09 06:45:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821752938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:25,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:25,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:25,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37516144] [2025-03-09 06:45:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:25,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:25,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:25,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:25,909 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:25,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:25,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:25,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:28,184 INFO L124 PetriNetUnfolderBase]: 33264/44890 cut-off events. [2025-03-09 06:45:28,184 INFO L125 PetriNetUnfolderBase]: For 2383/2383 co-relation queries the response was YES. [2025-03-09 06:45:28,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88318 conditions, 44890 events. 33264/44890 cut-off events. For 2383/2383 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 277493 event pairs, 26156 based on Foata normal form. 820/43431 useless extension candidates. Maximal degree in co-relation 25546. Up to 34081 conditions per place. [2025-03-09 06:45:28,420 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 51 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-03-09 06:45:28,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 271 flow [2025-03-09 06:45:28,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-03-09 06:45:28,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6341463414634146 [2025-03-09 06:45:28,422 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 111 flow. Second operand 4 states and 104 transitions. [2025-03-09 06:45:28,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 271 flow [2025-03-09 06:45:28,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 266 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:28,429 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 128 flow [2025-03-09 06:45:28,429 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-03-09 06:45:28,429 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2025-03-09 06:45:28,430 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 128 flow [2025-03-09 06:45:28,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:28,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:28,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:45:28,430 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:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:28,431 INFO L85 PathProgramCache]: Analyzing trace with hash -539442207, now seen corresponding path program 1 times [2025-03-09 06:45:28,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:28,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871594725] [2025-03-09 06:45:28,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:28,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:28,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:28,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:28,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:28,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:28,454 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,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:28,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871594725] [2025-03-09 06:45:28,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871594725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:28,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:28,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:45:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852471340] [2025-03-09 06:45:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:28,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:28,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:28,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:28,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 128 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:28,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:28,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:28,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:31,049 INFO L124 PetriNetUnfolderBase]: 33240/44494 cut-off events. [2025-03-09 06:45:31,049 INFO L125 PetriNetUnfolderBase]: For 6295/6808 co-relation queries the response was YES. [2025-03-09 06:45:31,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94072 conditions, 44494 events. 33240/44494 cut-off events. For 6295/6808 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 267936 event pairs, 20816 based on Foata normal form. 9/43422 useless extension candidates. Maximal degree in co-relation 61390. Up to 41914 conditions per place. [2025-03-09 06:45:31,362 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 44 selfloop transitions, 3 changer transitions 0/58 dead transitions. [2025-03-09 06:45:31,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 270 flow [2025-03-09 06:45:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-03-09 06:45:31,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2025-03-09 06:45:31,364 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 128 flow. Second operand 4 states and 93 transitions. [2025-03-09 06:45:31,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 270 flow [2025-03-09 06:45:31,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 58 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:31,512 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 148 flow [2025-03-09 06:45:31,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=148, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2025-03-09 06:45:31,513 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2025-03-09 06:45:31,513 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 148 flow [2025-03-09 06:45:31,513 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:31,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:31,513 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 06:45:31,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:45:31,514 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:31,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash -541534172, now seen corresponding path program 1 times [2025-03-09 06:45:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606540509] [2025-03-09 06:45:31,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:31,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:45:31,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:45:31,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:31,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:45:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606540509] [2025-03-09 06:45:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606540509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443883891] [2025-03-09 06:45:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:31,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:31,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:31,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:31,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:31,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 41 [2025-03-09 06:45:31,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:31,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:31,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 41 [2025-03-09 06:45:31,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:33,600 INFO L124 PetriNetUnfolderBase]: 26975/37361 cut-off events. [2025-03-09 06:45:33,600 INFO L125 PetriNetUnfolderBase]: For 6513/7539 co-relation queries the response was YES. [2025-03-09 06:45:33,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80639 conditions, 37361 events. 26975/37361 cut-off events. For 6513/7539 co-relation queries the response was YES. Maximal size of possible extension queue 1373. Compared 234796 event pairs, 16724 based on Foata normal form. 1/37109 useless extension candidates. Maximal degree in co-relation 48794. Up to 34030 conditions per place. [2025-03-09 06:45:33,861 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 34 selfloop transitions, 2 changer transitions 1/50 dead transitions. [2025-03-09 06:45:33,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 50 transitions, 238 flow [2025-03-09 06:45:33,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:45:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:45:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-03-09 06:45:33,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5609756097560976 [2025-03-09 06:45:33,862 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 148 flow. Second operand 4 states and 92 transitions. [2025-03-09 06:45:33,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 50 transitions, 238 flow [2025-03-09 06:45:33,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 50 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:45:33,975 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 156 flow [2025-03-09 06:45:33,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-03-09 06:45:33,975 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-03-09 06:45:33,975 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 156 flow [2025-03-09 06:45:33,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:33,978 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:45:33,978 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:33,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:33,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2105623882, now seen corresponding path program 1 times [2025-03-09 06:45:33,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:33,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-03-09 06:45:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:33,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:33,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:33,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:33,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950427132] [2025-03-09 06:45:34,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950427132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:45:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138494489] [2025-03-09 06:45:34,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:34,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:45:34,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:45:34,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:45:34,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:45:34,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:34,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:34,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:34,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:34,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:45:34,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:45:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:34,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:45:34,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138494489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:34,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:45:34,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:45:34,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309008779] [2025-03-09 06:45:34,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:34,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:34,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:34,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:45:34,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:34,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:34,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:34,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:34,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:36,390 INFO L124 PetriNetUnfolderBase]: 30119/41359 cut-off events. [2025-03-09 06:45:36,390 INFO L125 PetriNetUnfolderBase]: For 6951/7473 co-relation queries the response was YES. [2025-03-09 06:45:36,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90257 conditions, 41359 events. 30119/41359 cut-off events. For 6951/7473 co-relation queries the response was YES. Maximal size of possible extension queue 1422. Compared 261270 event pairs, 13580 based on Foata normal form. 819/41106 useless extension candidates. Maximal degree in co-relation 49530. Up to 17405 conditions per place. [2025-03-09 06:45:36,611 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 74 selfloop transitions, 5 changer transitions 0/90 dead transitions. [2025-03-09 06:45:36,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 406 flow [2025-03-09 06:45:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:36,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2025-03-09 06:45:36,612 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6097560975609756 [2025-03-09 06:45:36,612 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 156 flow. Second operand 6 states and 150 transitions. [2025-03-09 06:45:36,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 406 flow [2025-03-09 06:45:36,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 90 transitions, 400 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:45:36,817 INFO L231 Difference]: Finished difference. Result has 64 places, 42 transitions, 156 flow [2025-03-09 06:45:36,817 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:36,817 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2025-03-09 06:45:36,817 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 42 transitions, 156 flow [2025-03-09 06:45:36,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:36,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:36,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:36,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 06:45:37,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:45:37,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:37,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2102607435, now seen corresponding path program 1 times [2025-03-09 06:45:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:37,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611483741] [2025-03-09 06:45:37,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:37,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:37,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:45:37,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:45:37,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:37,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611483741] [2025-03-09 06:45:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611483741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:37,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:37,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:37,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139595065] [2025-03-09 06:45:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:37,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:37,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:37,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:37,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:37,078 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:37,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 42 transitions, 156 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:37,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:37,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:37,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:39,086 INFO L124 PetriNetUnfolderBase]: 30107/40594 cut-off events. [2025-03-09 06:45:39,087 INFO L125 PetriNetUnfolderBase]: For 15414/15495 co-relation queries the response was YES. [2025-03-09 06:45:39,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92394 conditions, 40594 events. 30107/40594 cut-off events. For 15414/15495 co-relation queries the response was YES. Maximal size of possible extension queue 1513. Compared 245232 event pairs, 14660 based on Foata normal form. 810/40503 useless extension candidates. Maximal degree in co-relation 58046. Up to 30087 conditions per place. [2025-03-09 06:45:39,341 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 48 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2025-03-09 06:45:39,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 302 flow [2025-03-09 06:45:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:39,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:39,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2025-03-09 06:45:39,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5040650406504065 [2025-03-09 06:45:39,342 INFO L175 Difference]: Start difference. First operand has 64 places, 42 transitions, 156 flow. Second operand 6 states and 124 transitions. [2025-03-09 06:45:39,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 302 flow [2025-03-09 06:45:39,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 63 transitions, 288 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 06:45:39,486 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 148 flow [2025-03-09 06:45:39,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2025-03-09 06:45:39,486 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2025-03-09 06:45:39,486 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 148 flow [2025-03-09 06:45:39,486 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:39,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:39,486 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:39,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:45:39,486 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:39,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:39,487 INFO L85 PathProgramCache]: Analyzing trace with hash -756320824, now seen corresponding path program 1 times [2025-03-09 06:45:39,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:39,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024703791] [2025-03-09 06:45:39,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:39,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:39,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:39,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:39,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:39,544 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:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024703791] [2025-03-09 06:45:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024703791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:39,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:39,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:45:39,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930562544] [2025-03-09 06:45:39,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:39,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:45:39,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:39,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:45:39,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:45:39,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:39,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 148 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:39,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:39,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:39,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:41,676 INFO L124 PetriNetUnfolderBase]: 29891/40777 cut-off events. [2025-03-09 06:45:41,677 INFO L125 PetriNetUnfolderBase]: For 10822/10822 co-relation queries the response was YES. [2025-03-09 06:45:41,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88293 conditions, 40777 events. 29891/40777 cut-off events. For 10822/10822 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 251799 event pairs, 8504 based on Foata normal form. 81/40767 useless extension candidates. Maximal degree in co-relation 57285. Up to 36856 conditions per place. [2025-03-09 06:45:41,878 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 61 selfloop transitions, 5 changer transitions 0/76 dead transitions. [2025-03-09 06:45:41,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 76 transitions, 368 flow [2025-03-09 06:45:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:45:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:45:41,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-09 06:45:41,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5487804878048781 [2025-03-09 06:45:41,879 INFO L175 Difference]: Start difference. First operand has 63 places, 41 transitions, 148 flow. Second operand 6 states and 135 transitions. [2025-03-09 06:45:41,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 76 transitions, 368 flow [2025-03-09 06:45:41,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 76 transitions, 357 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-09 06:45:41,946 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 169 flow [2025-03-09 06:45:41,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2025-03-09 06:45:41,946 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2025-03-09 06:45:41,946 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 169 flow [2025-03-09 06:45:41,947 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:41,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:41,947 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:45:41,947 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:45:41,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:41,947 INFO L85 PathProgramCache]: Analyzing trace with hash -849830695, now seen corresponding path program 1 times [2025-03-09 06:45:41,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:41,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-09 06:45:41,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:41,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:41,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:41,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:41,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:41,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:41,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360294191] [2025-03-09 06:45:41,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360294191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:45:41,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031124384] [2025-03-09 06:45:41,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:41,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:45:41,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:45:41,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:45:42,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:45:42,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:45:42,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:45:42,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:42,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:42,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:45:42,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:45:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:42,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:45:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:42,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031124384] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:45:42,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:45:42,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 06:45:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697784436] [2025-03-09 06:45:42,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:45:42,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:45:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:42,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:45:42,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:45:42,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:42,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 43 transitions, 169 flow. Second operand has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:42,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:42,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:42,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:45,790 INFO L124 PetriNetUnfolderBase]: 48983/67198 cut-off events. [2025-03-09 06:45:45,790 INFO L125 PetriNetUnfolderBase]: For 23323/23566 co-relation queries the response was YES. [2025-03-09 06:45:45,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144859 conditions, 67198 events. 48983/67198 cut-off events. For 23323/23566 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 431084 event pairs, 23012 based on Foata normal form. 2457/69564 useless extension candidates. Maximal degree in co-relation 50844. Up to 30113 conditions per place. [2025-03-09 06:45:46,359 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 126 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2025-03-09 06:45:46,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 145 transitions, 655 flow [2025-03-09 06:45:46,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:45:46,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:45:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 254 transitions. [2025-03-09 06:45:46,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6195121951219512 [2025-03-09 06:45:46,361 INFO L175 Difference]: Start difference. First operand has 66 places, 43 transitions, 169 flow. Second operand 10 states and 254 transitions. [2025-03-09 06:45:46,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 145 transitions, 655 flow [2025-03-09 06:45:46,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 145 transitions, 647 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:45:46,466 INFO L231 Difference]: Finished difference. Result has 75 places, 49 transitions, 219 flow [2025-03-09 06:45:46,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=219, PETRI_PLACES=75, PETRI_TRANSITIONS=49} [2025-03-09 06:45:46,466 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2025-03-09 06:45:46,467 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 49 transitions, 219 flow [2025-03-09 06:45:46,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.666666666666666) internal successors, (164), 12 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:45:46,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:46,467 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:46,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 06:45:46,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:45:46,669 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:46,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:46,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1590930586, now seen corresponding path program 1 times [2025-03-09 06:45:46,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:46,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734157462] [2025-03-09 06:45:46,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:46,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:46,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:45:46,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:45:46,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:46,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:46,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:45:46,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:46,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734157462] [2025-03-09 06:45:46,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734157462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:46,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:46,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:45:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981080209] [2025-03-09 06:45:46,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:46,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:45:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:46,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:45:46,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:45:46,749 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 41 [2025-03-09 06:45:46,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 49 transitions, 219 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:46,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:46,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 41 [2025-03-09 06:45:46,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:45:50,306 INFO L124 PetriNetUnfolderBase]: 45839/64588 cut-off events. [2025-03-09 06:45:50,306 INFO L125 PetriNetUnfolderBase]: For 39390/39390 co-relation queries the response was YES. [2025-03-09 06:45:50,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151392 conditions, 64588 events. 45839/64588 cut-off events. For 39390/39390 co-relation queries the response was YES. Maximal size of possible extension queue 1579. Compared 426111 event pairs, 728 based on Foata normal form. 729/65226 useless extension candidates. Maximal degree in co-relation 112856. Up to 44470 conditions per place. [2025-03-09 06:45:50,694 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 106 selfloop transitions, 7 changer transitions 0/123 dead transitions. [2025-03-09 06:45:50,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 123 transitions, 689 flow [2025-03-09 06:45:50,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:45:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:45:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2025-03-09 06:45:50,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5670731707317073 [2025-03-09 06:45:50,696 INFO L175 Difference]: Start difference. First operand has 75 places, 49 transitions, 219 flow. Second operand 8 states and 186 transitions. [2025-03-09 06:45:50,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 123 transitions, 689 flow [2025-03-09 06:45:51,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 655 flow, removed 10 selfloop flow, removed 3 redundant places. [2025-03-09 06:45:51,253 INFO L231 Difference]: Finished difference. Result has 78 places, 48 transitions, 213 flow [2025-03-09 06:45:51,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=78, PETRI_TRANSITIONS=48} [2025-03-09 06:45:51,254 INFO L279 CegarLoopForPetriNet]: 52 programPoint places, 26 predicate places. [2025-03-09 06:45:51,254 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 48 transitions, 213 flow [2025-03-09 06:45:51,254 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:51,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:51,254 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:51,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 06:45:51,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === 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:51,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -124055363, now seen corresponding path program 1 times [2025-03-09 06:45:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:51,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-03-09 06:45:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:51,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:45:51,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:45:51,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:51,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:51,263 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:45:51,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:45:51,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:45:51,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:51,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:45:51,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:45:51,272 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 06:45:51,272 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-03-09 06:45:51,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 06:45:51,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 06:45:51,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 06:45:51,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 06:45:51,272 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2025-03-09 06:45:51,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 06:45:51,272 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:45:51,273 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-09 06:45:51,273 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-09 06:45:51,290 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-09 06:45:51,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 49 transitions, 154 flow [2025-03-09 06:45:51,296 INFO L124 PetriNetUnfolderBase]: 5/98 cut-off events. [2025-03-09 06:45:51,297 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-09 06:45:51,297 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:51,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 49 transitions, 154 flow [2025-03-09 06:45:51,297 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 47 transitions, 146 flow [2025-03-09 06:45:51,298 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:45:51,298 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;@6c59628c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:45:51,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:45:51,299 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:45:51,299 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2025-03-09 06:45:51,299 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:45:51,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:45:51,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-09 06:45:51,299 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:51,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:45:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash 9707919, now seen corresponding path program 1 times [2025-03-09 06:45:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:45:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-09 06:45:51,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:45:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:45:51,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 06:45:51,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 06:45:51,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:45:51,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:45:51,321 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:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:45:51,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890172531] [2025-03-09 06:45:51,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890172531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:45:51,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:45:51,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:45:51,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437665250] [2025-03-09 06:45:51,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:45:51,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:45:51,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:45:51,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:45:51,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:45:51,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-09 06:45:51,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 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:51,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:45:51,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-09 06:45:51,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand