./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-lit/qw2004-2b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-lit/qw2004-2b.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 f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:16:21,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:16:21,953 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:16:21,956 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:16:21,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:16:21,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:16:21,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:16:21,981 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:16:21,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:16:21,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:16:21,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:16:21,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:16:21,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:16:21,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:16:21,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:16:21,984 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:16:21,984 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:16:21,985 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:16:21,985 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:16:21,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:16:21,986 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:16:21,987 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 -> f17f6182d2330561fe6717b6a061d0dded698483f9e32b37a3b36e1144855a29 [2025-03-04 15:16:22,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:16:22,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:16:22,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:16:22,215 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:16:22,215 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:16:22,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-lit/qw2004-2b.i [2025-03-04 15:16:23,312 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a7acf03/0bf7a39e6bd24b7fa5b6a775b0baecd7/FLAG55dda25ae [2025-03-04 15:16:23,584 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:16:23,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2b.i [2025-03-04 15:16:23,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a7acf03/0bf7a39e6bd24b7fa5b6a775b0baecd7/FLAG55dda25ae [2025-03-04 15:16:23,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a7acf03/0bf7a39e6bd24b7fa5b6a775b0baecd7 [2025-03-04 15:16:23,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:16:23,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:16:23,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:16:23,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:16:23,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:16:23,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:23,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a792cbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23, skipping insertion in model container [2025-03-04 15:16:23,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:23,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:16:23,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:16:23,894 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:16:23,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:16:23,962 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:16:23,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23 WrapperNode [2025-03-04 15:16:23,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:16:23,965 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:16:23,965 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:16:23,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:16:23,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:23,980 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:23,999 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 122 [2025-03-04 15:16:24,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:16:24,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:16:24,002 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:16:24,002 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:16:24,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,027 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:16:24,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,040 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:16:24,042 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:16:24,042 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:16:24,042 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:16:24,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (1/1) ... [2025-03-04 15:16:24,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:16:24,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:16:24,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:16:24,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:16:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2025-03-04 15:16:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2025-03-04 15:16:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:16:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:16:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:16:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:16:24,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:16:24,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:16:24,097 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:16:24,181 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:16:24,183 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:16:24,342 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:16:24,342 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:16:24,435 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:16:24,436 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:16:24,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:16:24 BoogieIcfgContainer [2025-03-04 15:16:24,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:16:24,438 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:16:24,438 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:16:24,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:16:24,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:16:23" (1/3) ... [2025-03-04 15:16:24,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78464a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:16:24, skipping insertion in model container [2025-03-04 15:16:24,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:16:23" (2/3) ... [2025-03-04 15:16:24,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78464a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:16:24, skipping insertion in model container [2025-03-04 15:16:24,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:16:24" (3/3) ... [2025-03-04 15:16:24,444 INFO L128 eAbstractionObserver]: Analyzing ICFG qw2004-2b.i [2025-03-04 15:16:24,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:16:24,458 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG qw2004-2b.i that has 2 procedures, 38 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-03-04 15:16:24,459 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:16:24,496 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:16:24,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 86 flow [2025-03-04 15:16:24,540 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2025-03-04 15:16:24,542 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:16:24,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 40 events. 4/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 83 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-03-04 15:16:24,544 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 41 transitions, 86 flow [2025-03-04 15:16:24,549 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 40 transitions, 83 flow [2025-03-04 15:16:24,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:16:24,571 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;@6a6d37b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:16:24,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 15:16:24,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:16:24,576 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:16:24,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:16:24,576 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:24,576 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:16:24,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:24,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:24,582 INFO L85 PathProgramCache]: Analyzing trace with hash 842879134, now seen corresponding path program 1 times [2025-03-04 15:16:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234805871] [2025-03-04 15:16:24,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:24,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:16:24,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:16:24,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:24,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:24,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:24,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:24,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234805871] [2025-03-04 15:16:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234805871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:24,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:24,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:16:24,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727263133] [2025-03-04 15:16:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:24,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:16:24,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:24,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:16:24,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:16:24,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:24,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:24,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:24,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:24,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:25,012 INFO L124 PetriNetUnfolderBase]: 212/474 cut-off events. [2025-03-04 15:16:25,013 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:16:25,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 474 events. 212/474 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2319 event pairs, 72 based on Foata normal form. 0/380 useless extension candidates. Maximal degree in co-relation 878. Up to 357 conditions per place. [2025-03-04 15:16:25,021 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 42 selfloop transitions, 4 changer transitions 0/55 dead transitions. [2025-03-04 15:16:25,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 205 flow [2025-03-04 15:16:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:16:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:16:25,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-04 15:16:25,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2025-03-04 15:16:25,040 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 83 flow. Second operand 3 states and 80 transitions. [2025-03-04 15:16:25,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 205 flow [2025-03-04 15:16:25,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 204 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:16:25,048 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 114 flow [2025-03-04 15:16:25,050 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2025-03-04 15:16:25,053 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2025-03-04 15:16:25,053 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 114 flow [2025-03-04 15:16:25,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:25,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:25,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:16:25,054 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:25,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:25,054 INFO L85 PathProgramCache]: Analyzing trace with hash 342615071, now seen corresponding path program 1 times [2025-03-04 15:16:25,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:25,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873107156] [2025-03-04 15:16:25,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:25,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:16:25,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:16:25,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:25,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:25,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873107156] [2025-03-04 15:16:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873107156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:25,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:16:25,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155730594] [2025-03-04 15:16:25,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:25,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:16:25,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:25,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:16:25,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:16:25,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:25,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:25,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:25,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:25,282 INFO L124 PetriNetUnfolderBase]: 221/491 cut-off events. [2025-03-04 15:16:25,282 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 15:16:25,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 491 events. 221/491 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2431 event pairs, 72 based on Foata normal form. 9/420 useless extension candidates. Maximal degree in co-relation 1015. Up to 356 conditions per place. [2025-03-04 15:16:25,289 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 53 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2025-03-04 15:16:25,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 69 transitions, 297 flow [2025-03-04 15:16:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:16:25,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:16:25,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-03-04 15:16:25,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5560975609756098 [2025-03-04 15:16:25,290 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 114 flow. Second operand 5 states and 114 transitions. [2025-03-04 15:16:25,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 69 transitions, 297 flow [2025-03-04 15:16:25,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 69 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:16:25,292 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 154 flow [2025-03-04 15:16:25,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2025-03-04 15:16:25,294 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2025-03-04 15:16:25,294 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 154 flow [2025-03-04 15:16:25,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:25,294 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:25,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:16:25,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:25,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:25,295 INFO L85 PathProgramCache]: Analyzing trace with hash 513714279, now seen corresponding path program 1 times [2025-03-04 15:16:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:25,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405066583] [2025-03-04 15:16:25,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:25,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:16:25,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:16:25,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:25,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:25,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:25,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:25,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405066583] [2025-03-04 15:16:25,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405066583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:25,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:25,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:16:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962597024] [2025-03-04 15:16:25,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:25,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:16:25,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:25,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:16:25,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:16:25,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2025-03-04 15:16:25,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:25,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2025-03-04 15:16:25,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:25,510 INFO L124 PetriNetUnfolderBase]: 257/550 cut-off events. [2025-03-04 15:16:25,510 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2025-03-04 15:16:25,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 550 events. 257/550 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2778 event pairs, 64 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 1245. Up to 435 conditions per place. [2025-03-04 15:16:25,515 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 63 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2025-03-04 15:16:25,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 371 flow [2025-03-04 15:16:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:16:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:16:25,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-03-04 15:16:25,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5853658536585366 [2025-03-04 15:16:25,518 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 154 flow. Second operand 4 states and 96 transitions. [2025-03-04 15:16:25,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 371 flow [2025-03-04 15:16:25,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:16:25,520 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 166 flow [2025-03-04 15:16:25,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2025-03-04 15:16:25,521 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2025-03-04 15:16:25,521 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 166 flow [2025-03-04 15:16:25,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:25,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:25,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:16:25,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:25,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash -352636417, now seen corresponding path program 2 times [2025-03-04 15:16:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015930235] [2025-03-04 15:16:25,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:16:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:25,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:16:25,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:16:25,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:16:25,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:25,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:25,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015930235] [2025-03-04 15:16:25,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015930235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:25,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:25,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:16:25,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304115430] [2025-03-04 15:16:25,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:25,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:16:25,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:25,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:16:25,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:16:25,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:25,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:25,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:25,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:25,770 INFO L124 PetriNetUnfolderBase]: 276/615 cut-off events. [2025-03-04 15:16:25,770 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-04 15:16:25,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 615 events. 276/615 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3260 event pairs, 79 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 1387. Up to 315 conditions per place. [2025-03-04 15:16:25,773 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 72 selfloop transitions, 14 changer transitions 2/97 dead transitions. [2025-03-04 15:16:25,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 97 transitions, 480 flow [2025-03-04 15:16:25,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:16:25,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:16:25,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2025-03-04 15:16:25,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505226480836237 [2025-03-04 15:16:25,775 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 166 flow. Second operand 7 states and 158 transitions. [2025-03-04 15:16:25,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 97 transitions, 480 flow [2025-03-04 15:16:25,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 97 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:16:25,777 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 246 flow [2025-03-04 15:16:25,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2025-03-04 15:16:25,778 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-03-04 15:16:25,780 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 246 flow [2025-03-04 15:16:25,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:25,780 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:25,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:16:25,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:25,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:25,781 INFO L85 PathProgramCache]: Analyzing trace with hash 584477154, now seen corresponding path program 1 times [2025-03-04 15:16:25,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:25,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313214228] [2025-03-04 15:16:25,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:25,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:25,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:16:25,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:16:25,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:25,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:25,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:25,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313214228] [2025-03-04 15:16:25,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313214228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:25,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:25,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:16:25,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052916251] [2025-03-04 15:16:25,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:25,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:16:25,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:25,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:16:25,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:16:25,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:25,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:25,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:25,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:25,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:25,992 INFO L124 PetriNetUnfolderBase]: 283/637 cut-off events. [2025-03-04 15:16:25,992 INFO L125 PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES. [2025-03-04 15:16:25,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 637 events. 283/637 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3373 event pairs, 84 based on Foata normal form. 24/612 useless extension candidates. Maximal degree in co-relation 1535. Up to 373 conditions per place. [2025-03-04 15:16:25,995 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 61 selfloop transitions, 9 changer transitions 2/81 dead transitions. [2025-03-04 15:16:25,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 81 transitions, 454 flow [2025-03-04 15:16:25,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:16:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:16:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2025-03-04 15:16:25,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.532520325203252 [2025-03-04 15:16:25,998 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 246 flow. Second operand 6 states and 131 transitions. [2025-03-04 15:16:25,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 81 transitions, 454 flow [2025-03-04 15:16:26,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 428 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-03-04 15:16:26,004 INFO L231 Difference]: Finished difference. Result has 62 places, 49 transitions, 223 flow [2025-03-04 15:16:26,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2025-03-04 15:16:26,006 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 22 predicate places. [2025-03-04 15:16:26,007 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 223 flow [2025-03-04 15:16:26,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,007 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:26,007 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:26,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:16:26,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:26,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1688186781, now seen corresponding path program 1 times [2025-03-04 15:16:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880689230] [2025-03-04 15:16:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:26,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:16:26,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:16:26,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:26,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:26,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:26,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880689230] [2025-03-04 15:16:26,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880689230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:16:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279054584] [2025-03-04 15:16:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:26,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:16:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:26,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:16:26,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:16:26,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:26,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 49 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:26,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:26,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:26,178 INFO L124 PetriNetUnfolderBase]: 239/554 cut-off events. [2025-03-04 15:16:26,178 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2025-03-04 15:16:26,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1368 conditions, 554 events. 239/554 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2960 event pairs, 48 based on Foata normal form. 9/526 useless extension candidates. Maximal degree in co-relation 1345. Up to 216 conditions per place. [2025-03-04 15:16:26,181 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 50 selfloop transitions, 9 changer transitions 21/89 dead transitions. [2025-03-04 15:16:26,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 479 flow [2025-03-04 15:16:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:16:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:16:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2025-03-04 15:16:26,182 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2025-03-04 15:16:26,182 INFO L175 Difference]: Start difference. First operand has 62 places, 49 transitions, 223 flow. Second operand 7 states and 147 transitions. [2025-03-04 15:16:26,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 479 flow [2025-03-04 15:16:26,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 464 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-03-04 15:16:26,184 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 204 flow [2025-03-04 15:16:26,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=204, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2025-03-04 15:16:26,185 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2025-03-04 15:16:26,185 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 204 flow [2025-03-04 15:16:26,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:26,185 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:16:26,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:26,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:26,186 INFO L85 PathProgramCache]: Analyzing trace with hash 585540054, now seen corresponding path program 1 times [2025-03-04 15:16:26,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:26,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669232353] [2025-03-04 15:16:26,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:26,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:26,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:16:26,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:16:26,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:26,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:26,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669232353] [2025-03-04 15:16:26,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669232353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:26,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:26,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:16:26,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924522446] [2025-03-04 15:16:26,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:26,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:16:26,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:26,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:16:26,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:16:26,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:26,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:26,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:26,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:26,326 INFO L124 PetriNetUnfolderBase]: 148/355 cut-off events. [2025-03-04 15:16:26,326 INFO L125 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2025-03-04 15:16:26,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 355 events. 148/355 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1674 event pairs, 34 based on Foata normal form. 7/338 useless extension candidates. Maximal degree in co-relation 917. Up to 230 conditions per place. [2025-03-04 15:16:26,328 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 48 selfloop transitions, 6 changer transitions 1/64 dead transitions. [2025-03-04 15:16:26,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 354 flow [2025-03-04 15:16:26,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:16:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:16:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2025-03-04 15:16:26,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45934959349593496 [2025-03-04 15:16:26,329 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 204 flow. Second operand 6 states and 113 transitions. [2025-03-04 15:16:26,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 354 flow [2025-03-04 15:16:26,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 306 flow, removed 9 selfloop flow, removed 10 redundant places. [2025-03-04 15:16:26,331 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 164 flow [2025-03-04 15:16:26,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2025-03-04 15:16:26,332 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 17 predicate places. [2025-03-04 15:16:26,332 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 164 flow [2025-03-04 15:16:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:26,332 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:26,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:16:26,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:26,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:26,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1071248060, now seen corresponding path program 1 times [2025-03-04 15:16:26,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:26,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156915639] [2025-03-04 15:16:26,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:26,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:26,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:16:26,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:16:26,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:26,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:26,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:26,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156915639] [2025-03-04 15:16:26,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156915639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:16:26,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:16:26,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:16:26,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000033478] [2025-03-04 15:16:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:16:26,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:16:26,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:26,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:16:26,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:16:26,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2025-03-04 15:16:26,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:26,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2025-03-04 15:16:26,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:26,487 INFO L124 PetriNetUnfolderBase]: 163/368 cut-off events. [2025-03-04 15:16:26,487 INFO L125 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-03-04 15:16:26,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 368 events. 163/368 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1726 event pairs, 24 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 879. Up to 222 conditions per place. [2025-03-04 15:16:26,489 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 48 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2025-03-04 15:16:26,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 60 transitions, 317 flow [2025-03-04 15:16:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:16:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:16:26,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 15:16:26,492 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2025-03-04 15:16:26,493 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 164 flow. Second operand 4 states and 80 transitions. [2025-03-04 15:16:26,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 60 transitions, 317 flow [2025-03-04 15:16:26,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 297 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 15:16:26,494 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 152 flow [2025-03-04 15:16:26,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=51, 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=4, PETRI_FLOW=152, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-03-04 15:16:26,495 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-03-04 15:16:26,495 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 152 flow [2025-03-04 15:16:26,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:26,495 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:26,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:16:26,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:26,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1321065848, now seen corresponding path program 1 times [2025-03-04 15:16:26,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:26,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671591829] [2025-03-04 15:16:26,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:26,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:26,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:16:26,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:16:26,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:26,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671591829] [2025-03-04 15:16:26,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671591829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:16:26,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67845410] [2025-03-04 15:16:26,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:26,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:16:26,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:16:26,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:16:26,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:16:26,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:16:26,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:16:26,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:26,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:26,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:16:26,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:16:26,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:26,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:16:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67845410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:16:26,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:16:26,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:16:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317594034] [2025-03-04 15:16:26,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:16:26,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:26,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:26,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:26,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:26,760 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:26,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 152 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:26,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:26,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:26,925 INFO L124 PetriNetUnfolderBase]: 125/321 cut-off events. [2025-03-04 15:16:26,926 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-04 15:16:26,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 729 conditions, 321 events. 125/321 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1469 event pairs, 2 based on Foata normal form. 16/324 useless extension candidates. Maximal degree in co-relation 711. Up to 109 conditions per place. [2025-03-04 15:16:26,927 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 34 selfloop transitions, 5 changer transitions 37/82 dead transitions. [2025-03-04 15:16:26,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 375 flow [2025-03-04 15:16:26,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:16:26,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:16:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2025-03-04 15:16:26,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4292682926829268 [2025-03-04 15:16:26,928 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 152 flow. Second operand 10 states and 176 transitions. [2025-03-04 15:16:26,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 375 flow [2025-03-04 15:16:26,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 349 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 15:16:26,930 INFO L231 Difference]: Finished difference. Result has 53 places, 27 transitions, 82 flow [2025-03-04 15:16:26,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=82, PETRI_PLACES=53, PETRI_TRANSITIONS=27} [2025-03-04 15:16:26,931 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2025-03-04 15:16:26,931 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 27 transitions, 82 flow [2025-03-04 15:16:26,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:26,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:16:26,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:26,938 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-04 15:16:27,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:16:27,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:16:27,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:16:27,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1321065849, now seen corresponding path program 1 times [2025-03-04 15:16:27,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:16:27,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47742797] [2025-03-04 15:16:27,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:27,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:16:27,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:16:27,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:16:27,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:27,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:16:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47742797] [2025-03-04 15:16:27,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47742797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:16:27,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695901199] [2025-03-04 15:16:27,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:16:27,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:16:27,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:16:27,195 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:16:27,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:16:27,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:16:27,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:16:27,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:16:27,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:16:27,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:16:27,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:16:27,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:27,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:16:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:16:27,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695901199] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:16:27,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:16:27,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 15:16:27,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76451874] [2025-03-04 15:16:27,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:16:27,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:16:27,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:16:27,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:16:27,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:16:27,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 41 [2025-03-04 15:16:27,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 27 transitions, 82 flow. Second operand has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:27,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:16:27,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 41 [2025-03-04 15:16:27,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:16:27,390 INFO L124 PetriNetUnfolderBase]: 59/155 cut-off events. [2025-03-04 15:16:27,390 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 15:16:27,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 155 events. 59/155 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 500 event pairs, 2 based on Foata normal form. 7/158 useless extension candidates. Maximal degree in co-relation 327. Up to 70 conditions per place. [2025-03-04 15:16:27,391 INFO L140 encePairwiseOnDemand]: 35/41 looper letters, 0 selfloop transitions, 0 changer transitions 45/45 dead transitions. [2025-03-04 15:16:27,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 192 flow [2025-03-04 15:16:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:16:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:16:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2025-03-04 15:16:27,392 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3832752613240418 [2025-03-04 15:16:27,392 INFO L175 Difference]: Start difference. First operand has 53 places, 27 transitions, 82 flow. Second operand 7 states and 110 transitions. [2025-03-04 15:16:27,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 192 flow [2025-03-04 15:16:27,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 177 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 15:16:27,393 INFO L231 Difference]: Finished difference. Result has 38 places, 0 transitions, 0 flow [2025-03-04 15:16:27,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=38, PETRI_TRANSITIONS=0} [2025-03-04 15:16:27,394 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2025-03-04 15:16:27,394 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 0 transitions, 0 flow [2025-03-04 15:16:27,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.333333333333334) internal successors, (120), 9 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2025-03-04 15:16:27,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-04 15:16:27,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location BCSP_PnpStopErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-04 15:16:27,403 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-04 15:16:27,601 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,SelfDestructingSolverStorable9 [2025-03-04 15:16:27,601 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:16:27,606 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:16:27,607 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:16:27,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:16:27 BasicIcfg [2025-03-04 15:16:27,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:16:27,612 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:16:27,612 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:16:27,612 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:16:27,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:16:24" (3/4) ... [2025-03-04 15:16:27,615 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:16:27,617 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure BCSP_PnpStop [2025-03-04 15:16:27,620 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2025-03-04 15:16:27,621 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 15:16:27,621 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 15:16:27,621 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:16:27,676 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:16:27,677 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:16:27,677 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:16:27,678 INFO L158 Benchmark]: Toolchain (without parser) took 4058.60ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 105.7MB in the beginning and 167.4MB in the end (delta: -61.7MB). Peak memory consumption was 93.7MB. Max. memory is 16.1GB. [2025-03-04 15:16:27,678 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:16:27,678 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.55ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 86.6MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:16:27,678 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.57ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 83.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:16:27,679 INFO L158 Benchmark]: Boogie Preprocessor took 40.12ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.0MB in the end (delta: 956.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:16:27,679 INFO L158 Benchmark]: IcfgBuilder took 394.43ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 56.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 15:16:27,680 INFO L158 Benchmark]: TraceAbstraction took 3172.26ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 55.9MB in the beginning and 171.5MB in the end (delta: -115.6MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2025-03-04 15:16:27,680 INFO L158 Benchmark]: Witness Printer took 64.74ms. Allocated memory is still 302.0MB. Free memory was 171.5MB in the beginning and 167.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:16:27,681 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.55ms. Allocated memory is still 142.6MB. Free memory was 105.7MB in the beginning and 86.6MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.57ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 83.9MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.12ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 83.0MB in the end (delta: 956.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 394.43ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 56.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3172.26ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 55.9MB in the beginning and 171.5MB in the end (delta: -115.6MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 64.74ms. Allocated memory is still 302.0MB. Free memory was 171.5MB in the beginning and 167.4MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 712]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 712]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 719]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 54 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 433 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1260 IncrementalHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 4 mSDtfsCounter, 1260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=4, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 468 SizeOfPredicates, 4 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:16:27,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE