/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-more-mts.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:00:02,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:00:02,762 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 23:00:02,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:00:02,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:00:02,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:00:02,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:00:02,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:00:02,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:00:02,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:00:02,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:00:02,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:00:02,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:00:02,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:00:02,792 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:00:02,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:00:02,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:00:02,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:00:02,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:00:02,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:00:02,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:00:02,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:00:02,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:00:02,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:00:02,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:00:02,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:00:02,795 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 23:00:03,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:00:03,045 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:00:03,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:00:03,047 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:00:03,048 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:00:03,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2025-04-13 23:00:04,320 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b46d962d/f5c1534ff74b467dade6385f20096037/FLAGa3273a996 [2025-04-13 23:00:04,505 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:00:04,505 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2025-04-13 23:00:04,511 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b46d962d/f5c1534ff74b467dade6385f20096037/FLAGa3273a996 [2025-04-13 23:00:06,421 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b46d962d/f5c1534ff74b467dade6385f20096037 [2025-04-13 23:00:06,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:00:06,424 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:00:06,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:00:06,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:00:06,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:00:06,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78558f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06, skipping insertion in model container [2025-04-13 23:00:06,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,440 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:00:06,589 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-more-mts.wvr.c[2572,2585] [2025-04-13 23:00:06,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:00:06,604 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:00:06,635 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-more-mts.wvr.c[2572,2585] [2025-04-13 23:00:06,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:00:06,659 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:00:06,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06 WrapperNode [2025-04-13 23:00:06,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:00:06,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:00:06,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:00:06,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:00:06,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,688 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 204 [2025-04-13 23:00:06,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:00:06,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:00:06,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:00:06,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:00:06,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,696 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,714 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 23:00:06,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,726 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,735 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:00:06,735 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:00:06,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:00:06,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:00:06,736 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (1/1) ... [2025-04-13 23:00:06,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:00:06,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:06,756 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 23:00:06,758 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 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 23:00:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 23:00:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 23:00:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:00:06,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:00:06,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:00:06,773 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 23:00:06,867 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:00:06,868 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:00:07,130 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:00:07,131 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:00:07,131 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:00:07,393 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:00:07,396 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:00:07,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:00:07 BoogieIcfgContainer [2025-04-13 23:00:07,397 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:00:07,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:00:07,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:00:07,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:00:07,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:00:06" (1/3) ... [2025-04-13 23:00:07,401 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f93fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:00:07, skipping insertion in model container [2025-04-13 23:00:07,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:00:06" (2/3) ... [2025-04-13 23:00:07,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f93fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:00:07, skipping insertion in model container [2025-04-13 23:00:07,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:00:07" (3/3) ... [2025-04-13 23:00:07,402 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2025-04-13 23:00:07,412 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:00:07,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-mts.wvr.c that has 4 procedures, 24 locations, 25 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 23:00:07,413 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:00:07,457 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 23:00:07,479 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 28 transitions, 77 flow [2025-04-13 23:00:07,502 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 117 states, 116 states have (on average 3.3620689655172415) internal successors, (390), 116 states have internal predecessors, (390), 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 23:00:07,524 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:00:07,534 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;@274d3bbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:00:07,534 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 23:00:07,535 INFO L278 IsEmpty]: Start isEmpty. Operand has 117 states, 116 states have (on average 3.3620689655172415) internal successors, (390), 116 states have internal predecessors, (390), 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 23:00:07,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 23:00:07,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:07,542 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:07,542 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 1 more)] === [2025-04-13 23:00:07,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:07,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1431121573, now seen corresponding path program 1 times [2025-04-13 23:00:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:07,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394306477] [2025-04-13 23:00:07,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:07,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 23:00:07,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 23:00:07,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:07,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:07,761 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 23:00:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:07,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394306477] [2025-04-13 23:00:07,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394306477] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:07,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:07,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:00:07,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629686695] [2025-04-13 23:00:07,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:07,769 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:00:07,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:07,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:00:07,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:00:07,785 INFO L87 Difference]: Start difference. First operand has 117 states, 116 states have (on average 3.3620689655172415) internal successors, (390), 116 states have internal predecessors, (390), 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 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 23:00:07,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:07,852 INFO L93 Difference]: Finished difference Result 141 states and 444 transitions. [2025-04-13 23:00:07,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:00:07,855 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2025-04-13 23:00:07,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:07,864 INFO L225 Difference]: With dead ends: 141 [2025-04-13 23:00:07,864 INFO L226 Difference]: Without dead ends: 117 [2025-04-13 23:00:07,866 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 23:00:07,870 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:07,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:00:07,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-04-13 23:00:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-04-13 23:00:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 3.1724137931034484) internal successors, (368), 116 states have internal predecessors, (368), 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 23:00:07,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 368 transitions. [2025-04-13 23:00:07,912 INFO L79 Accepts]: Start accepts. Automaton has 117 states and 368 transitions. Word has length 17 [2025-04-13 23:00:07,912 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:07,912 INFO L485 AbstractCegarLoop]: Abstraction has 117 states and 368 transitions. [2025-04-13 23:00:07,913 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 23:00:07,913 INFO L278 IsEmpty]: Start isEmpty. Operand 117 states and 368 transitions. [2025-04-13 23:00:07,915 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 23:00:07,915 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:07,915 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:07,916 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:00:07,916 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 1 more)] === [2025-04-13 23:00:07,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:07,916 INFO L85 PathProgramCache]: Analyzing trace with hash 456050482, now seen corresponding path program 1 times [2025-04-13 23:00:07,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:07,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806029435] [2025-04-13 23:00:07,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:07,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:07,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:00:07,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:00:07,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:07,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:08,128 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 23:00:08,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:08,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806029435] [2025-04-13 23:00:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806029435] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:08,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:08,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:00:08,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874085151] [2025-04-13 23:00:08,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:08,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:00:08,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:08,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:00:08,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:00:08,134 INFO L87 Difference]: Start difference. First operand 117 states and 368 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 23:00:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:08,189 INFO L93 Difference]: Finished difference Result 233 states and 735 transitions. [2025-04-13 23:00:08,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:00:08,189 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2025-04-13 23:00:08,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:08,192 INFO L225 Difference]: With dead ends: 233 [2025-04-13 23:00:08,192 INFO L226 Difference]: Without dead ends: 118 [2025-04-13 23:00:08,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 23:00:08,193 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:08,193 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:00:08,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-04-13 23:00:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-04-13 23:00:08,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 3.1538461538461537) internal successors, (369), 117 states have internal predecessors, (369), 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 23:00:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 369 transitions. [2025-04-13 23:00:08,210 INFO L79 Accepts]: Start accepts. Automaton has 118 states and 369 transitions. Word has length 19 [2025-04-13 23:00:08,210 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:08,210 INFO L485 AbstractCegarLoop]: Abstraction has 118 states and 369 transitions. [2025-04-13 23:00:08,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 23:00:08,211 INFO L278 IsEmpty]: Start isEmpty. Operand 118 states and 369 transitions. [2025-04-13 23:00:08,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:08,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:08,213 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] [2025-04-13 23:00:08,213 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 23:00:08,213 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 1 more)] === [2025-04-13 23:00:08,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash 537775141, now seen corresponding path program 1 times [2025-04-13 23:00:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:08,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887136778] [2025-04-13 23:00:08,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:08,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:08,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:00:08,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:08,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:08,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:08,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:08,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887136778] [2025-04-13 23:00:08,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887136778] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:08,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187666363] [2025-04-13 23:00:08,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:08,348 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 23:00:08,349 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 23:00:08,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:00:08,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:08,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:08,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:08,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:00:08,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:08,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:08,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:08,508 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 23:00:08,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187666363] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:08,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:08,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2025-04-13 23:00:08,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794450608] [2025-04-13 23:00:08,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:08,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 23:00:08,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:08,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 23:00:08,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:00:08,509 INFO L87 Difference]: Start difference. First operand 118 states and 369 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 23:00:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:08,588 INFO L93 Difference]: Finished difference Result 200 states and 627 transitions. [2025-04-13 23:00:08,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:00:08,588 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-04-13 23:00:08,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:08,590 INFO L225 Difference]: With dead ends: 200 [2025-04-13 23:00:08,590 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 23:00:08,590 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:00:08,591 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:08,591 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 23:00:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-04-13 23:00:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 3.1879194630872485) internal successors, (475), 149 states have internal predecessors, (475), 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 23:00:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 475 transitions. [2025-04-13 23:00:08,603 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 475 transitions. Word has length 20 [2025-04-13 23:00:08,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:08,603 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 475 transitions. [2025-04-13 23:00:08,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 23:00:08,603 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 475 transitions. [2025-04-13 23:00:08,604 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:00:08,604 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:08,604 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] [2025-04-13 23:00:08,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 23:00:08,804 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:08,804 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 1 more)] === [2025-04-13 23:00:08,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 143599502, now seen corresponding path program 1 times [2025-04-13 23:00:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:08,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243151434] [2025-04-13 23:00:08,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:08,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:00:08,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:08,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:08,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:09,698 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 23:00:09,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:09,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243151434] [2025-04-13 23:00:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243151434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:09,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728346082] [2025-04-13 23:00:09,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:09,702 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 23:00:09,704 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 23:00:09,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 23:00:09,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:09,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:09,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:09,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 23:00:09,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:09,849 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 23:00:10,321 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:10,322 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 82 treesize of output 46 [2025-04-13 23:00:10,468 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 23:00:10,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:11,477 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 220 treesize of output 198 [2025-04-13 23:00:11,486 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:11,487 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 406 treesize of output 335 [2025-04-13 23:00:11,991 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 69 treesize of output 61 [2025-04-13 23:00:11,996 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 92 treesize of output 84 [2025-04-13 23:00:12,051 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 23:00:12,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728346082] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:12,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:12,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-04-13 23:00:12,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229566671] [2025-04-13 23:00:12,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:12,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 23:00:12,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:12,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 23:00:12,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:00:12,054 INFO L87 Difference]: Start difference. First operand 150 states and 475 transitions. Second operand has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 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 23:00:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:12,984 INFO L93 Difference]: Finished difference Result 302 states and 958 transitions. [2025-04-13 23:00:12,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:00:12,984 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 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 21 [2025-04-13 23:00:12,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:12,986 INFO L225 Difference]: With dead ends: 302 [2025-04-13 23:00:12,987 INFO L226 Difference]: Without dead ends: 296 [2025-04-13 23:00:12,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:00:12,991 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:12,991 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:00:12,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-13 23:00:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2025-04-13 23:00:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 3.1962264150943396) internal successors, (847), 265 states have internal predecessors, (847), 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 23:00:13,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 847 transitions. [2025-04-13 23:00:13,026 INFO L79 Accepts]: Start accepts. Automaton has 266 states and 847 transitions. Word has length 21 [2025-04-13 23:00:13,027 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:13,027 INFO L485 AbstractCegarLoop]: Abstraction has 266 states and 847 transitions. [2025-04-13 23:00:13,027 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.52) internal successors, (63), 25 states have internal predecessors, (63), 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 23:00:13,027 INFO L278 IsEmpty]: Start isEmpty. Operand 266 states and 847 transitions. [2025-04-13 23:00:13,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:00:13,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:13,028 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] [2025-04-13 23:00:13,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:13,228 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,SelfDestructingSolverStorable3 [2025-04-13 23:00:13,229 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 1 more)] === [2025-04-13 23:00:13,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:13,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1167886378, now seen corresponding path program 2 times [2025-04-13 23:00:13,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:13,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039025642] [2025-04-13 23:00:13,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:13,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:13,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:13,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:13,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:13,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:13,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:13,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039025642] [2025-04-13 23:00:13,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039025642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:13,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368106206] [2025-04-13 23:00:13,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:13,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:13,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:13,820 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 23:00:13,821 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 23:00:13,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:13,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:13,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:13,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:13,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 23:00:13,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:13,922 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 23:00:14,243 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:14,243 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 81 [2025-04-13 23:00:14,410 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 23:00:14,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:15,922 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 62 treesize of output 56 [2025-04-13 23:00:15,924 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 77 treesize of output 71 [2025-04-13 23:00:15,961 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 35 treesize of output 31 [2025-04-13 23:00:15,964 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 43 [2025-04-13 23:00:15,971 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 69 treesize of output 61 [2025-04-13 23:00:15,973 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 92 treesize of output 84 [2025-04-13 23:00:15,984 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 50 treesize of output 44 [2025-04-13 23:00:15,986 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 66 treesize of output 60 [2025-04-13 23:00:16,011 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 23:00:16,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368106206] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:16,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:16,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2025-04-13 23:00:16,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764114117] [2025-04-13 23:00:16,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:16,012 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 23:00:16,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:16,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 23:00:16,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:00:16,012 INFO L87 Difference]: Start difference. First operand 266 states and 847 transitions. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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 23:00:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:18,818 INFO L93 Difference]: Finished difference Result 554 states and 1768 transitions. [2025-04-13 23:00:18,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 23:00:18,818 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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 21 [2025-04-13 23:00:18,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:18,821 INFO L225 Difference]: With dead ends: 554 [2025-04-13 23:00:18,821 INFO L226 Difference]: Without dead ends: 538 [2025-04-13 23:00:18,822 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=487, Invalid=1963, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 23:00:18,822 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:18,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:00:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-04-13 23:00:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 340. [2025-04-13 23:00:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 339 states have (on average 3.2507374631268435) internal successors, (1102), 339 states have internal predecessors, (1102), 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 23:00:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 1102 transitions. [2025-04-13 23:00:18,875 INFO L79 Accepts]: Start accepts. Automaton has 340 states and 1102 transitions. Word has length 21 [2025-04-13 23:00:18,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:18,875 INFO L485 AbstractCegarLoop]: Abstraction has 340 states and 1102 transitions. [2025-04-13 23:00:18,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 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 23:00:18,875 INFO L278 IsEmpty]: Start isEmpty. Operand 340 states and 1102 transitions. [2025-04-13 23:00:18,876 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:00:18,876 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:18,876 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] [2025-04-13 23:00:18,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:00:19,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:19,077 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 1 more)] === [2025-04-13 23:00:19,077 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:19,077 INFO L85 PathProgramCache]: Analyzing trace with hash 455567390, now seen corresponding path program 3 times [2025-04-13 23:00:19,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:19,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618717735] [2025-04-13 23:00:19,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:19,088 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:19,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:19,105 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:19,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:19,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618717735] [2025-04-13 23:00:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618717735] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:19,593 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877540099] [2025-04-13 23:00:19,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:19,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:19,595 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 23:00:19,596 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 23:00:19,638 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:19,656 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:19,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:19,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:19,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 23:00:19,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:19,694 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 23:00:19,927 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 66 treesize of output 38 [2025-04-13 23:00:19,961 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 23:00:19,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:21,188 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 118 treesize of output 108 [2025-04-13 23:00:21,200 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:21,201 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2025-04-13 23:00:21,467 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 116 treesize of output 106 [2025-04-13 23:00:21,489 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 23:00:21,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 153 [2025-04-13 23:00:21,694 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 43 treesize of output 39 [2025-04-13 23:00:21,697 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 55 treesize of output 43 [2025-04-13 23:00:21,705 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 54 treesize of output 48 [2025-04-13 23:00:21,710 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 23:00:21,710 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 70 treesize of output 1 [2025-04-13 23:00:21,747 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 23:00:21,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877540099] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:21,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:21,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2025-04-13 23:00:21,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873000918] [2025-04-13 23:00:21,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:21,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:00:21,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:21,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:00:21,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:00:21,749 INFO L87 Difference]: Start difference. First operand 340 states and 1102 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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 23:00:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:22,926 INFO L93 Difference]: Finished difference Result 704 states and 2284 transitions. [2025-04-13 23:00:22,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:00:22,926 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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 21 [2025-04-13 23:00:22,927 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:22,931 INFO L225 Difference]: With dead ends: 704 [2025-04-13 23:00:22,931 INFO L226 Difference]: Without dead ends: 564 [2025-04-13 23:00:22,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:00:22,933 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:22,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 23:00:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-04-13 23:00:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 352. [2025-04-13 23:00:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 351 states have (on average 3.190883190883191) internal successors, (1120), 351 states have internal predecessors, (1120), 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 23:00:22,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 1120 transitions. [2025-04-13 23:00:22,993 INFO L79 Accepts]: Start accepts. Automaton has 352 states and 1120 transitions. Word has length 21 [2025-04-13 23:00:22,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:22,993 INFO L485 AbstractCegarLoop]: Abstraction has 352 states and 1120 transitions. [2025-04-13 23:00:22,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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 23:00:22,994 INFO L278 IsEmpty]: Start isEmpty. Operand 352 states and 1120 transitions. [2025-04-13 23:00:22,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:00:22,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:22,994 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] [2025-04-13 23:00:23,003 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 23:00:23,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:23,199 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 1 more)] === [2025-04-13 23:00:23,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:23,199 INFO L85 PathProgramCache]: Analyzing trace with hash 659945730, now seen corresponding path program 4 times [2025-04-13 23:00:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:23,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920789131] [2025-04-13 23:00:23,199 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:23,207 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:23,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:23,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:23,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:23,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:23,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:23,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920789131] [2025-04-13 23:00:23,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920789131] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:23,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712327229] [2025-04-13 23:00:23,724 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:23,726 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 23:00:23,727 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 23:00:23,785 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:23,803 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:23,803 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:23,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:23,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 23:00:23,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:23,842 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 23:00:24,084 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 66 treesize of output 38 [2025-04-13 23:00:24,122 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 23:00:24,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:25,294 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 43 treesize of output 39 [2025-04-13 23:00:25,296 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 55 treesize of output 43 [2025-04-13 23:00:25,307 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 118 treesize of output 108 [2025-04-13 23:00:25,319 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:25,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 143 [2025-04-13 23:00:25,499 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 54 treesize of output 48 [2025-04-13 23:00:25,506 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 23:00:25,506 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 70 treesize of output 64 [2025-04-13 23:00:25,574 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 116 treesize of output 106 [2025-04-13 23:00:25,591 INFO L325 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-04-13 23:00:25,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 153 [2025-04-13 23:00:25,809 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 23:00:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712327229] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:25,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:25,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 23 [2025-04-13 23:00:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228137408] [2025-04-13 23:00:25,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:25,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:00:25,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:25,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:00:25,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:00:25,811 INFO L87 Difference]: Start difference. First operand 352 states and 1120 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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 23:00:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:26,697 INFO L93 Difference]: Finished difference Result 455 states and 1442 transitions. [2025-04-13 23:00:26,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:00:26,698 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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 21 [2025-04-13 23:00:26,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:26,700 INFO L225 Difference]: With dead ends: 455 [2025-04-13 23:00:26,700 INFO L226 Difference]: Without dead ends: 444 [2025-04-13 23:00:26,701 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=279, Invalid=1127, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 23:00:26,701 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:26,701 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:00:26,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-04-13 23:00:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 350. [2025-04-13 23:00:26,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 3.189111747851003) internal successors, (1113), 349 states have internal predecessors, (1113), 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 23:00:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1113 transitions. [2025-04-13 23:00:26,765 INFO L79 Accepts]: Start accepts. Automaton has 350 states and 1113 transitions. Word has length 21 [2025-04-13 23:00:26,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:26,765 INFO L485 AbstractCegarLoop]: Abstraction has 350 states and 1113 transitions. [2025-04-13 23:00:26,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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 23:00:26,766 INFO L278 IsEmpty]: Start isEmpty. Operand 350 states and 1113 transitions. [2025-04-13 23:00:26,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:00:26,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:26,766 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] [2025-04-13 23:00:26,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:26,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:26,967 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 1 more)] === [2025-04-13 23:00:26,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:26,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2123359649, now seen corresponding path program 5 times [2025-04-13 23:00:26,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:26,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692662449] [2025-04-13 23:00:26,968 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:26,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:26,974 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:00:26,978 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:26,978 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:26,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:27,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:27,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692662449] [2025-04-13 23:00:27,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692662449] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:27,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914406792] [2025-04-13 23:00:27,028 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:27,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:27,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:27,030 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 23:00:27,032 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 23:00:27,079 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:00:27,097 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:27,097 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:27,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:27,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:00:27,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:27,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:27,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914406792] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:27,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:27,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 23:00:27,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915642741] [2025-04-13 23:00:27,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:27,177 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:00:27,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:27,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:00:27,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:27,177 INFO L87 Difference]: Start difference. First operand 350 states and 1113 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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 23:00:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:27,439 INFO L93 Difference]: Finished difference Result 596 states and 1906 transitions. [2025-04-13 23:00:27,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:00:27,440 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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 22 [2025-04-13 23:00:27,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:27,443 INFO L225 Difference]: With dead ends: 596 [2025-04-13 23:00:27,443 INFO L226 Difference]: Without dead ends: 530 [2025-04-13 23:00:27,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:00:27,444 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:27,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2025-04-13 23:00:27,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 350. [2025-04-13 23:00:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 3.2120343839541547) internal successors, (1121), 349 states have internal predecessors, (1121), 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 23:00:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 1121 transitions. [2025-04-13 23:00:27,518 INFO L79 Accepts]: Start accepts. Automaton has 350 states and 1121 transitions. Word has length 22 [2025-04-13 23:00:27,519 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:27,519 INFO L485 AbstractCegarLoop]: Abstraction has 350 states and 1121 transitions. [2025-04-13 23:00:27,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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 23:00:27,519 INFO L278 IsEmpty]: Start isEmpty. Operand 350 states and 1121 transitions. [2025-04-13 23:00:27,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:00:27,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:27,520 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] [2025-04-13 23:00:27,526 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 23:00:27,720 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:27,720 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 1 more)] === [2025-04-13 23:00:27,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:27,721 INFO L85 PathProgramCache]: Analyzing trace with hash 146422626, now seen corresponding path program 1 times [2025-04-13 23:00:27,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:27,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418943531] [2025-04-13 23:00:27,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:27,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:27,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:27,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:27,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:27,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:27,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:27,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418943531] [2025-04-13 23:00:27,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418943531] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:27,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547043292] [2025-04-13 23:00:27,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:27,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:27,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:27,795 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 23:00:27,800 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 23:00:27,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:27,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:27,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:27,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:27,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:00:27,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:27,894 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547043292] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:27,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-13 23:00:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055580202] [2025-04-13 23:00:27,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:27,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:00:27,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:27,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:00:27,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:27,932 INFO L87 Difference]: Start difference. First operand 350 states and 1121 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 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 23:00:28,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:28,133 INFO L93 Difference]: Finished difference Result 532 states and 1702 transitions. [2025-04-13 23:00:28,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:00:28,133 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 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 22 [2025-04-13 23:00:28,133 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:28,136 INFO L225 Difference]: With dead ends: 532 [2025-04-13 23:00:28,136 INFO L226 Difference]: Without dead ends: 448 [2025-04-13 23:00:28,136 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:28,136 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:28,137 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-04-13 23:00:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 404. [2025-04-13 23:00:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 3.141439205955335) internal successors, (1266), 403 states have internal predecessors, (1266), 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 23:00:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1266 transitions. [2025-04-13 23:00:28,227 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 1266 transitions. Word has length 22 [2025-04-13 23:00:28,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:28,227 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 1266 transitions. [2025-04-13 23:00:28,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 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 23:00:28,227 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 1266 transitions. [2025-04-13 23:00:28,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:00:28,228 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:28,228 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] [2025-04-13 23:00:28,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 23:00:28,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:28,428 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 1 more)] === [2025-04-13 23:00:28,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:28,429 INFO L85 PathProgramCache]: Analyzing trace with hash 646258469, now seen corresponding path program 6 times [2025-04-13 23:00:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:28,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824537169] [2025-04-13 23:00:28,429 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:28,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:28,439 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:00:28,447 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:28,448 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:28,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:28,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824537169] [2025-04-13 23:00:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824537169] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:28,503 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592451773] [2025-04-13 23:00:28,503 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:28,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:28,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:28,505 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 23:00:28,507 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 23:00:28,554 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 2 equivalence classes. [2025-04-13 23:00:28,571 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:28,571 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:28,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:28,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:00:28,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:28,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:28,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:28,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592451773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:28,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:28,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-04-13 23:00:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920999712] [2025-04-13 23:00:28,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:28,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:00:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:28,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:00:28,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:28,661 INFO L87 Difference]: Start difference. First operand 404 states and 1266 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:29,028 INFO L93 Difference]: Finished difference Result 562 states and 1731 transitions. [2025-04-13 23:00:29,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:00:29,028 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:00:29,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:29,031 INFO L225 Difference]: With dead ends: 562 [2025-04-13 23:00:29,031 INFO L226 Difference]: Without dead ends: 554 [2025-04-13 23:00:29,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:00:29,032 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 152 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:29,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 0 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:29,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-04-13 23:00:29,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 430. [2025-04-13 23:00:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.1701631701631703) internal successors, (1360), 429 states have internal predecessors, (1360), 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 23:00:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1360 transitions. [2025-04-13 23:00:29,130 INFO L79 Accepts]: Start accepts. Automaton has 430 states and 1360 transitions. Word has length 22 [2025-04-13 23:00:29,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:29,130 INFO L485 AbstractCegarLoop]: Abstraction has 430 states and 1360 transitions. [2025-04-13 23:00:29,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:29,130 INFO L278 IsEmpty]: Start isEmpty. Operand 430 states and 1360 transitions. [2025-04-13 23:00:29,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:00:29,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:29,131 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] [2025-04-13 23:00:29,137 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 23:00:29,332 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,SelfDestructingSolverStorable9 [2025-04-13 23:00:29,332 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 1 more)] === [2025-04-13 23:00:29,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:29,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1286421411, now seen corresponding path program 7 times [2025-04-13 23:00:29,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:29,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457102557] [2025-04-13 23:00:29,332 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:29,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:29,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:29,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:29,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:29,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:29,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:29,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:29,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457102557] [2025-04-13 23:00:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457102557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:29,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724747317] [2025-04-13 23:00:29,392 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:29,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:29,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:29,394 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 23:00:29,395 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 23:00:29,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:29,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:29,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:29,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:29,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:00:29,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:29,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:29,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724747317] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:29,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-04-13 23:00:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844853332] [2025-04-13 23:00:29,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:29,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-13 23:00:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:29,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-13 23:00:29,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:00:29,535 INFO L87 Difference]: Start difference. First operand 430 states and 1360 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:29,803 INFO L93 Difference]: Finished difference Result 562 states and 1679 transitions. [2025-04-13 23:00:29,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:00:29,804 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:00:29,804 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:29,806 INFO L225 Difference]: With dead ends: 562 [2025-04-13 23:00:29,806 INFO L226 Difference]: Without dead ends: 431 [2025-04-13 23:00:29,807 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:00:29,807 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:29,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-04-13 23:00:29,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 403. [2025-04-13 23:00:29,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 402 states have (on average 3.027363184079602) internal successors, (1217), 402 states have internal predecessors, (1217), 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 23:00:29,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 1217 transitions. [2025-04-13 23:00:29,896 INFO L79 Accepts]: Start accepts. Automaton has 403 states and 1217 transitions. Word has length 22 [2025-04-13 23:00:29,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:29,896 INFO L485 AbstractCegarLoop]: Abstraction has 403 states and 1217 transitions. [2025-04-13 23:00:29,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 13 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:29,896 INFO L278 IsEmpty]: Start isEmpty. Operand 403 states and 1217 transitions. [2025-04-13 23:00:29,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:29,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:29,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:29,903 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 23:00:30,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:30,098 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 1 more)] === [2025-04-13 23:00:30,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash -913387954, now seen corresponding path program 8 times [2025-04-13 23:00:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:30,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828109038] [2025-04-13 23:00:30,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:30,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:30,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:30,110 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:30,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:30,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:30,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828109038] [2025-04-13 23:00:30,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828109038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:30,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121518608] [2025-04-13 23:00:30,179 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:30,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:30,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:30,181 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:30,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:00:30,230 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:30,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:30,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:30,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:30,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:00:30,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:30,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:30,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:30,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121518608] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:30,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:30,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 17 [2025-04-13 23:00:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285256336] [2025-04-13 23:00:30,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:30,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:00:30,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:30,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:00:30,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:00:30,366 INFO L87 Difference]: Start difference. First operand 403 states and 1217 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:30,678 INFO L93 Difference]: Finished difference Result 570 states and 1754 transitions. [2025-04-13 23:00:30,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:00:30,679 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23 [2025-04-13 23:00:30,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:30,681 INFO L225 Difference]: With dead ends: 570 [2025-04-13 23:00:30,681 INFO L226 Difference]: Without dead ends: 556 [2025-04-13 23:00:30,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:00:30,682 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:30,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-04-13 23:00:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 457. [2025-04-13 23:00:30,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 3.162280701754386) internal successors, (1442), 456 states have internal predecessors, (1442), 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 23:00:30,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1442 transitions. [2025-04-13 23:00:30,774 INFO L79 Accepts]: Start accepts. Automaton has 457 states and 1442 transitions. Word has length 23 [2025-04-13 23:00:30,774 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:30,774 INFO L485 AbstractCegarLoop]: Abstraction has 457 states and 1442 transitions. [2025-04-13 23:00:30,774 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:30,775 INFO L278 IsEmpty]: Start isEmpty. Operand 457 states and 1442 transitions. [2025-04-13 23:00:30,775 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:30,775 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:30,775 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:30,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:00:30,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-13 23:00:30,976 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 1 more)] === [2025-04-13 23:00:30,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:30,976 INFO L85 PathProgramCache]: Analyzing trace with hash -48761378, now seen corresponding path program 9 times [2025-04-13 23:00:30,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:30,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033813078] [2025-04-13 23:00:30,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:30,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:30,982 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:30,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:30,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:30,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:31,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:31,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033813078] [2025-04-13 23:00:31,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033813078] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:31,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227894092] [2025-04-13 23:00:31,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:31,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:31,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:31,058 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:31,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 23:00:31,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:31,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:31,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:31,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:31,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:00:31,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:31,186 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:31,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227894092] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:31,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 23:00:31,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350052191] [2025-04-13 23:00:31,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:31,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:00:31,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:31,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:00:31,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:00:31,234 INFO L87 Difference]: Start difference. First operand 457 states and 1442 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:31,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:31,489 INFO L93 Difference]: Finished difference Result 556 states and 1724 transitions. [2025-04-13 23:00:31,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:00:31,490 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23 [2025-04-13 23:00:31,490 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:31,492 INFO L225 Difference]: With dead ends: 556 [2025-04-13 23:00:31,492 INFO L226 Difference]: Without dead ends: 542 [2025-04-13 23:00:31,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:00:31,493 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:31,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-04-13 23:00:31,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 469. [2025-04-13 23:00:31,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 3.1452991452991452) internal successors, (1472), 468 states have internal predecessors, (1472), 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 23:00:31,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1472 transitions. [2025-04-13 23:00:31,595 INFO L79 Accepts]: Start accepts. Automaton has 469 states and 1472 transitions. Word has length 23 [2025-04-13 23:00:31,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:31,595 INFO L485 AbstractCegarLoop]: Abstraction has 469 states and 1472 transitions. [2025-04-13 23:00:31,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:31,595 INFO L278 IsEmpty]: Start isEmpty. Operand 469 states and 1472 transitions. [2025-04-13 23:00:31,596 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:31,596 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:31,596 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:31,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 23:00:31,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 23:00:31,797 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 1 more)] === [2025-04-13 23:00:31,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:31,797 INFO L85 PathProgramCache]: Analyzing trace with hash 870963300, now seen corresponding path program 10 times [2025-04-13 23:00:31,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:31,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149943796] [2025-04-13 23:00:31,798 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:31,802 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:31,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:31,806 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:31,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:31,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149943796] [2025-04-13 23:00:31,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149943796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:31,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037031494] [2025-04-13 23:00:31,854 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:31,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:31,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:31,856 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:31,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:00:31,904 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:31,936 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:31,936 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:31,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:31,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:00:31,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:31,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:31,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:32,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037031494] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:32,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:32,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 14 [2025-04-13 23:00:32,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651910170] [2025-04-13 23:00:32,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:32,042 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:00:32,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:32,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:00:32,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:32,042 INFO L87 Difference]: Start difference. First operand 469 states and 1472 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:32,325 INFO L93 Difference]: Finished difference Result 626 states and 1925 transitions. [2025-04-13 23:00:32,325 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:00:32,325 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23 [2025-04-13 23:00:32,325 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:32,328 INFO L225 Difference]: With dead ends: 626 [2025-04-13 23:00:32,328 INFO L226 Difference]: Without dead ends: 612 [2025-04-13 23:00:32,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:00:32,328 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:32,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 0 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:32,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2025-04-13 23:00:32,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 502. [2025-04-13 23:00:32,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.165668662674651) internal successors, (1586), 501 states have internal predecessors, (1586), 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 23:00:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1586 transitions. [2025-04-13 23:00:32,446 INFO L79 Accepts]: Start accepts. Automaton has 502 states and 1586 transitions. Word has length 23 [2025-04-13 23:00:32,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:32,446 INFO L485 AbstractCegarLoop]: Abstraction has 502 states and 1586 transitions. [2025-04-13 23:00:32,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:32,446 INFO L278 IsEmpty]: Start isEmpty. Operand 502 states and 1586 transitions. [2025-04-13 23:00:32,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:32,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:32,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:32,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 23:00:32,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 23:00:32,648 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 1 more)] === [2025-04-13 23:00:32,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:32,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1552264398, now seen corresponding path program 11 times [2025-04-13 23:00:32,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:32,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183116864] [2025-04-13 23:00:32,648 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:32,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:32,653 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:32,658 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:32,658 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:32,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:32,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:32,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:32,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183116864] [2025-04-13 23:00:32,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183116864] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:32,722 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175798144] [2025-04-13 23:00:32,722 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:32,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:32,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:32,724 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:32,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 23:00:32,781 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:32,801 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:32,801 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:32,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:32,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:00:32,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:32,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:32,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:32,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175798144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:32,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:32,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2025-04-13 23:00:32,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840506359] [2025-04-13 23:00:32,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:32,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 23:00:32,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:32,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 23:00:32,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:00:32,920 INFO L87 Difference]: Start difference. First operand 502 states and 1586 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 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 23:00:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:33,656 INFO L93 Difference]: Finished difference Result 697 states and 2150 transitions. [2025-04-13 23:00:33,656 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 23:00:33,656 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 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 23 [2025-04-13 23:00:33,656 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:33,659 INFO L225 Difference]: With dead ends: 697 [2025-04-13 23:00:33,659 INFO L226 Difference]: Without dead ends: 683 [2025-04-13 23:00:33,659 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=1145, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 23:00:33,660 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:33,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:00:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2025-04-13 23:00:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 524. [2025-04-13 23:00:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 3.2409177820267687) internal successors, (1695), 523 states have internal predecessors, (1695), 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 23:00:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1695 transitions. [2025-04-13 23:00:33,782 INFO L79 Accepts]: Start accepts. Automaton has 524 states and 1695 transitions. Word has length 23 [2025-04-13 23:00:33,782 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:33,782 INFO L485 AbstractCegarLoop]: Abstraction has 524 states and 1695 transitions. [2025-04-13 23:00:33,782 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 16 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 23:00:33,782 INFO L278 IsEmpty]: Start isEmpty. Operand 524 states and 1695 transitions. [2025-04-13 23:00:33,783 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:33,783 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:33,783 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:33,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 23:00:33,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 23:00:33,984 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 1 more)] === [2025-04-13 23:00:33,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash 671661510, now seen corresponding path program 12 times [2025-04-13 23:00:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:33,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055548616] [2025-04-13 23:00:33,984 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:33,989 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:33,995 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:33,995 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:33,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:34,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:34,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055548616] [2025-04-13 23:00:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055548616] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:34,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372989542] [2025-04-13 23:00:34,053 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:34,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:34,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:34,055 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:34,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 23:00:34,108 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:34,124 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:34,125 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:34,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:34,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:00:34,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:34,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:34,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372989542] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2025-04-13 23:00:34,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630913950] [2025-04-13 23:00:34,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:34,249 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:00:34,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:34,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:00:34,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:00:34,250 INFO L87 Difference]: Start difference. First operand 524 states and 1695 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:34,630 INFO L93 Difference]: Finished difference Result 672 states and 2093 transitions. [2025-04-13 23:00:34,633 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:00:34,634 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23 [2025-04-13 23:00:34,634 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:34,637 INFO L225 Difference]: With dead ends: 672 [2025-04-13 23:00:34,637 INFO L226 Difference]: Without dead ends: 658 [2025-04-13 23:00:34,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:00:34,637 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:34,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-04-13 23:00:34,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 502. [2025-04-13 23:00:34,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 3.165668662674651) internal successors, (1586), 501 states have internal predecessors, (1586), 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 23:00:34,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1586 transitions. [2025-04-13 23:00:34,747 INFO L79 Accepts]: Start accepts. Automaton has 502 states and 1586 transitions. Word has length 23 [2025-04-13 23:00:34,748 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:34,748 INFO L485 AbstractCegarLoop]: Abstraction has 502 states and 1586 transitions. [2025-04-13 23:00:34,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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 23:00:34,748 INFO L278 IsEmpty]: Start isEmpty. Operand 502 states and 1586 transitions. [2025-04-13 23:00:34,749 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:34,749 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:34,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:34,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:34,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:34,949 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:34,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1489679760, now seen corresponding path program 13 times [2025-04-13 23:00:34,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:34,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601820896] [2025-04-13 23:00:34,950 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:34,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:34,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:00:34,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:34,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:34,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:35,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601820896] [2025-04-13 23:00:35,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601820896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:35,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880089181] [2025-04-13 23:00:35,016 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:35,018 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:35,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 23:00:35,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:00:35,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:35,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:35,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:35,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:00:35,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:35,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:35,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880089181] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:35,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:35,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 15 [2025-04-13 23:00:35,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442034380] [2025-04-13 23:00:35,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:35,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:00:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:35,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:00:35,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:00:35,220 INFO L87 Difference]: Start difference. First operand 502 states and 1586 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 23:00:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:35,601 INFO L93 Difference]: Finished difference Result 673 states and 2034 transitions. [2025-04-13 23:00:35,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:00:35,601 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 23 [2025-04-13 23:00:35,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:35,604 INFO L225 Difference]: With dead ends: 673 [2025-04-13 23:00:35,604 INFO L226 Difference]: Without dead ends: 659 [2025-04-13 23:00:35,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:00:35,605 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:35,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:35,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-04-13 23:00:35,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 505. [2025-04-13 23:00:35,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 504 states have (on average 3.125) internal successors, (1575), 504 states have internal predecessors, (1575), 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 23:00:35,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 1575 transitions. [2025-04-13 23:00:35,726 INFO L79 Accepts]: Start accepts. Automaton has 505 states and 1575 transitions. Word has length 23 [2025-04-13 23:00:35,726 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:35,726 INFO L485 AbstractCegarLoop]: Abstraction has 505 states and 1575 transitions. [2025-04-13 23:00:35,726 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 states have internal predecessors, (23), 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 23:00:35,726 INFO L278 IsEmpty]: Start isEmpty. Operand 505 states and 1575 transitions. [2025-04-13 23:00:35,727 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:35,727 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:35,727 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] [2025-04-13 23:00:35,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:35,927 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 23:00:35,928 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:35,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash 559015215, now seen corresponding path program 1 times [2025-04-13 23:00:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:35,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89977764] [2025-04-13 23:00:35,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:35,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:00:35,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:35,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:35,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:35,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:35,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:35,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89977764] [2025-04-13 23:00:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89977764] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:35,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894238637] [2025-04-13 23:00:35,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:35,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:35,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:35,983 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:35,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 23:00:36,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:00:36,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:36,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:36,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:36,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:00:36,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:36,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:36,126 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:36,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:36,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894238637] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:36,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:36,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 23:00:36,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265342393] [2025-04-13 23:00:36,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:36,160 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:00:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:36,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:00:36,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:00:36,160 INFO L87 Difference]: Start difference. First operand 505 states and 1575 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:36,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:36,361 INFO L93 Difference]: Finished difference Result 541 states and 1638 transitions. [2025-04-13 23:00:36,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:00:36,362 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:00:36,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:36,364 INFO L225 Difference]: With dead ends: 541 [2025-04-13 23:00:36,364 INFO L226 Difference]: Without dead ends: 316 [2025-04-13 23:00:36,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:36,364 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:36,364 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 0 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:36,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-04-13 23:00:36,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-04-13 23:00:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 315 states have (on average 3.2634920634920634) internal successors, (1028), 315 states have internal predecessors, (1028), 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 23:00:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 1028 transitions. [2025-04-13 23:00:36,450 INFO L79 Accepts]: Start accepts. Automaton has 316 states and 1028 transitions. Word has length 23 [2025-04-13 23:00:36,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:36,450 INFO L485 AbstractCegarLoop]: Abstraction has 316 states and 1028 transitions. [2025-04-13 23:00:36,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:36,450 INFO L278 IsEmpty]: Start isEmpty. Operand 316 states and 1028 transitions. [2025-04-13 23:00:36,451 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:00:36,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:36,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:36,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:36,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 23:00:36,651 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:36,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:36,652 INFO L85 PathProgramCache]: Analyzing trace with hash -2112649662, now seen corresponding path program 2 times [2025-04-13 23:00:36,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:36,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725593261] [2025-04-13 23:00:36,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:36,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:36,656 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:00:36,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:00:36,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:36,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:37,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:37,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725593261] [2025-04-13 23:00:37,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725593261] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:37,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200254780] [2025-04-13 23:00:37,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:37,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:37,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:37,809 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:37,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 23:00:37,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:00:37,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:00:37,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:37,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:37,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 23:00:37,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:37,947 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 23:00:38,596 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:38,596 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 160 treesize of output 88 [2025-04-13 23:00:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:38,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:41,899 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 517 treesize of output 459 [2025-04-13 23:00:41,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:41,908 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 845 treesize of output 723 [2025-04-13 23:00:42,976 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 406 treesize of output 364 [2025-04-13 23:00:42,983 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:42,983 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 553 treesize of output 481 [2025-04-13 23:00:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:43,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200254780] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:43,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:43,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 35 [2025-04-13 23:00:43,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362201088] [2025-04-13 23:00:43,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:43,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:00:43,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:43,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:00:43,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1169, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:00:43,298 INFO L87 Difference]: Start difference. First operand 316 states and 1028 transitions. Second operand has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:44,448 INFO L93 Difference]: Finished difference Result 434 states and 1392 transitions. [2025-04-13 23:00:44,448 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:00:44,449 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 23:00:44,449 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:44,451 INFO L225 Difference]: With dead ends: 434 [2025-04-13 23:00:44,451 INFO L226 Difference]: Without dead ends: 428 [2025-04-13 23:00:44,451 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:00:44,452 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:44,452 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:00:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-04-13 23:00:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 355. [2025-04-13 23:00:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 354 states have (on average 3.305084745762712) internal successors, (1170), 354 states have internal predecessors, (1170), 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 23:00:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 1170 transitions. [2025-04-13 23:00:44,542 INFO L79 Accepts]: Start accepts. Automaton has 355 states and 1170 transitions. Word has length 24 [2025-04-13 23:00:44,542 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:44,543 INFO L485 AbstractCegarLoop]: Abstraction has 355 states and 1170 transitions. [2025-04-13 23:00:44,543 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.0) internal successors, (72), 36 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:44,543 INFO L278 IsEmpty]: Start isEmpty. Operand 355 states and 1170 transitions. [2025-04-13 23:00:44,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:00:44,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:44,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:44,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:44,744 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:44,744 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:44,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:44,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1820205062, now seen corresponding path program 3 times [2025-04-13 23:00:44,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:44,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061662389] [2025-04-13 23:00:44,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:44,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:44,749 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:00:44,764 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:00:44,764 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:44,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:45,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061662389] [2025-04-13 23:00:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061662389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:45,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910741700] [2025-04-13 23:00:45,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:45,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:45,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:45,819 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:45,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 23:00:45,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:00:45,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:00:45,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:45,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 23:00:45,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:45,913 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 23:00:46,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:00:46,517 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:46,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 96 [2025-04-13 23:00:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:46,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:49,032 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 406 treesize of output 364 [2025-04-13 23:00:49,039 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:49,039 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 553 treesize of output 481 [2025-04-13 23:00:49,675 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 517 treesize of output 459 [2025-04-13 23:00:49,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:49,687 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 845 treesize of output 723 [2025-04-13 23:00:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910741700] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:50,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 31 [2025-04-13 23:00:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234194697] [2025-04-13 23:00:50,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:50,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:00:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:50,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:00:50,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:00:50,537 INFO L87 Difference]: Start difference. First operand 355 states and 1170 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 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 23:00:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:52,492 INFO L93 Difference]: Finished difference Result 488 states and 1557 transitions. [2025-04-13 23:00:52,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:00:52,492 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 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 24 [2025-04-13 23:00:52,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:52,494 INFO L225 Difference]: With dead ends: 488 [2025-04-13 23:00:52,495 INFO L226 Difference]: Without dead ends: 482 [2025-04-13 23:00:52,495 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=241, Invalid=1829, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:00:52,495 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:52,495 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:00:52,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-04-13 23:00:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 364. [2025-04-13 23:00:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 363 states have (on average 3.3443526170798896) internal successors, (1214), 363 states have internal predecessors, (1214), 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 23:00:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 1214 transitions. [2025-04-13 23:00:52,601 INFO L79 Accepts]: Start accepts. Automaton has 364 states and 1214 transitions. Word has length 24 [2025-04-13 23:00:52,601 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:52,601 INFO L485 AbstractCegarLoop]: Abstraction has 364 states and 1214 transitions. [2025-04-13 23:00:52,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 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 23:00:52,601 INFO L278 IsEmpty]: Start isEmpty. Operand 364 states and 1214 transitions. [2025-04-13 23:00:52,602 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:00:52,602 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:52,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:52,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 23:00:52,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:52,802 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:52,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -736536102, now seen corresponding path program 4 times [2025-04-13 23:00:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:52,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191807380] [2025-04-13 23:00:52,803 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:52,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:00:52,834 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:00:52,834 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:52,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:53,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:53,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:53,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191807380] [2025-04-13 23:00:53,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191807380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:53,886 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503161780] [2025-04-13 23:00:53,886 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:53,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:53,888 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:53,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 23:00:53,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:00:53,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:00:53,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:53,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:53,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 23:00:53,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:54,591 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:54,591 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 172 treesize of output 88 [2025-04-13 23:00:54,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:54,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:55,628 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:55,628 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 451 treesize of output 243 [2025-04-13 23:00:56,981 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:56,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503161780] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:56,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:56,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 31 [2025-04-13 23:00:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997479479] [2025-04-13 23:00:56,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:56,982 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:00:56,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:56,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:00:56,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:00:56,983 INFO L87 Difference]: Start difference. First operand 364 states and 1214 transitions. Second operand has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 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 23:01:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:00,413 INFO L93 Difference]: Finished difference Result 793 states and 2516 transitions. [2025-04-13 23:01:00,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 23:01:00,413 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 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 24 [2025-04-13 23:01:00,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:00,416 INFO L225 Difference]: With dead ends: 793 [2025-04-13 23:01:00,417 INFO L226 Difference]: Without dead ends: 782 [2025-04-13 23:01:00,417 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=310, Invalid=2882, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:01:00,418 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 318 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:00,418 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 0 Invalid, 2737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:01:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-04-13 23:01:00,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 421. [2025-04-13 23:01:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.3642857142857143) internal successors, (1413), 420 states have internal predecessors, (1413), 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 23:01:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1413 transitions. [2025-04-13 23:01:00,552 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1413 transitions. Word has length 24 [2025-04-13 23:01:00,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:00,552 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1413 transitions. [2025-04-13 23:01:00,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.21875) internal successors, (71), 32 states have internal predecessors, (71), 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 23:01:00,552 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1413 transitions. [2025-04-13 23:01:00,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 23:01:00,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:00,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:00,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 23:01:00,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:00,754 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:00,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:00,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1750253332, now seen corresponding path program 5 times [2025-04-13 23:01:00,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:00,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072848679] [2025-04-13 23:01:00,754 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:00,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:01:00,772 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:01:00,772 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:00,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:01,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:01,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072848679] [2025-04-13 23:01:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072848679] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:01,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674442228] [2025-04-13 23:01:01,941 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:01,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:01,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:01,943 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:01,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 23:01:01,997 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 23:01:02,018 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 23:01:02,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:02,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 23:01:02,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:02,852 INFO L325 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2025-04-13 23:01:02,852 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 203 treesize of output 135 [2025-04-13 23:01:03,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:03,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:09,813 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:09,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 1105 treesize of output 2257 [2025-04-13 23:03:43,562 WARN L656 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-04-13 23:06:08,217 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 23:06:08,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 23:06:08,218 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 23:06:08,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 23:06:08,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 23:06:08,420 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2025-04-13 23:06:08,422 INFO L158 Benchmark]: Toolchain (without parser) took 361998.54ms. Allocated memory was 142.6MB in the beginning and 524.3MB in the end (delta: 381.7MB). Free memory was 100.5MB in the beginning and 181.2MB in the end (delta: -80.7MB). Peak memory consumption was 326.6MB. Max. memory is 8.0GB. [2025-04-13 23:06:08,422 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:06:08,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.56ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 84.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 23:06:08,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.05ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:06:08,423 INFO L158 Benchmark]: Boogie Preprocessor took 45.90ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:06:08,423 INFO L158 Benchmark]: IcfgBuilder took 661.42ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 73.1MB in the end (delta: 7.2MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. [2025-04-13 23:06:08,423 INFO L158 Benchmark]: TraceAbstraction took 361023.76ms. Allocated memory was 142.6MB in the beginning and 524.3MB in the end (delta: 381.7MB). Free memory was 72.3MB in the beginning and 181.2MB in the end (delta: -108.8MB). Peak memory consumption was 299.0MB. Max. memory is 8.0GB. [2025-04-13 23:06:08,424 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.17ms. Allocated memory is still 155.2MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.56ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 84.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.05ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 82.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 45.90ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 80.3MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 661.42ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 73.1MB in the end (delta: 7.2MB). Peak memory consumption was 61.1MB. Max. memory is 8.0GB. * TraceAbstraction took 361023.76ms. Allocated memory was 142.6MB in the beginning and 524.3MB in the end (delta: 381.7MB). Free memory was 72.3MB in the beginning and 181.2MB in the end (delta: -108.8MB). Peak memory consumption was 299.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...