/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 FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:39:52,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:39:52,636 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-13 22:39:52,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:39:52,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:39:52,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:39:52,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:39:52,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:39:52,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:39:52,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:39:52,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:39:52,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:39:52,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:39:52,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:39:52,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:39:52,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:39:52,661 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:39:52,662 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:39:52,662 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 -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:39:52,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:39:52,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:39:52,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:39:52,910 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:39:52,911 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:39:52,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-04-13 22:39:54,215 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7261f574/7ec7a989f1794079be1f4f408001b9cc/FLAGf8e452f2b [2025-04-13 22:39:54,416 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:39:54,417 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c [2025-04-13 22:39:54,425 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7261f574/7ec7a989f1794079be1f4f408001b9cc/FLAGf8e452f2b [2025-04-13 22:39:55,214 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7261f574/7ec7a989f1794079be1f4f408001b9cc [2025-04-13 22:39:55,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:39:55,217 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:39:55,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:39:55,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:39:55,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:39:55,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c01de96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55, skipping insertion in model container [2025-04-13 22:39:55,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:39:55,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-04-13 22:39:55,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:39:55,390 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:39:55,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt.wvr.c[4345,4358] [2025-04-13 22:39:55,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:39:55,442 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:39:55,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55 WrapperNode [2025-04-13 22:39:55,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:39:55,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:39:55,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:39:55,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:39:55,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,477 INFO L138 Inliner]: procedures = 25, calls = 59, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 293 [2025-04-13 22:39:55,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:39:55,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:39:55,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:39:55,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:39:55,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,496 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 22:39:55,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:39:55,518 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:39:55,518 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:39:55,518 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:39:55,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (1/1) ... [2025-04-13 22:39:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:39:55,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:39:55,542 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-13 22:39:55,543 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-13 22:39:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:39:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:39:55,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:39:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:39:55,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:39:55,558 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:39:55,558 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-13 22:39:55,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:39:55,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:39:55,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:39:55,560 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:39:55,645 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:39:55,646 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:39:56,022 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:39:56,023 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:39:56,023 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:39:56,377 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:39:56,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:39:56 BoogieIcfgContainer [2025-04-13 22:39:56,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:39:56,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:39:56,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:39:56,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:39:56,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:39:55" (1/3) ... [2025-04-13 22:39:56,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f070c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:39:56, skipping insertion in model container [2025-04-13 22:39:56,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:39:55" (2/3) ... [2025-04-13 22:39:56,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f070c9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:39:56, skipping insertion in model container [2025-04-13 22:39:56,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:39:56" (3/3) ... [2025-04-13 22:39:56,383 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt.wvr.c [2025-04-13 22:39:56,395 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:39:56,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-buffer-mult-alt.wvr.c that has 5 procedures, 44 locations, 45 edges, 1 initial locations, 6 loop locations, and 1 error locations. [2025-04-13 22:39:56,396 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:39:56,452 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-13 22:39:56,476 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 49 transitions, 126 flow [2025-04-13 22:39:56,713 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 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-13 22:39:56,732 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:39:56,740 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=FINITE_AUTOMATA, 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;@42b278a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:39:56,740 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 22:39:56,756 INFO L278 IsEmpty]: Start isEmpty. Operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 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-13 22:39:56,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:39:56,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:56,799 INFO L218 NwaCegarLoop]: 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] [2025-04-13 22:39:56,799 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:39:56,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:56,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1398466010, now seen corresponding path program 1 times [2025-04-13 22:39:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:56,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954336884] [2025-04-13 22:39:56,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:39:56,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:56,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:39:56,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:39:56,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:39:56,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:57,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-13 22:39:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:57,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954336884] [2025-04-13 22:39:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954336884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:39:57,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:39:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:39:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776533962] [2025-04-13 22:39:57,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:39:57,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:39:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:57,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:39:57,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:39:57,407 INFO L87 Difference]: Start difference. First operand has 4528 states, 4527 states have (on average 4.34857521537442) internal successors, (19686), 4527 states have internal predecessors, (19686), 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) Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-13 22:39:57,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:57,794 INFO L93 Difference]: Finished difference Result 7240 states and 31416 transitions. [2025-04-13 22:39:57,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:39:57,798 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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) Word has length 28 [2025-04-13 22:39:57,798 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:57,864 INFO L225 Difference]: With dead ends: 7240 [2025-04-13 22:39:57,864 INFO L226 Difference]: Without dead ends: 6340 [2025-04-13 22:39:57,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:39:57,872 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 74 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:57,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 27 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:39:57,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6340 states. [2025-04-13 22:39:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6340 to 5132. [2025-04-13 22:39:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5132 states, 5131 states have (on average 4.353147534593647) internal successors, (22336), 5131 states have internal predecessors, (22336), 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-13 22:39:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5132 states to 5132 states and 22336 transitions. [2025-04-13 22:39:58,194 INFO L79 Accepts]: Start accepts. Automaton has 5132 states and 22336 transitions. Word has length 28 [2025-04-13 22:39:58,194 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:58,194 INFO L485 AbstractCegarLoop]: Abstraction has 5132 states and 22336 transitions. [2025-04-13 22:39:58,195 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 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-13 22:39:58,195 INFO L278 IsEmpty]: Start isEmpty. Operand 5132 states and 22336 transitions. [2025-04-13 22:39:58,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-13 22:39:58,212 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:58,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:58,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:39:58,212 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:39:58,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1949027349, now seen corresponding path program 1 times [2025-04-13 22:39:58,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:58,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145642876] [2025-04-13 22:39:58,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:39:58,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:58,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-13 22:39:58,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-13 22:39:58,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:39:58,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:39:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:58,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145642876] [2025-04-13 22:39:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145642876] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:39:58,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:39:58,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:39:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336911205] [2025-04-13 22:39:58,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:39:58,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:39:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:58,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:39:58,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:39:58,432 INFO L87 Difference]: Start difference. First operand 5132 states and 22336 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-13 22:39:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:58,761 INFO L93 Difference]: Finished difference Result 11651 states and 50793 transitions. [2025-04-13 22:39:58,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 22:39:58,761 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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) Word has length 32 [2025-04-13 22:39:58,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:58,800 INFO L225 Difference]: With dead ends: 11651 [2025-04-13 22:39:58,801 INFO L226 Difference]: Without dead ends: 5133 [2025-04-13 22:39:58,812 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:39:58,813 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:58,813 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:39:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5133 states. [2025-04-13 22:39:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5133 to 5133. [2025-04-13 22:39:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5133 states, 5132 states have (on average 4.352494154325799) internal successors, (22337), 5132 states have internal predecessors, (22337), 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-13 22:39:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5133 states to 5133 states and 22337 transitions. [2025-04-13 22:39:59,030 INFO L79 Accepts]: Start accepts. Automaton has 5133 states and 22337 transitions. Word has length 32 [2025-04-13 22:39:59,030 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:39:59,030 INFO L485 AbstractCegarLoop]: Abstraction has 5133 states and 22337 transitions. [2025-04-13 22:39:59,031 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 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-13 22:39:59,031 INFO L278 IsEmpty]: Start isEmpty. Operand 5133 states and 22337 transitions. [2025-04-13 22:39:59,044 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:39:59,044 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:39:59,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:39:59,044 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:39:59,044 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:39:59,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:39:59,045 INFO L85 PathProgramCache]: Analyzing trace with hash -421801122, now seen corresponding path program 1 times [2025-04-13 22:39:59,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:39:59,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331079781] [2025-04-13 22:39:59,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:39:59,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:39:59,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-13 22:39:59,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:39:59,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:39:59,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:39:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:39:59,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:39:59,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331079781] [2025-04-13 22:39:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331079781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:39:59,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:39:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:39:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352141572] [2025-04-13 22:39:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:39:59,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:39:59,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:39:59,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:39:59,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:39:59,261 INFO L87 Difference]: Start difference. First operand 5133 states and 22337 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:39:59,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:39:59,716 INFO L93 Difference]: Finished difference Result 9285 states and 40743 transitions. [2025-04-13 22:39:59,716 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:39:59,716 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:39:59,716 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:39:59,804 INFO L225 Difference]: With dead ends: 9285 [2025-04-13 22:39:59,804 INFO L226 Difference]: Without dead ends: 8445 [2025-04-13 22:39:59,808 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-13 22:39:59,810 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:39:59,810 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 42 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:39:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8445 states. [2025-04-13 22:40:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8445 to 6389. [2025-04-13 22:40:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6389 states, 6388 states have (on average 4.35551033187226) internal successors, (27823), 6388 states have internal predecessors, (27823), 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-13 22:40:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6389 states to 6389 states and 27823 transitions. [2025-04-13 22:40:00,171 INFO L79 Accepts]: Start accepts. Automaton has 6389 states and 27823 transitions. Word has length 33 [2025-04-13 22:40:00,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:00,172 INFO L485 AbstractCegarLoop]: Abstraction has 6389 states and 27823 transitions. [2025-04-13 22:40:00,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:00,172 INFO L278 IsEmpty]: Start isEmpty. Operand 6389 states and 27823 transitions. [2025-04-13 22:40:00,192 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-04-13 22:40:00,192 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:00,192 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:00,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:40:00,193 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:00,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:00,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1921361886, now seen corresponding path program 2 times [2025-04-13 22:40:00,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:00,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217949427] [2025-04-13 22:40:00,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:40:00,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:00,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-04-13 22:40:00,215 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 22:40:00,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:40:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:00,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:00,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217949427] [2025-04-13 22:40:00,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217949427] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:00,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:00,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:40:00,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286820463] [2025-04-13 22:40:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:00,368 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:40:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:00,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:40:00,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:40:00,369 INFO L87 Difference]: Start difference. First operand 6389 states and 27823 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:00,910 INFO L93 Difference]: Finished difference Result 11883 states and 51845 transitions. [2025-04-13 22:40:00,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:40:00,911 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-04-13 22:40:00,911 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:00,964 INFO L225 Difference]: With dead ends: 11883 [2025-04-13 22:40:00,964 INFO L226 Difference]: Without dead ends: 11337 [2025-04-13 22:40:00,969 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-04-13 22:40:00,972 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 96 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:00,972 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 46 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:40:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11337 states. [2025-04-13 22:40:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11337 to 6503. [2025-04-13 22:40:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6503 states, 6502 states have (on average 4.360350661334974) internal successors, (28351), 6502 states have internal predecessors, (28351), 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-13 22:40:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6503 states to 6503 states and 28351 transitions. [2025-04-13 22:40:01,328 INFO L79 Accepts]: Start accepts. Automaton has 6503 states and 28351 transitions. Word has length 33 [2025-04-13 22:40:01,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:01,328 INFO L485 AbstractCegarLoop]: Abstraction has 6503 states and 28351 transitions. [2025-04-13 22:40:01,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:01,328 INFO L278 IsEmpty]: Start isEmpty. Operand 6503 states and 28351 transitions. [2025-04-13 22:40:01,345 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-13 22:40:01,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:01,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:01,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:40:01,345 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:01,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:01,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1204285332, now seen corresponding path program 1 times [2025-04-13 22:40:01,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:01,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736658165] [2025-04-13 22:40:01,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:01,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:01,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:40:01,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:40:01,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:01,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:02,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:40:02,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:02,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736658165] [2025-04-13 22:40:02,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736658165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:02,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954173549] [2025-04-13 22:40:02,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:02,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:02,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:02,049 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:40:02,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:40:02,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-13 22:40:02,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-13 22:40:02,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:02,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:02,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:40:02,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:02,260 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-13 22:40:02,529 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-04-13 22:40:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:40:02,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:02,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2025-04-13 22:40:02,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 35 [2025-04-13 22:40:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:40:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954173549] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:03,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2025-04-13 22:40:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839244513] [2025-04-13 22:40:03,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:03,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:40:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:03,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:40:03,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:40:03,009 INFO L87 Difference]: Start difference. First operand 6503 states and 28351 transitions. Second operand has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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-13 22:40:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:06,770 INFO L93 Difference]: Finished difference Result 34455 states and 149979 transitions. [2025-04-13 22:40:06,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:40:06,771 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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) Word has length 36 [2025-04-13 22:40:06,771 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:06,914 INFO L225 Difference]: With dead ends: 34455 [2025-04-13 22:40:06,915 INFO L226 Difference]: Without dead ends: 28679 [2025-04-13 22:40:06,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:40:06,933 INFO L437 NwaCegarLoop]: 34 mSDtfsCounter, 603 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:06,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 315 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:40:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28679 states. [2025-04-13 22:40:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28679 to 15138. [2025-04-13 22:40:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 4.353240404307327) internal successors, (65895), 15137 states have internal predecessors, (65895), 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-13 22:40:08,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 65895 transitions. [2025-04-13 22:40:08,599 INFO L79 Accepts]: Start accepts. Automaton has 15138 states and 65895 transitions. Word has length 36 [2025-04-13 22:40:08,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:08,600 INFO L485 AbstractCegarLoop]: Abstraction has 15138 states and 65895 transitions. [2025-04-13 22:40:08,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 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-13 22:40:08,600 INFO L278 IsEmpty]: Start isEmpty. Operand 15138 states and 65895 transitions. [2025-04-13 22:40:08,647 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-13 22:40:08,647 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:08,647 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:08,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 22:40:08,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:08,851 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:08,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:08,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2042478237, now seen corresponding path program 1 times [2025-04-13 22:40:08,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:08,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727912685] [2025-04-13 22:40:08,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:08,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:08,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:40:08,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:40:08,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:08,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:40:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:09,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727912685] [2025-04-13 22:40:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727912685] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:09,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282183757] [2025-04-13 22:40:09,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:09,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:09,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:09,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:40:09,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:40:09,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-13 22:40:09,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-13 22:40:09,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:09,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:09,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:40:09,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:10,092 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2025-04-13 22:40:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:40:10,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:10,207 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:40:10,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2025-04-13 22:40:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 22:40:10,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282183757] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:10,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 13 [2025-04-13 22:40:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988689095] [2025-04-13 22:40:10,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:10,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 22:40:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:10,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 22:40:10,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-04-13 22:40:10,381 INFO L87 Difference]: Start difference. First operand 15138 states and 65895 transitions. Second operand has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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-13 22:40:17,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:17,661 INFO L93 Difference]: Finished difference Result 49132 states and 214066 transitions. [2025-04-13 22:40:17,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:40:17,661 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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) Word has length 38 [2025-04-13 22:40:17,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:17,882 INFO L225 Difference]: With dead ends: 49132 [2025-04-13 22:40:17,882 INFO L226 Difference]: Without dead ends: 43183 [2025-04-13 22:40:17,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:40:17,905 INFO L437 NwaCegarLoop]: 23 mSDtfsCounter, 535 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:17,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 257 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:40:17,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43183 states. [2025-04-13 22:40:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43183 to 19549. [2025-04-13 22:40:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19549 states, 19548 states have (on average 4.367045222017598) internal successors, (85367), 19548 states have internal predecessors, (85367), 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-13 22:40:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19549 states to 19549 states and 85367 transitions. [2025-04-13 22:40:20,887 INFO L79 Accepts]: Start accepts. Automaton has 19549 states and 85367 transitions. Word has length 38 [2025-04-13 22:40:20,888 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:20,889 INFO L485 AbstractCegarLoop]: Abstraction has 19549 states and 85367 transitions. [2025-04-13 22:40:20,889 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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-13 22:40:20,889 INFO L278 IsEmpty]: Start isEmpty. Operand 19549 states and 85367 transitions. [2025-04-13 22:40:20,935 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-04-13 22:40:20,935 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:20,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:20,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 22:40:21,136 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 22:40:21,136 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:21,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1147401310, now seen corresponding path program 1 times [2025-04-13 22:40:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:21,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843157582] [2025-04-13 22:40:21,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:21,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 22:40:21,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 22:40:21,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:21,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:21,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:40:21,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:21,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843157582] [2025-04-13 22:40:21,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843157582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:21,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:21,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:40:21,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853023618] [2025-04-13 22:40:21,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:21,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:40:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:21,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:40:21,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:40:21,199 INFO L87 Difference]: Start difference. First operand 19549 states and 85367 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:25,971 INFO L93 Difference]: Finished difference Result 30927 states and 135382 transitions. [2025-04-13 22:40:25,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:40:25,971 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-04-13 22:40:25,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:26,088 INFO L225 Difference]: With dead ends: 30927 [2025-04-13 22:40:26,088 INFO L226 Difference]: Without dead ends: 25295 [2025-04-13 22:40:26,103 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:40:26,104 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:26,104 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 15 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:40:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25295 states. [2025-04-13 22:40:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25295 to 24192. [2025-04-13 22:40:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24192 states, 24191 states have (on average 4.3645984043652595) internal successors, (105584), 24191 states have internal predecessors, (105584), 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-13 22:40:29,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24192 states to 24192 states and 105584 transitions. [2025-04-13 22:40:29,676 INFO L79 Accepts]: Start accepts. Automaton has 24192 states and 105584 transitions. Word has length 39 [2025-04-13 22:40:29,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:29,676 INFO L485 AbstractCegarLoop]: Abstraction has 24192 states and 105584 transitions. [2025-04-13 22:40:29,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:40:29,677 INFO L278 IsEmpty]: Start isEmpty. Operand 24192 states and 105584 transitions. [2025-04-13 22:40:29,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 22:40:29,724 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:29,725 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:29,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:40:29,725 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:29,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1742461125, now seen corresponding path program 2 times [2025-04-13 22:40:29,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:29,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611075928] [2025-04-13 22:40:29,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:40:29,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:29,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 22:40:29,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:40:29,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:40:29,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:40:29,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:29,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611075928] [2025-04-13 22:40:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611075928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:40:29,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771334542] [2025-04-13 22:40:29,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:40:29,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:29,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:40:29,831 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:40:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:40:29,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 22:40:29,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:40:29,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:40:29,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:29,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 22:40:29,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:40:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:30,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:40:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:40:30,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771334542] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:40:30,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:40:30,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 16 [2025-04-13 22:40:30,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736292524] [2025-04-13 22:40:30,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:40:30,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 22:40:30,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:30,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 22:40:30,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-04-13 22:40:30,313 INFO L87 Difference]: Start difference. First operand 24192 states and 105584 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-13 22:40:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:41,166 INFO L93 Difference]: Finished difference Result 69035 states and 299817 transitions. [2025-04-13 22:40:41,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:40:41,167 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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) Word has length 43 [2025-04-13 22:40:41,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:40:41,416 INFO L225 Difference]: With dead ends: 69035 [2025-04-13 22:40:41,417 INFO L226 Difference]: Without dead ends: 55726 [2025-04-13 22:40:41,447 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:40:41,447 INFO L437 NwaCegarLoop]: 20 mSDtfsCounter, 420 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:40:41,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 161 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:40:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55726 states. [2025-04-13 22:40:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55726 to 39955. [2025-04-13 22:40:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39955 states, 39954 states have (on average 4.417955648996346) internal successors, (176515), 39954 states have internal predecessors, (176515), 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-13 22:40:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39955 states to 39955 states and 176515 transitions. [2025-04-13 22:40:48,421 INFO L79 Accepts]: Start accepts. Automaton has 39955 states and 176515 transitions. Word has length 43 [2025-04-13 22:40:48,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:40:48,421 INFO L485 AbstractCegarLoop]: Abstraction has 39955 states and 176515 transitions. [2025-04-13 22:40:48,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-13 22:40:48,422 INFO L278 IsEmpty]: Start isEmpty. Operand 39955 states and 176515 transitions. [2025-04-13 22:40:48,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-04-13 22:40:48,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:40:48,543 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:40:48,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:40:48,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:40:48,744 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:40:48,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:40:48,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2009383493, now seen corresponding path program 1 times [2025-04-13 22:40:48,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:40:48,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523868172] [2025-04-13 22:40:48,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:40:48,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:40:48,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-13 22:40:48,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 22:40:48,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:40:48,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:40:48,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:40:48,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:40:48,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523868172] [2025-04-13 22:40:48,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523868172] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:40:48,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:40:48,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:40:48,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300626146] [2025-04-13 22:40:48,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:40:48,830 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:40:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:40:48,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:40:48,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:40:48,831 INFO L87 Difference]: Start difference. First operand 39955 states and 176515 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 22:40:59,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:40:59,992 INFO L93 Difference]: Finished difference Result 81304 states and 357831 transitions. [2025-04-13 22:40:59,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:40:59,993 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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) Word has length 43 [2025-04-13 22:40:59,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:00,241 INFO L225 Difference]: With dead ends: 81304 [2025-04-13 22:41:00,241 INFO L226 Difference]: Without dead ends: 50048 [2025-04-13 22:41:00,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:41:00,287 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:00,287 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:41:00,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50048 states. [2025-04-13 22:41:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50048 to 47012. [2025-04-13 22:41:08,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47012 states, 47011 states have (on average 4.373104167109825) internal successors, (205584), 47011 states have internal predecessors, (205584), 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-13 22:41:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47012 states to 47012 states and 205584 transitions. [2025-04-13 22:41:08,305 INFO L79 Accepts]: Start accepts. Automaton has 47012 states and 205584 transitions. Word has length 43 [2025-04-13 22:41:08,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:41:08,305 INFO L485 AbstractCegarLoop]: Abstraction has 47012 states and 205584 transitions. [2025-04-13 22:41:08,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-13 22:41:08,305 INFO L278 IsEmpty]: Start isEmpty. Operand 47012 states and 205584 transitions. [2025-04-13 22:41:08,404 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:41:08,404 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:41:08,404 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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-13 22:41:08,404 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:41:08,404 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:41:08,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:41:08,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1756556946, now seen corresponding path program 3 times [2025-04-13 22:41:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:41:08,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115162949] [2025-04-13 22:41:08,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:41:08,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-04-13 22:41:08,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:41:08,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:41:08,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:09,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:41:09,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:41:09,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115162949] [2025-04-13 22:41:09,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115162949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:41:09,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962911926] [2025-04-13 22:41:09,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:41:09,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:41:09,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:41:09,098 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:41:09,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 22:41:09,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-04-13 22:41:09,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:41:09,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:41:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:41:09,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:41:09,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:41:09,500 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:41:09,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 12 [2025-04-13 22:41:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:41:09,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:41:09,713 INFO L325 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2025-04-13 22:41:09,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 41 [2025-04-13 22:41:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:41:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962911926] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:41:09,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:41:09,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 6] total 23 [2025-04-13 22:41:09,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697415935] [2025-04-13 22:41:09,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:41:09,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:41:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:41:09,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:41:09,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:41:09,883 INFO L87 Difference]: Start difference. First operand 47012 states and 205584 transitions. Second operand has 25 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 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-13 22:41:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:41:46,161 INFO L93 Difference]: Finished difference Result 150346 states and 651052 transitions. [2025-04-13 22:41:46,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 22:41:46,161 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 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) Word has length 44 [2025-04-13 22:41:46,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:41:47,468 INFO L225 Difference]: With dead ends: 150346 [2025-04-13 22:41:47,469 INFO L226 Difference]: Without dead ends: 143665 [2025-04-13 22:41:47,525 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=641, Invalid=2551, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:41:47,525 INFO L437 NwaCegarLoop]: 44 mSDtfsCounter, 1518 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:41:47,525 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 586 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:41:47,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143665 states. [2025-04-13 22:42:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143665 to 62227. [2025-04-13 22:42:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62227 states, 62226 states have (on average 4.45824896345579) internal successors, (277419), 62226 states have internal predecessors, (277419), 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-13 22:42:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62227 states to 62227 states and 277419 transitions. [2025-04-13 22:42:02,354 INFO L79 Accepts]: Start accepts. Automaton has 62227 states and 277419 transitions. Word has length 44 [2025-04-13 22:42:02,355 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:42:02,355 INFO L485 AbstractCegarLoop]: Abstraction has 62227 states and 277419 transitions. [2025-04-13 22:42:02,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 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-13 22:42:02,355 INFO L278 IsEmpty]: Start isEmpty. Operand 62227 states and 277419 transitions. [2025-04-13 22:42:02,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:42:02,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:42:02,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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-13 22:42:02,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:42:02,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:02,716 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:42:02,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:42:02,716 INFO L85 PathProgramCache]: Analyzing trace with hash 628552040, now seen corresponding path program 4 times [2025-04-13 22:42:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:42:02,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193777770] [2025-04-13 22:42:02,717 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:42:02,725 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:42:02,742 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:42:02,742 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:02,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:42:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:42:03,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193777770] [2025-04-13 22:42:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193777770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:42:03,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799398582] [2025-04-13 22:42:03,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:42:03,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:42:03,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:42:03,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:42:03,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 22:42:03,735 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:42:03,758 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:42:03,758 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:42:03,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:42:03,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:42:03,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:42:03,809 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:42:04,189 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:42:04,189 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-04-13 22:42:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:42:04,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:42:04,874 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 82 [2025-04-13 22:42:04,879 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:42:04,879 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 131 [2025-04-13 22:42:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:42:04,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799398582] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:42:04,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:42:04,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 29 [2025-04-13 22:42:04,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18820110] [2025-04-13 22:42:04,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:42:04,991 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:42:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:42:04,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:42:04,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=760, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:42:04,992 INFO L87 Difference]: Start difference. First operand 62227 states and 277419 transitions. Second operand has 31 states, 30 states have (on average 4.233333333333333) internal successors, (127), 30 states have internal predecessors, (127), 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-13 22:43:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:43:01,539 INFO L93 Difference]: Finished difference Result 161780 states and 694767 transitions. [2025-04-13 22:43:01,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-04-13 22:43:01,540 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 4.233333333333333) internal successors, (127), 30 states have internal predecessors, (127), 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) Word has length 44 [2025-04-13 22:43:01,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:43:02,321 INFO L225 Difference]: With dead ends: 161780 [2025-04-13 22:43:02,321 INFO L226 Difference]: Without dead ends: 141324 [2025-04-13 22:43:02,390 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2641 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2055, Invalid=7257, Unknown=0, NotChecked=0, Total=9312 [2025-04-13 22:43:02,391 INFO L437 NwaCegarLoop]: 129 mSDtfsCounter, 2190 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 6781 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 6926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 6781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:43:02,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 1534 Invalid, 6926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 6781 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-04-13 22:43:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141324 states. [2025-04-13 22:43:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141324 to 64331. [2025-04-13 22:43:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64331 states, 64330 states have (on average 4.448981812529147) internal successors, (286203), 64330 states have internal predecessors, (286203), 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-13 22:43:22,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64331 states to 64331 states and 286203 transitions. [2025-04-13 22:43:22,696 INFO L79 Accepts]: Start accepts. Automaton has 64331 states and 286203 transitions. Word has length 44 [2025-04-13 22:43:22,696 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:43:22,697 INFO L485 AbstractCegarLoop]: Abstraction has 64331 states and 286203 transitions. [2025-04-13 22:43:22,697 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 4.233333333333333) internal successors, (127), 30 states have internal predecessors, (127), 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-13 22:43:22,697 INFO L278 IsEmpty]: Start isEmpty. Operand 64331 states and 286203 transitions. [2025-04-13 22:43:22,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:43:22,951 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:43:22,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:43:22,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 22:43:23,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 22:43:23,152 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:43:23,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:43:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 527402639, now seen corresponding path program 1 times [2025-04-13 22:43:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:43:23,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766037961] [2025-04-13 22:43:23,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:43:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:43:23,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:43:23,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:43:23,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:43:23,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:23,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:43:23,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:43:23,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766037961] [2025-04-13 22:43:23,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766037961] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:43:23,897 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614178225] [2025-04-13 22:43:23,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:43:23,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:43:23,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:43:23,899 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:43:23,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 22:43:23,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-13 22:43:24,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:43:24,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:43:24,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:43:24,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-13 22:43:24,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:43:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:43:24,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:43:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:43:24,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614178225] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:43:24,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:43:24,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 22 [2025-04-13 22:43:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727209343] [2025-04-13 22:43:24,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:43:24,550 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:43:24,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:43:24,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:43:24,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:43:24,551 INFO L87 Difference]: Start difference. First operand 64331 states and 286203 transitions. Second operand has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 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-13 22:44:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:44:18,283 INFO L93 Difference]: Finished difference Result 144253 states and 619394 transitions. [2025-04-13 22:44:18,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 22:44:18,287 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 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) Word has length 44 [2025-04-13 22:44:18,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:44:19,970 INFO L225 Difference]: With dead ends: 144253 [2025-04-13 22:44:19,971 INFO L226 Difference]: Without dead ends: 141196 [2025-04-13 22:44:20,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=943, Invalid=2839, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:44:20,050 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 516 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 2971 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:44:20,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 542 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2971 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 22:44:20,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141196 states. [2025-04-13 22:44:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141196 to 75815. [2025-04-13 22:44:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75815 states, 75814 states have (on average 4.431819980478539) internal successors, (335994), 75814 states have internal predecessors, (335994), 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-13 22:44:44,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75815 states to 75815 states and 335994 transitions. [2025-04-13 22:44:44,830 INFO L79 Accepts]: Start accepts. Automaton has 75815 states and 335994 transitions. Word has length 44 [2025-04-13 22:44:44,830 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:44:44,830 INFO L485 AbstractCegarLoop]: Abstraction has 75815 states and 335994 transitions. [2025-04-13 22:44:44,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.043478260869565) internal successors, (116), 22 states have internal predecessors, (116), 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-13 22:44:44,830 INFO L278 IsEmpty]: Start isEmpty. Operand 75815 states and 335994 transitions. [2025-04-13 22:44:45,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:44:45,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:44:45,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:44:45,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 22:44:45,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:44:45,331 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:44:45,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:44:45,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1505041783, now seen corresponding path program 2 times [2025-04-13 22:44:45,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:44:45,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398880827] [2025-04-13 22:44:45,332 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:44:45,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:44:45,375 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:44:45,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 38 of 44 statements. [2025-04-13 22:44:45,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:44:45,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:44:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:44:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:44:45,861 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398880827] [2025-04-13 22:44:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398880827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:44:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:44:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 22:44:45,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560742774] [2025-04-13 22:44:45,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:44:45,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 22:44:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:44:45,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 22:44:45,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:44:45,865 INFO L87 Difference]: Start difference. First operand 75815 states and 335994 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:45:29,367 INFO L93 Difference]: Finished difference Result 105003 states and 469781 transitions. [2025-04-13 22:45:29,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:45:29,368 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-04-13 22:45:29,368 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:45:29,927 INFO L225 Difference]: With dead ends: 105003 [2025-04-13 22:45:29,927 INFO L226 Difference]: Without dead ends: 98150 [2025-04-13 22:45:29,966 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:45:29,967 INFO L437 NwaCegarLoop]: 22 mSDtfsCounter, 84 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:45:29,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 70 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:45:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98150 states. [2025-04-13 22:45:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98150 to 79356. [2025-04-13 22:45:57,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79356 states, 79355 states have (on average 4.4378048012097535) internal successors, (352162), 79355 states have internal predecessors, (352162), 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-13 22:45:58,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79356 states to 79356 states and 352162 transitions. [2025-04-13 22:45:58,412 INFO L79 Accepts]: Start accepts. Automaton has 79356 states and 352162 transitions. Word has length 44 [2025-04-13 22:45:58,412 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:45:58,413 INFO L485 AbstractCegarLoop]: Abstraction has 79356 states and 352162 transitions. [2025-04-13 22:45:58,413 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:45:58,413 INFO L278 IsEmpty]: Start isEmpty. Operand 79356 states and 352162 transitions. [2025-04-13 22:45:58,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:45:58,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:45:58,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:45:58,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 22:45:58,641 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:45:58,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:45:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1048403553, now seen corresponding path program 3 times [2025-04-13 22:45:58,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:45:58,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390723807] [2025-04-13 22:45:58,642 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:45:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:45:58,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:45:58,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:45:58,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:45:58,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:45:58,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:45:58,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390723807] [2025-04-13 22:45:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390723807] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:45:58,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104106453] [2025-04-13 22:45:58,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:45:58,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:45:58,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:45:58,932 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:45:58,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 22:45:59,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:45:59,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:45:59,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:45:59,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:45:59,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:45:59,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:45:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:45:59,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:45:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:45:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104106453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:45:59,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:45:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2025-04-13 22:45:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306022425] [2025-04-13 22:45:59,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:45:59,701 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:45:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:45:59,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:45:59,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:45:59,701 INFO L87 Difference]: Start difference. First operand 79356 states and 352162 transitions. Second operand has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 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-13 22:47:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:47:23,557 INFO L93 Difference]: Finished difference Result 192461 states and 825215 transitions. [2025-04-13 22:47:23,557 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-04-13 22:47:23,558 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 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) Word has length 44 [2025-04-13 22:47:23,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:47:25,254 INFO L225 Difference]: With dead ends: 192461 [2025-04-13 22:47:25,254 INFO L226 Difference]: Without dead ends: 188444 [2025-04-13 22:47:25,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4460 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2281, Invalid=9929, Unknown=0, NotChecked=0, Total=12210 [2025-04-13 22:47:25,324 INFO L437 NwaCegarLoop]: 47 mSDtfsCounter, 983 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 4220 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 4220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 22:47:25,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 807 Invalid, 4274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 4220 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 22:47:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188444 states. [2025-04-13 22:47:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188444 to 82128. [2025-04-13 22:47:55,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82128 states, 82127 states have (on average 4.457937097422285) internal successors, (366117), 82127 states have internal predecessors, (366117), 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-13 22:47:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82128 states to 82128 states and 366117 transitions. [2025-04-13 22:47:56,774 INFO L79 Accepts]: Start accepts. Automaton has 82128 states and 366117 transitions. Word has length 44 [2025-04-13 22:47:56,775 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:47:56,775 INFO L485 AbstractCegarLoop]: Abstraction has 82128 states and 366117 transitions. [2025-04-13 22:47:56,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.086956521739131) internal successors, (117), 22 states have internal predecessors, (117), 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-13 22:47:56,776 INFO L278 IsEmpty]: Start isEmpty. Operand 82128 states and 366117 transitions. [2025-04-13 22:47:57,031 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:47:57,032 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:47:57,032 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:47:57,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 22:47:57,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:57,233 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:47:57,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:47:57,235 INFO L85 PathProgramCache]: Analyzing trace with hash -10300205, now seen corresponding path program 4 times [2025-04-13 22:47:57,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:47:57,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081132734] [2025-04-13 22:47:57,235 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:47:57,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:47:57,256 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:47:57,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:47:57,275 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:47:57,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:47:57,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:47:57,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081132734] [2025-04-13 22:47:57,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081132734] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:47:57,698 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270338864] [2025-04-13 22:47:57,698 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:47:57,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:47:57,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:47:57,700 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:47:57,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 22:47:57,790 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:47:57,820 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:47:57,821 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:47:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:47:57,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:47:57,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:47:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:47:58,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:47:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:47:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270338864] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:47:58,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:47:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2025-04-13 22:47:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303385650] [2025-04-13 22:47:58,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:47:58,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:47:58,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:47:58,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:47:58,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:47:58,632 INFO L87 Difference]: Start difference. First operand 82128 states and 366117 transitions. Second operand has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 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-13 22:50:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:50:13,485 INFO L93 Difference]: Finished difference Result 262661 states and 1141263 transitions. [2025-04-13 22:50:13,486 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2025-04-13 22:50:13,486 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 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) Word has length 44 [2025-04-13 22:50:13,486 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:50:15,865 INFO L225 Difference]: With dead ends: 262661 [2025-04-13 22:50:15,869 INFO L226 Difference]: Without dead ends: 258904 [2025-04-13 22:50:15,965 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4437 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2482, Invalid=9508, Unknown=0, NotChecked=0, Total=11990 [2025-04-13 22:50:15,966 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 1165 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 2572 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:50:15,966 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 507 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2572 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 22:50:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258904 states. [2025-04-13 22:50:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258904 to 84263. [2025-04-13 22:50:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84263 states, 84262 states have (on average 4.478104008924545) internal successors, (377334), 84262 states have internal predecessors, (377334), 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-13 22:50:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84263 states to 84263 states and 377334 transitions. [2025-04-13 22:50:51,793 INFO L79 Accepts]: Start accepts. Automaton has 84263 states and 377334 transitions. Word has length 44 [2025-04-13 22:50:51,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:50:51,794 INFO L485 AbstractCegarLoop]: Abstraction has 84263 states and 377334 transitions. [2025-04-13 22:50:51,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.434782608695652) internal successors, (125), 22 states have internal predecessors, (125), 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-13 22:50:51,794 INFO L278 IsEmpty]: Start isEmpty. Operand 84263 states and 377334 transitions. [2025-04-13 22:50:52,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-04-13 22:50:52,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:50:52,077 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:50:52,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:50:52,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 22:50:52,278 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 22:50:52,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:50:52,280 INFO L85 PathProgramCache]: Analyzing trace with hash -662363049, now seen corresponding path program 5 times [2025-04-13 22:50:52,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:50:52,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036103093] [2025-04-13 22:50:52,280 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:50:52,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:50:52,295 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:50:52,319 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:50:52,319 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:50:52,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:50:52,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:50:52,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036103093] [2025-04-13 22:50:52,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036103093] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:50:52,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751365951] [2025-04-13 22:50:52,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:50:52,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:50:52,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:50:52,671 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:50:52,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 22:50:52,775 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-13 22:50:52,828 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-13 22:50:52,828 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:50:52,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:50:52,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 22:50:52,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:50:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:50:53,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:50:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 22:50:53,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751365951] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:50:53,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:50:53,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 23 [2025-04-13 22:50:53,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854165543] [2025-04-13 22:50:53,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:50:53,531 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:50:53,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:50:53,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:50:53,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:50:53,531 INFO L87 Difference]: Start difference. First operand 84263 states and 377334 transitions. Second operand has 24 states, 24 states have (on average 5.25) internal successors, (126), 23 states have internal predecessors, (126), 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) Received shutdown request... [2025-04-13 22:51:21,820 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:51:21,820 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:51:21,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2025-04-13 22:51:21,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7787 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3481, Invalid=16825, Unknown=0, NotChecked=0, Total=20306 [2025-04-13 22:51:21,847 INFO L437 NwaCegarLoop]: 42 mSDtfsCounter, 977 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 4241 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 4341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 4241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:51:21,847 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 905 Invalid, 4341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 4241 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 22:51:21,848 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 22:51:21,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 22:51:22,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 22:51:22,050 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (84263states) and FLOYD_HOARE automaton (currently 135 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (45658 states constructed, input type IntersectNwa). [2025-04-13 22:51:22,052 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2025-04-13 22:51:22,052 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 22:51:22,052 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 22:51:22,052 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2025-04-13 22:51:22,062 INFO L422 BasicCegarLoop]: Path program histogram: [5, 4, 2, 1, 1, 1, 1, 1] [2025-04-13 22:51:22,069 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:51:22,069 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:51:22,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:51:22 BasicIcfg [2025-04-13 22:51:22,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:51:22,074 INFO L158 Benchmark]: Toolchain (without parser) took 686857.17ms. Allocated memory was 155.2MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 107.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 2.8GB. Max. memory is 8.0GB. [2025-04-13 22:51:22,074 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:51:22,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.10ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 90.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:51:22,076 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.23ms. Allocated memory is still 155.2MB. Free memory was 90.7MB in the beginning and 88.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:51:22,076 INFO L158 Benchmark]: Boogie Preprocessor took 39.94ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 85.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:51:22,076 INFO L158 Benchmark]: IcfgBuilder took 859.59ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 45.9MB in the end (delta: 39.3MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. [2025-04-13 22:51:22,076 INFO L158 Benchmark]: TraceAbstraction took 685694.51ms. Allocated memory was 155.2MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 45.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2025-04-13 22:51:22,077 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.10ms. Allocated memory is still 155.2MB. Free memory was 107.0MB in the beginning and 90.7MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.23ms. Allocated memory is still 155.2MB. Free memory was 90.7MB in the beginning and 88.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 39.94ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 85.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 859.59ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 45.9MB in the end (delta: 39.3MB). Peak memory consumption was 70.4MB. Max. memory is 8.0GB. * TraceAbstraction took 685694.51ms. Allocated memory was 155.2MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 45.2MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (84263states) and FLOYD_HOARE automaton (currently 135 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (45658 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (84263states) and FLOYD_HOARE automaton (currently 135 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (45658 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (84263states) and FLOYD_HOARE automaton (currently 135 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (45658 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (84263states) and FLOYD_HOARE automaton (currently 135 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (45658 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (84263states) and FLOYD_HOARE automaton (currently 135 states, 24 states before enhancement),while ReachableStatesComputation was computing reachable states (45658 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 74 locations, 83 edges, 5 error locations. Started 1 CEGAR loops. OverallTime: 685.6s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 2.0s, AutomataDifference: 486.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9266 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9266 mSDsluCounter, 5862 SdHoareTripleChecker+Invalid, 12.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5361 mSDsCounter, 516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26748 IncrementalHoareTripleChecker+Invalid, 27264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 516 mSolverCounterUnsat, 501 mSDtfsCounter, 26748 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1308 GetRequests, 639 SyntacticMatches, 9 SemanticMatches, 660 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21346 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84263occurred in iteration=15, InterpolantAutomatonStates: 458, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 177.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 588746 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1014 NumberOfCodeBlocks, 1008 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1361 ConstructedInterpolants, 4 QuantifiedInterpolants, 24575 SizeOfPredicates, 190 NumberOfNonLiveVariables, 2809 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 85/184 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 could not prove your program: Timeout Completed graceful shutdown