./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c --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/weaver/parallel-ticket-3.wvr.c -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 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:27:03,020 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:27:03,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:27:03,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:27:03,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:27:03,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:27:03,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:27:03,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:27:03,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:27:03,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:27:03,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:27:03,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:27:03,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:27:03,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:27:03,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:27:03,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:27:03,096 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:27:03,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:27:03,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:03,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:27:03,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:27:03,097 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 -> 11bff6cd42e59c1eface46e47cb7e4e4f51a04703472e58b1bb7c25b58842408 [2025-03-04 15:27:03,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:27:03,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:27:03,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:27:03,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:27:03,328 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:27:03,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-03-04 15:27:04,473 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181dfbd8/fa4fbaf460694dac8a5dbb878fd23717/FLAGab16495a8 [2025-03-04 15:27:04,738 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:27:04,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-3.wvr.c [2025-03-04 15:27:04,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181dfbd8/fa4fbaf460694dac8a5dbb878fd23717/FLAGab16495a8 [2025-03-04 15:27:05,049 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9181dfbd8/fa4fbaf460694dac8a5dbb878fd23717 [2025-03-04 15:27:05,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:27:05,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:27:05,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:05,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:27:05,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:27:05,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc1c4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05, skipping insertion in model container [2025-03-04 15:27:05,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:27:05,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:05,191 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:27:05,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:05,220 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:27:05,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05 WrapperNode [2025-03-04 15:27:05,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:05,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:05,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:27:05,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:27:05,226 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:27:05" (1/1) ... [2025-03-04 15:27:05,231 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:27:05" (1/1) ... [2025-03-04 15:27:05,247 INFO L138 Inliner]: procedures = 19, calls = 15, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2025-03-04 15:27:05,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:05,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:27:05,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:27:05,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:27:05,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,282 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:27:05,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,292 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:27:05,294 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:27:05,294 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:27:05,294 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:27:05,295 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (1/1) ... [2025-03-04 15:27:05,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:05,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:05,324 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:27:05,327 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:27:05,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:27:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:27:05,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:27:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:27:05,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:27:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:27:05,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:27:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:27:05,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:27:05,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:27:05,350 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:27:05,418 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:27:05,419 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:27:05,646 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:27:05,646 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:27:05,814 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:27:05,814 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:27:05,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:05 BoogieIcfgContainer [2025-03-04 15:27:05,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:27:05,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:27:05,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:27:05,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:27:05,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:27:05" (1/3) ... [2025-03-04 15:27:05,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a44cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:05, skipping insertion in model container [2025-03-04 15:27:05,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:05" (2/3) ... [2025-03-04 15:27:05,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43a44cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:05, skipping insertion in model container [2025-03-04 15:27:05,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:05" (3/3) ... [2025-03-04 15:27:05,824 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-ticket-3.wvr.c [2025-03-04 15:27:05,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:27:05,840 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-ticket-3.wvr.c that has 4 procedures, 56 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-04 15:27:05,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:27:05,902 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:27:05,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 135 flow [2025-03-04 15:27:05,957 INFO L124 PetriNetUnfolderBase]: 2/54 cut-off events. [2025-03-04 15:27:05,958 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:27:05,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 54 events. 2/54 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 116 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 44. Up to 2 conditions per place. [2025-03-04 15:27:05,964 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 135 flow [2025-03-04 15:27:05,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 119 flow [2025-03-04 15:27:05,975 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:27:05,982 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;@22516e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:27:05,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2025-03-04 15:27:05,986 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:27:05,986 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 15:27:05,986 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:27:05,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:05,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:05,987 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:05,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:05,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1269381642, now seen corresponding path program 1 times [2025-03-04 15:27:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923661191] [2025-03-04 15:27:05,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:06,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:06,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:06,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:06,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:06,214 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:27:06,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:06,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923661191] [2025-03-04 15:27:06,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923661191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:06,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:06,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:06,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269454492] [2025-03-04 15:27:06,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:06,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:06,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:06,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:06,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:06,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:06,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:27:06,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:06,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:06,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:06,868 INFO L124 PetriNetUnfolderBase]: 4436/6535 cut-off events. [2025-03-04 15:27:06,869 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2025-03-04 15:27:06,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13013 conditions, 6535 events. 4436/6535 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 38047 event pairs, 3600 based on Foata normal form. 0/4179 useless extension candidates. Maximal degree in co-relation 12298. Up to 6186 conditions per place. [2025-03-04 15:27:06,909 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 39 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-03-04 15:27:06,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 197 flow [2025-03-04 15:27:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-04 15:27:06,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43859649122807015 [2025-03-04 15:27:06,919 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 119 flow. Second operand 3 states and 75 transitions. [2025-03-04 15:27:06,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 197 flow [2025-03-04 15:27:06,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 188 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:06,935 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 110 flow [2025-03-04 15:27:06,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2025-03-04 15:27:06,940 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2025-03-04 15:27:06,941 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 110 flow [2025-03-04 15:27:06,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:27:06,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:06,941 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:06,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:06,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:06,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1269381643, now seen corresponding path program 1 times [2025-03-04 15:27:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:06,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523212699] [2025-03-04 15:27:06,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:06,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:06,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:06,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:06,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:07,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:07,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523212699] [2025-03-04 15:27:07,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523212699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:07,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:07,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:07,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649375195] [2025-03-04 15:27:07,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:07,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:07,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:07,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:07,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:07,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:27:07,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:07,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:07,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:07,472 INFO L124 PetriNetUnfolderBase]: 4489/6535 cut-off events. [2025-03-04 15:27:07,472 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 15:27:07,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12955 conditions, 6535 events. 4489/6535 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 36983 event pairs, 2498 based on Foata normal form. 0/4246 useless extension candidates. Maximal degree in co-relation 12931. Up to 6231 conditions per place. [2025-03-04 15:27:07,515 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 44 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2025-03-04 15:27:07,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 229 flow [2025-03-04 15:27:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 15:27:07,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2025-03-04 15:27:07,520 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 110 flow. Second operand 3 states and 83 transitions. [2025-03-04 15:27:07,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 229 flow [2025-03-04 15:27:07,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:07,523 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 140 flow [2025-03-04 15:27:07,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-03-04 15:27:07,524 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-03-04 15:27:07,525 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 140 flow [2025-03-04 15:27:07,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:27:07,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:07,525 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:27:07,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:27:07,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:07,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:07,526 INFO L85 PathProgramCache]: Analyzing trace with hash 724324554, now seen corresponding path program 1 times [2025-03-04 15:27:07,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:07,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638990418] [2025-03-04 15:27:07,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:07,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:07,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:07,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:07,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:07,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:07,644 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:27:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638990418] [2025-03-04 15:27:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638990418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:07,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469153514] [2025-03-04 15:27:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:07,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:07,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:07,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:07,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:07,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:27:07,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:07,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:07,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:07,971 INFO L124 PetriNetUnfolderBase]: 3907/5814 cut-off events. [2025-03-04 15:27:07,971 INFO L125 PetriNetUnfolderBase]: For 421/421 co-relation queries the response was YES. [2025-03-04 15:27:07,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12137 conditions, 5814 events. 3907/5814 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 33209 event pairs, 867 based on Foata normal form. 0/3920 useless extension candidates. Maximal degree in co-relation 11101. Up to 5303 conditions per place. [2025-03-04 15:27:07,996 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 67 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2025-03-04 15:27:07,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 366 flow [2025-03-04 15:27:07,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:07,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2025-03-04 15:27:07,998 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5219298245614035 [2025-03-04 15:27:07,998 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 140 flow. Second operand 4 states and 119 transitions. [2025-03-04 15:27:07,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 366 flow [2025-03-04 15:27:07,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:08,000 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 182 flow [2025-03-04 15:27:08,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2025-03-04 15:27:08,000 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2025-03-04 15:27:08,000 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 182 flow [2025-03-04 15:27:08,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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:27:08,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:08,001 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:27:08,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:27:08,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:08,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:08,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2115976242, now seen corresponding path program 1 times [2025-03-04 15:27:08,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:08,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070103128] [2025-03-04 15:27:08,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:08,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:08,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:08,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:08,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:08,053 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:27:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070103128] [2025-03-04 15:27:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070103128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:08,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:08,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:08,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497323017] [2025-03-04 15:27:08,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:08,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:08,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:08,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:08,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:08,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:08,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:08,270 INFO L124 PetriNetUnfolderBase]: 2710/4048 cut-off events. [2025-03-04 15:27:08,270 INFO L125 PetriNetUnfolderBase]: For 1054/1054 co-relation queries the response was YES. [2025-03-04 15:27:08,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9237 conditions, 4048 events. 2710/4048 cut-off events. For 1054/1054 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 22148 event pairs, 2025 based on Foata normal form. 0/3010 useless extension candidates. Maximal degree in co-relation 5648. Up to 3834 conditions per place. [2025-03-04 15:27:08,284 INFO L140 encePairwiseOnDemand]: 51/57 looper letters, 42 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2025-03-04 15:27:08,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 266 flow [2025-03-04 15:27:08,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-03-04 15:27:08,288 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42105263157894735 [2025-03-04 15:27:08,288 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 182 flow. Second operand 3 states and 72 transitions. [2025-03-04 15:27:08,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 266 flow [2025-03-04 15:27:08,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 248 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:08,290 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 164 flow [2025-03-04 15:27:08,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-03-04 15:27:08,291 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-03-04 15:27:08,291 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 164 flow [2025-03-04 15:27:08,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:08,291 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:27:08,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:27:08,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:08,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2115976241, now seen corresponding path program 1 times [2025-03-04 15:27:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702655987] [2025-03-04 15:27:08,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:08,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:08,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:27:08,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:27:08,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:08,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:08,339 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:27:08,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:08,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702655987] [2025-03-04 15:27:08,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702655987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:08,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192028892] [2025-03-04 15:27:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:08,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:08,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:08,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:08,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:08,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:08,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:08,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:08,509 INFO L124 PetriNetUnfolderBase]: 2216/3302 cut-off events. [2025-03-04 15:27:08,510 INFO L125 PetriNetUnfolderBase]: For 725/725 co-relation queries the response was YES. [2025-03-04 15:27:08,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7452 conditions, 3302 events. 2216/3302 cut-off events. For 725/725 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 16732 event pairs, 604 based on Foata normal form. 0/2677 useless extension candidates. Maximal degree in co-relation 7423. Up to 2559 conditions per place. [2025-03-04 15:27:08,521 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 63 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2025-03-04 15:27:08,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 383 flow [2025-03-04 15:27:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:08,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2025-03-04 15:27:08,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.543859649122807 [2025-03-04 15:27:08,525 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 164 flow. Second operand 3 states and 93 transitions. [2025-03-04 15:27:08,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 383 flow [2025-03-04 15:27:08,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:08,527 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 194 flow [2025-03-04 15:27:08,527 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2025-03-04 15:27:08,529 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-04 15:27:08,529 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 194 flow [2025-03-04 15:27:08,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:08,530 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:08,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:27:08,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:08,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:08,532 INFO L85 PathProgramCache]: Analyzing trace with hash -454802714, now seen corresponding path program 1 times [2025-03-04 15:27:08,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:08,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055358662] [2025-03-04 15:27:08,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:08,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:08,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 15:27:08,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 15:27:08,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:08,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:08,622 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:27:08,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:08,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055358662] [2025-03-04 15:27:08,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055358662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:08,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:08,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:08,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986372156] [2025-03-04 15:27:08,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:08,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:08,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:08,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:08,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:08,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:08,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:08,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:08,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:08,796 INFO L124 PetriNetUnfolderBase]: 1557/2491 cut-off events. [2025-03-04 15:27:08,796 INFO L125 PetriNetUnfolderBase]: For 848/848 co-relation queries the response was YES. [2025-03-04 15:27:08,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6036 conditions, 2491 events. 1557/2491 cut-off events. For 848/848 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12759 event pairs, 82 based on Foata normal form. 0/2149 useless extension candidates. Maximal degree in co-relation 5313. Up to 1503 conditions per place. [2025-03-04 15:27:08,805 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 77 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2025-03-04 15:27:08,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 96 transitions, 480 flow [2025-03-04 15:27:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:08,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:08,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2025-03-04 15:27:08,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47719298245614034 [2025-03-04 15:27:08,807 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 194 flow. Second operand 5 states and 136 transitions. [2025-03-04 15:27:08,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 96 transitions, 480 flow [2025-03-04 15:27:08,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:08,810 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 194 flow [2025-03-04 15:27:08,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-04 15:27:08,812 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-04 15:27:08,812 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 194 flow [2025-03-04 15:27:08,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:08,812 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:08,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:27:08,812 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:08,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash -876441882, now seen corresponding path program 1 times [2025-03-04 15:27:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:08,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345628642] [2025-03-04 15:27:08,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:08,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:08,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:27:08,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:27:08,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:08,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:08,868 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:27:08,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345628642] [2025-03-04 15:27:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345628642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:08,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:08,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:08,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471546567] [2025-03-04 15:27:08,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:08,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:08,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:08,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:08,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:08,870 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:08,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:08,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:08,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:08,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:09,007 INFO L124 PetriNetUnfolderBase]: 1361/2104 cut-off events. [2025-03-04 15:27:09,008 INFO L125 PetriNetUnfolderBase]: For 1539/1555 co-relation queries the response was YES. [2025-03-04 15:27:09,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5332 conditions, 2104 events. 1361/2104 cut-off events. For 1539/1555 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10075 event pairs, 244 based on Foata normal form. 16/1988 useless extension candidates. Maximal degree in co-relation 2737. Up to 842 conditions per place. [2025-03-04 15:27:09,015 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 71 selfloop transitions, 9 changer transitions 3/90 dead transitions. [2025-03-04 15:27:09,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 90 transitions, 496 flow [2025-03-04 15:27:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:09,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2025-03-04 15:27:09,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5131578947368421 [2025-03-04 15:27:09,017 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 194 flow. Second operand 4 states and 117 transitions. [2025-03-04 15:27:09,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 90 transitions, 496 flow [2025-03-04 15:27:09,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 418 flow, removed 18 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:09,019 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 182 flow [2025-03-04 15:27:09,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2025-03-04 15:27:09,020 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2025-03-04 15:27:09,021 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 182 flow [2025-03-04 15:27:09,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:09,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:09,022 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:09,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:27:09,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:09,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:09,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1054210146, now seen corresponding path program 1 times [2025-03-04 15:27:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:09,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504894324] [2025-03-04 15:27:09,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:09,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:09,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:27:09,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:27:09,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:09,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:09,075 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:27:09,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504894324] [2025-03-04 15:27:09,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504894324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:09,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:09,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:27:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88684258] [2025-03-04 15:27:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:09,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:09,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:09,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:09,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:09,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 57 [2025-03-04 15:27:09,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:09,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:09,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 57 [2025-03-04 15:27:09,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:09,188 INFO L124 PetriNetUnfolderBase]: 1296/2055 cut-off events. [2025-03-04 15:27:09,189 INFO L125 PetriNetUnfolderBase]: For 1611/1611 co-relation queries the response was YES. [2025-03-04 15:27:09,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5238 conditions, 2055 events. 1296/2055 cut-off events. For 1611/1611 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10344 event pairs, 734 based on Foata normal form. 167/2193 useless extension candidates. Maximal degree in co-relation 3183. Up to 1646 conditions per place. [2025-03-04 15:27:09,195 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 61 selfloop transitions, 5 changer transitions 0/71 dead transitions. [2025-03-04 15:27:09,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 381 flow [2025-03-04 15:27:09,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:09,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-04 15:27:09,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4619883040935672 [2025-03-04 15:27:09,196 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 182 flow. Second operand 3 states and 79 transitions. [2025-03-04 15:27:09,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 381 flow [2025-03-04 15:27:09,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 355 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:09,198 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 183 flow [2025-03-04 15:27:09,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=183, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2025-03-04 15:27:09,198 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2025-03-04 15:27:09,198 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 183 flow [2025-03-04 15:27:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:27:09,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:09,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:09,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:27:09,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 24 more)] === [2025-03-04 15:27:09,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:09,199 INFO L85 PathProgramCache]: Analyzing trace with hash 288950232, now seen corresponding path program 1 times [2025-03-04 15:27:09,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:09,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13573120] [2025-03-04 15:27:09,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:09,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:09,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:27:09,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:27:09,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:09,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:09,290 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:27:09,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:09,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13573120] [2025-03-04 15:27:09,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13573120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:09,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:09,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:27:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309918659] [2025-03-04 15:27:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:09,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:27:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:09,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:27:09,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:27:09,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 57 [2025-03-04 15:27:09,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 183 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:27:09,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:09,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 57 [2025-03-04 15:27:09,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:09,455 INFO L124 PetriNetUnfolderBase]: 1214/1928 cut-off events. [2025-03-04 15:27:09,455 INFO L125 PetriNetUnfolderBase]: For 1194/1226 co-relation queries the response was YES. [2025-03-04 15:27:09,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 1928 events. 1214/1928 cut-off events. For 1194/1226 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 9440 event pairs, 217 based on Foata normal form. 82/1976 useless extension candidates. Maximal degree in co-relation 2711. Up to 889 conditions per place. [2025-03-04 15:27:09,457 INFO L140 encePairwiseOnDemand]: 48/57 looper letters, 0 selfloop transitions, 0 changer transitions 84/84 dead transitions. [2025-03-04 15:27:09,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 419 flow [2025-03-04 15:27:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:27:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:27:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2025-03-04 15:27:09,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4245614035087719 [2025-03-04 15:27:09,458 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 183 flow. Second operand 5 states and 121 transitions. [2025-03-04 15:27:09,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 419 flow [2025-03-04 15:27:09,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 389 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:27:09,461 INFO L231 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2025-03-04 15:27:09,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2025-03-04 15:27:09,461 INFO L279 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2025-03-04 15:27:09,461 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2025-03-04 15:27:09,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 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:27:09,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 27 remaining) [2025-03-04 15:27:09,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 27 remaining) [2025-03-04 15:27:09,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 27 remaining) [2025-03-04 15:27:09,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 27 remaining) [2025-03-04 15:27:09,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 27 remaining) [2025-03-04 15:27:09,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 27 remaining) [2025-03-04 15:27:09,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 27 remaining) [2025-03-04 15:27:09,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 27 remaining) [2025-03-04 15:27:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:27:09,465 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:09,471 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:27:09,471 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:27:09,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:27:09 BasicIcfg [2025-03-04 15:27:09,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:27:09,476 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:27:09,476 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:27:09,476 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:27:09,477 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:05" (3/4) ... [2025-03-04 15:27:09,478 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:27:09,480 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:27:09,480 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:27:09,480 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:27:09,483 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-04 15:27:09,483 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 15:27:09,483 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 15:27:09,483 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:27:09,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:27:09,531 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:27:09,531 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:27:09,532 INFO L158 Benchmark]: Toolchain (without parser) took 4479.80ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 105.5MB in the beginning and 308.3MB in the end (delta: -202.8MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2025-03-04 15:27:09,532 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:27:09,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 168.50ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.6MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:27:09,532 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.52ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:27:09,532 INFO L158 Benchmark]: Boogie Preprocessor took 43.70ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:27:09,532 INFO L158 Benchmark]: IcfgBuilder took 520.00ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 57.7MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:27:09,532 INFO L158 Benchmark]: TraceAbstraction took 3657.43ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 56.7MB in the beginning and 312.4MB in the end (delta: -255.7MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB. [2025-03-04 15:27:09,533 INFO L158 Benchmark]: Witness Printer took 55.15ms. Allocated memory is still 394.3MB. Free memory was 312.4MB in the beginning and 308.3MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:27:09,533 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.60ms. Allocated memory is still 201.3MB. Free memory is still 128.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 168.50ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 94.6MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.52ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.70ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 520.00ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 57.7MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3657.43ms. Allocated memory was 142.6MB in the beginning and 394.3MB in the end (delta: 251.7MB). Free memory was 56.7MB in the beginning and 312.4MB in the end (delta: -255.7MB). Peak memory consumption was 221.2MB. Max. memory is 16.1GB. * Witness Printer took 55.15ms. Allocated memory is still 394.3MB. Free memory was 312.4MB in the beginning and 308.3MB 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: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 66]: 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 7 procedures, 95 locations, 27 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.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 2 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=194occurred in iteration=5, InterpolantAutomatonStates: 33, 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.6s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 167 ConstructedInterpolants, 0 QuantifiedInterpolants, 319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:27:09,548 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