/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:10:55,239 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:10:55,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:10:55,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:10:55,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:10:55,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:10:55,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:10:55,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:10:55,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:10:55,319 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:10:55,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:10:55,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:10:55,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:10:55,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:10:55,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:10:55,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:55,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:10:55,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:55,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:10:55,322 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:10:55,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:10:55,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:10:55,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:10:55,601 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:10:55,601 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:10:55,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:57,255 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3d13bf8/d170068b7e3940f988ec85300791c210/FLAG5812a2609 [2025-04-14 00:10:57,520 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:10:57,520 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:57,530 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3d13bf8/d170068b7e3940f988ec85300791c210/FLAG5812a2609 [2025-04-14 00:10:58,305 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a3d13bf8/d170068b7e3940f988ec85300791c210 [2025-04-14 00:10:58,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:10:58,309 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:10:58,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:58,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:10:58,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:10:58,321 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,322 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e08475d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58, skipping insertion in model container [2025-04-14 00:10:58,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,359 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:10:58,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2025-04-14 00:10:58,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:58,781 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:10:58,806 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2025-04-14 00:10:58,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:10:58,923 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:10:58,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58 WrapperNode [2025-04-14 00:10:58,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:10:58,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:58,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:10:58,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:10:58,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,974 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-04-14 00:10:58,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:10:58,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:10:58,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:10:58,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:10:58,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:58,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,011 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-04-14 00:10:59,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,020 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,022 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:10:59,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:10:59,029 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:10:59,029 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:10:59,030 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (1/1) ... [2025-04-14 00:10:59,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:10:59,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:10:59,057 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-04-14 00:10:59,060 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-04-14 00:10:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:10:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:10:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-14 00:10:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-14 00:10:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-14 00:10:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-14 00:10:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-14 00:10:59,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-14 00:10:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:10:59,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:10:59,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:10:59,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:10:59,080 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:10:59,195 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:10:59,197 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:10:59,484 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:10:59,485 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:10:59,485 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:10:59,773 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:10:59,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:59 BoogieIcfgContainer [2025-04-14 00:10:59,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:10:59,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:10:59,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:10:59,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:10:59,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:10:58" (1/3) ... [2025-04-14 00:10:59,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698848e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:59, skipping insertion in model container [2025-04-14 00:10:59,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:10:58" (2/3) ... [2025-04-14 00:10:59,783 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7698848e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:10:59, skipping insertion in model container [2025-04-14 00:10:59,783 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:10:59" (3/3) ... [2025-04-14 00:10:59,784 INFO L128 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-14 00:10:59,796 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:10:59,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe034_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 38 locations, 34 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-14 00:10:59,798 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:10:59,856 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 00:10:59,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 86 flow [2025-04-14 00:10:59,911 INFO L116 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-04-14 00:10:59,916 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:59,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-14 00:10:59,917 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 37 transitions, 86 flow [2025-04-14 00:10:59,923 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2025-04-14 00:10:59,932 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:10:59,945 INFO L340 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;@3b7a5b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:10:59,945 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-14 00:10:59,952 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:10:59,952 INFO L116 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-04-14 00:10:59,952 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:10:59,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:10:59,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:10:59,953 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:10:59,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:10:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1379558716, now seen corresponding path program 1 times [2025-04-14 00:10:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:10:59,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754398434] [2025-04-14 00:10:59,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:10:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:00,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:11:00,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:11:00,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:00,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:00,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:00,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754398434] [2025-04-14 00:11:00,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754398434] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:00,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:00,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:11:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314713133] [2025-04-14 00:11:00,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:00,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:11:00,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:00,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:11:00,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:11:00,452 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:00,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-04-14 00:11:00,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:00,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:00,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:01,661 INFO L116 PetriNetUnfolderBase]: 5879/8353 cut-off events. [2025-04-14 00:11:01,662 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-14 00:11:01,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16816 conditions, 8353 events. 5879/8353 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 43355 event pairs, 804 based on Foata normal form. 0/8054 useless extension candidates. Maximal degree in co-relation 16805. Up to 7036 conditions per place. [2025-04-14 00:11:01,759 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 45 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2025-04-14 00:11:01,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 211 flow [2025-04-14 00:11:01,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:11:01,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:11:01,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-14 00:11:01,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-04-14 00:11:01,779 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 68 transitions. [2025-04-14 00:11:01,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 211 flow [2025-04-14 00:11:01,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:01,789 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 74 flow [2025-04-14 00:11:01,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-04-14 00:11:01,798 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2025-04-14 00:11:01,798 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 74 flow [2025-04-14 00:11:01,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-04-14 00:11:01,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:01,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:01,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:01,799 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:01,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1506278071, now seen corresponding path program 1 times [2025-04-14 00:11:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:01,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939148447] [2025-04-14 00:11:01,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:01,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:11:01,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:11:01,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:01,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:02,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:02,041 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939148447] [2025-04-14 00:11:02,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939148447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:02,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:02,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:02,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402674760] [2025-04-14 00:11:02,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:02,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:02,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:02,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:02,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:02,043 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:02,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:02,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:02,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:02,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:02,719 INFO L116 PetriNetUnfolderBase]: 4185/6159 cut-off events. [2025-04-14 00:11:02,720 INFO L117 PetriNetUnfolderBase]: For 267/267 co-relation queries the response was YES. [2025-04-14 00:11:02,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12694 conditions, 6159 events. 4185/6159 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 32048 event pairs, 818 based on Foata normal form. 294/6448 useless extension candidates. Maximal degree in co-relation 12684. Up to 3216 conditions per place. [2025-04-14 00:11:02,768 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 60 selfloop transitions, 5 changer transitions 1/69 dead transitions. [2025-04-14 00:11:02,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 288 flow [2025-04-14 00:11:02,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:11:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:11:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 92 transitions. [2025-04-14 00:11:02,770 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-04-14 00:11:02,770 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 74 flow. Second operand 4 states and 92 transitions. [2025-04-14 00:11:02,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 288 flow [2025-04-14 00:11:02,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 69 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:02,775 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 104 flow [2025-04-14 00:11:02,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-04-14 00:11:02,778 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2025-04-14 00:11:02,778 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 104 flow [2025-04-14 00:11:02,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:02,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:02,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:02,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:02,779 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:02,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1286772915, now seen corresponding path program 1 times [2025-04-14 00:11:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:02,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518813783] [2025-04-14 00:11:02,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:02,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 00:11:02,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 00:11:02,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:02,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:03,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:03,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:03,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518813783] [2025-04-14 00:11:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518813783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:03,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:11:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348671723] [2025-04-14 00:11:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:03,088 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:11:03,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:03,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:11:03,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:11:03,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:03,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:03,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:03,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:03,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:03,432 INFO L116 PetriNetUnfolderBase]: 2390/3614 cut-off events. [2025-04-14 00:11:03,432 INFO L117 PetriNetUnfolderBase]: For 675/675 co-relation queries the response was YES. [2025-04-14 00:11:03,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8431 conditions, 3614 events. 2390/3614 cut-off events. For 675/675 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17287 event pairs, 536 based on Foata normal form. 194/3803 useless extension candidates. Maximal degree in co-relation 8419. Up to 1317 conditions per place. [2025-04-14 00:11:03,452 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 77 selfloop transitions, 8 changer transitions 1/89 dead transitions. [2025-04-14 00:11:03,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 89 transitions, 405 flow [2025-04-14 00:11:03,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:03,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2025-04-14 00:11:03,455 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2025-04-14 00:11:03,455 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 104 flow. Second operand 5 states and 118 transitions. [2025-04-14 00:11:03,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 89 transitions, 405 flow [2025-04-14 00:11:03,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 89 transitions, 395 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:03,461 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 144 flow [2025-04-14 00:11:03,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2025-04-14 00:11:03,462 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2025-04-14 00:11:03,463 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 144 flow [2025-04-14 00:11:03,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:03,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:03,463 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-04-14 00:11:03,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:11:03,463 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:03,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:03,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1920405244, now seen corresponding path program 1 times [2025-04-14 00:11:03,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:03,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058400398] [2025-04-14 00:11:03,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:03,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:03,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-14 00:11:03,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 00:11:03,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:03,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:03,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:03,713 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058400398] [2025-04-14 00:11:03,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058400398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:03,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:03,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:03,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858997197] [2025-04-14 00:11:03,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:03,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:03,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:03,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:03,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:03,714 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:03,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-14 00:11:03,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:03,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:03,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:03,996 INFO L116 PetriNetUnfolderBase]: 1561/2375 cut-off events. [2025-04-14 00:11:03,997 INFO L117 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2025-04-14 00:11:04,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 2375 events. 1561/2375 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 10661 event pairs, 487 based on Foata normal form. 64/2434 useless extension candidates. Maximal degree in co-relation 5889. Up to 918 conditions per place. [2025-04-14 00:11:04,011 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 64 selfloop transitions, 11 changer transitions 1/79 dead transitions. [2025-04-14 00:11:04,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 79 transitions, 388 flow [2025-04-14 00:11:04,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:11:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:11:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2025-04-14 00:11:04,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2025-04-14 00:11:04,015 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 144 flow. Second operand 6 states and 114 transitions. [2025-04-14 00:11:04,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 79 transitions, 388 flow [2025-04-14 00:11:04,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 363 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:04,026 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 158 flow [2025-04-14 00:11:04,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2025-04-14 00:11:04,027 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2025-04-14 00:11:04,027 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 158 flow [2025-04-14 00:11:04,028 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 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-04-14 00:11:04,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:04,028 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] [2025-04-14 00:11:04,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:04,028 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:04,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1823606067, now seen corresponding path program 1 times [2025-04-14 00:11:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:04,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271635969] [2025-04-14 00:11:04,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:04,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:11:04,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:11:04,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:04,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:04,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:04,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271635969] [2025-04-14 00:11:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271635969] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:04,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:04,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:04,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941402878] [2025-04-14 00:11:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:04,285 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:11:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:04,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:11:04,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:11:04,286 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:04,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-14 00:11:04,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:04,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:04,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:04,843 INFO L116 PetriNetUnfolderBase]: 2885/4397 cut-off events. [2025-04-14 00:11:04,843 INFO L117 PetriNetUnfolderBase]: For 3252/3252 co-relation queries the response was YES. [2025-04-14 00:11:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11242 conditions, 4397 events. 2885/4397 cut-off events. For 3252/3252 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 22562 event pairs, 105 based on Foata normal form. 16/4411 useless extension candidates. Maximal degree in co-relation 11227. Up to 1800 conditions per place. [2025-04-14 00:11:04,877 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 69 selfloop transitions, 8 changer transitions 53/133 dead transitions. [2025-04-14 00:11:04,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 133 transitions, 810 flow [2025-04-14 00:11:04,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-14 00:11:04,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-14 00:11:04,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 158 transitions. [2025-04-14 00:11:04,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2025-04-14 00:11:04,879 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 158 flow. Second operand 8 states and 158 transitions. [2025-04-14 00:11:04,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 133 transitions, 810 flow [2025-04-14 00:11:04,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 133 transitions, 616 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-04-14 00:11:04,906 INFO L231 Difference]: Finished difference. Result has 56 places, 43 transitions, 157 flow [2025-04-14 00:11:04,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=157, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2025-04-14 00:11:04,907 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2025-04-14 00:11:04,907 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 157 flow [2025-04-14 00:11:04,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-04-14 00:11:04,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:04,907 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] [2025-04-14 00:11:04,907 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:11:04,907 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:04,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2043849569, now seen corresponding path program 2 times [2025-04-14 00:11:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:04,908 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357653847] [2025-04-14 00:11:04,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 00:11:04,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:04,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:11:04,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:11:04,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 00:11:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:05,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:05,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357653847] [2025-04-14 00:11:05,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357653847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:05,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:05,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:05,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016291691] [2025-04-14 00:11:05,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:05,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:05,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:05,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:05,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:05,230 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:05,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:05,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:05,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:05,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:05,617 INFO L116 PetriNetUnfolderBase]: 2505/3967 cut-off events. [2025-04-14 00:11:05,617 INFO L117 PetriNetUnfolderBase]: For 1305/1305 co-relation queries the response was YES. [2025-04-14 00:11:05,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9524 conditions, 3967 events. 2505/3967 cut-off events. For 1305/1305 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 20970 event pairs, 1177 based on Foata normal form. 8/3971 useless extension candidates. Maximal degree in co-relation 9507. Up to 2136 conditions per place. [2025-04-14 00:11:05,637 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 37 selfloop transitions, 2 changer transitions 31/73 dead transitions. [2025-04-14 00:11:05,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 396 flow [2025-04-14 00:11:05,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:11:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:11:05,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-04-14 00:11:05,639 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2025-04-14 00:11:05,639 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 157 flow. Second operand 4 states and 77 transitions. [2025-04-14 00:11:05,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 396 flow [2025-04-14 00:11:05,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 73 transitions, 388 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-14 00:11:05,645 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 133 flow [2025-04-14 00:11:05,645 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2025-04-14 00:11:05,645 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2025-04-14 00:11:05,645 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 133 flow [2025-04-14 00:11:05,646 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:05,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:05,646 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] [2025-04-14 00:11:05,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:11:05,646 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:05,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1722495549, now seen corresponding path program 3 times [2025-04-14 00:11:05,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:05,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675289799] [2025-04-14 00:11:05,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 00:11:05,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:05,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:11:05,720 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:11:05,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 00:11:05,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 00:11:06,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:06,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675289799] [2025-04-14 00:11:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675289799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:11:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414823415] [2025-04-14 00:11:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:06,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 00:11:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 00:11:06,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-14 00:11:06,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 37 [2025-04-14 00:11:06,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 133 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-04-14 00:11:06,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:06,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 37 [2025-04-14 00:11:06,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:06,663 INFO L116 PetriNetUnfolderBase]: 953/1525 cut-off events. [2025-04-14 00:11:06,663 INFO L117 PetriNetUnfolderBase]: For 340/340 co-relation queries the response was YES. [2025-04-14 00:11:06,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3558 conditions, 1525 events. 953/1525 cut-off events. For 340/340 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6477 event pairs, 236 based on Foata normal form. 8/1533 useless extension candidates. Maximal degree in co-relation 3541. Up to 778 conditions per place. [2025-04-14 00:11:06,669 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 44 selfloop transitions, 5 changer transitions 33/85 dead transitions. [2025-04-14 00:11:06,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 439 flow [2025-04-14 00:11:06,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 00:11:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-14 00:11:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 123 transitions. [2025-04-14 00:11:06,670 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36936936936936937 [2025-04-14 00:11:06,671 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 133 flow. Second operand 9 states and 123 transitions. [2025-04-14 00:11:06,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 439 flow [2025-04-14 00:11:06,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 85 transitions, 403 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-14 00:11:06,673 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 131 flow [2025-04-14 00:11:06,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=131, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2025-04-14 00:11:06,673 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2025-04-14 00:11:06,673 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 131 flow [2025-04-14 00:11:06,675 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 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-04-14 00:11:06,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:06,675 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] [2025-04-14 00:11:06,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:11:06,675 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-14 00:11:06,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash -697086227, now seen corresponding path program 4 times [2025-04-14 00:11:06,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:06,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841838363] [2025-04-14 00:11:06,676 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 00:11:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:06,686 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-14 00:11:06,728 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:11:06,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 00:11:06,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:06,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:11:06,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 00:11:06,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 00:11:06,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:06,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:06,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:11:06,825 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:11:06,825 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-14 00:11:06,827 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-14 00:11:06,828 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-14 00:11:06,828 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-14 00:11:06,828 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-14 00:11:06,828 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-14 00:11:06,829 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:11:06,829 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2025-04-14 00:11:06,918 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:06,918 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:06,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:06 BasicIcfg [2025-04-14 00:11:06,931 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:06,932 INFO L158 Benchmark]: Toolchain (without parser) took 8623.12ms. Allocated memory was 155.2MB in the beginning and 562.0MB in the end (delta: 406.8MB). Free memory was 108.4MB in the beginning and 477.9MB in the end (delta: -369.5MB). Peak memory consumption was 355.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:06,932 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:06,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.37ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 82.6MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:06,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.61ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:06,932 INFO L158 Benchmark]: Boogie Preprocessor took 53.18ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 77.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:06,933 INFO L158 Benchmark]: IcfgBuilder took 747.63ms. Allocated memory is still 155.2MB. Free memory was 77.4MB in the beginning and 95.4MB in the end (delta: -18.0MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. [2025-04-14 00:11:06,933 INFO L158 Benchmark]: TraceAbstraction took 7153.64ms. Allocated memory was 155.2MB in the beginning and 562.0MB in the end (delta: 406.8MB). Free memory was 94.6MB in the beginning and 477.9MB in the end (delta: -383.3MB). Peak memory consumption was 339.8MB. Max. memory is 8.0GB. [2025-04-14 00:11:06,935 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.59ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 615.37ms. Allocated memory is still 155.2MB. Free memory was 108.4MB in the beginning and 82.6MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.61ms. Allocated memory is still 155.2MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.18ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 77.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 747.63ms. Allocated memory is still 155.2MB. Free memory was 77.4MB in the beginning and 95.4MB in the end (delta: -18.0MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. * TraceAbstraction took 7153.64ms. Allocated memory was 155.2MB in the beginning and 562.0MB in the end (delta: 406.8MB). Free memory was 94.6MB in the beginning and 477.9MB in the end (delta: -383.3MB). Peak memory consumption was 339.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2577; [L828] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2577=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t2578; [L830] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577=-2, t2578=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L831] 0 pthread_t t2579; [L832] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2577=-2, t2578=-1, t2579=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L794] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L794] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L802] 3 z = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 z = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L760] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577=-2, t2578=-1, t2579=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L836] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L836] RET 0 assume_abort_if_not(main$tmp_guard0) [L838] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L839] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L840] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L841] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L842] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577=-2, t2578=-1, t2579=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2577=-2, t2578=-1, t2579=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L847] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 65 locations, 61 edges, 6 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: 6.9s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 439 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 881 IncrementalHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 0 mSDtfsCounter, 881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=4, InterpolantAutomatonStates: 39, 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.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 667 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 00:11:06,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...